Smoothing complex-valued signals on Graphs with Monte-Carlo - Archive ouverte HAL Access content directly
Conference Papers Year : 2023

Smoothing complex-valued signals on Graphs with Monte-Carlo

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.
Fichier principal
Vignette du fichier
2210.08014.pdf (485.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03869873 , version 1 (24-10-2023)

Identifiers

Cite

Hugo Jaquard, Michaël Fanuel, Pierre-Olivier Amblard, Rémi Bardenet, Simon Barthelme, et al.. Smoothing complex-valued signals on Graphs with Monte-Carlo. ICASSP 2023 - IEEE International Conference on Acoustics, Speech and Signal Processing, Jun 2023, Rhodes Island, Greece. ⟨10.1109/ICASSP49357.2023.10096354⟩. ⟨hal-03869873⟩
44 View
2 Download

Altmetric

Share

Gmail Facebook X LinkedIn More