Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download
Contributor : Marion Foare <>
Submitted on : Monday, May 27, 2019 - 10:17:27 AM
Last modification on : Sunday, November 22, 2020 - 8:53:45 PM


Files produced by the author(s)


  • HAL Id : hal-01948570, version 2


Yacouba Kaloga, Marion Foare, Nelly Pustelnik, Pablo Jensen. Discrete Mumford-Shah on graph for mixing matrix estimation. IEEE Signal Processing Letters, Institute of Electrical and Electronics Engineers, 2019, 26 (9), pp.1275-1279. ⟨hal-01948570v2⟩



Record views


Files downloads