Discrete Mumford-Shah on graph for mixing matrix estimation - Archive ouverte HAL Access content directly
Journal Articles IEEE Signal Processing Letters Year : 2019

Discrete Mumford-Shah on graph for mixing matrix estimation

Abstract

The discrete Mumford-Shah formalism has been introduced for the image denoising problem, allowing to capture both smooth behavior inside an object and sharp transitions on the boundary. In the present work, we propose first to extend this formalism to graphs and to the problem of mixing matrix estimation. New algorithmic schemes with convergence guarantees relying on proximal alternating minimization strategies are derived and their efficiency (good estimation and robustness to initialization) are evaluated on simulated data, in the context of vote transfer matrix estimation.
Fichier principal
Vignette du fichier
main.pdf (1.14 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01948570 , version 1 (07-12-2018)
hal-01948570 , version 2 (27-05-2019)

Identifiers

Cite

Yacouba Kaloga, Marion Foare, Nelly Pustelnik, Pablo Jensen. Discrete Mumford-Shah on graph for mixing matrix estimation. IEEE Signal Processing Letters, 2019, 26 (9), pp.1275-1279. ⟨10.1109/lsp.2019.2917518⟩. ⟨hal-01948570v2⟩
287 View
387 Download

Altmetric

Share

Gmail Facebook X LinkedIn More