Smoothing Complex-Valued Signals on Graphs with Monte-Carlo

Hugo Jaquard; Michaël Fanuel; Pierre-Olivier Amblard; Rémi Bardenet; Simon Barthelmé; Nicolas Tremblay

ICASSP 2023accepted0 citations

Smoothing Complex-Valued Signals on Graphs with Monte-Carlo

Hugo Jaquard, Michaël Fanuel, Pierre-Olivier Amblard, Rémi Bardenet, Simon Barthelmé, Nicolas Tremblay

Abstract

We introduce new smoothing estimators for complex signals on graphs, based on a recently studied Determinantal Point Process (DPP). These estimators are built from subsets of edges and nodes drawn according to this DPP, making up trees and unicycles, i.e., connected components containing exactly one cycle. We provide a Julia implementation of these estimators and study their performance when applied to a ranking problem.

BibTeX

@inproceedings{icassp2023_smoothingcomplex,
  title = {Smoothing Complex-Valued Signals on Graphs with Monte-Carlo},
  author = {Hugo Jaquard and Michaël Fanuel and Pierre-Olivier Amblard and Rémi Bardenet and Simon Barthelmé and Nicolas Tremblay},
  booktitle = {ICASSP 2023},
  year = {2023}
}