Dual constrained TV-based regularization on graphs - Archive ouverte HAL Access content directly
Journal Articles SIAM Journal on Imaging Sciences Year : 2013

Dual constrained TV-based regularization on graphs


Algorithms based on Total Variation (TV) minimization are prevalent in image processing. They play a key role in a variety of applications such as image denoising, compressive sensing and inverse problems in general. In this work, we extend the TV dual framework that includes Chambolle's and Gilboa-Osher's projection algorithms for TV minimization. We use a flexible graph data representation that allows us to generalize the constraint on the projection variable. We show how this new formulation of the TV problem may be solved by means of fast parallel proximal algorithms. On denoising and deblurring examples, the proposed approach is shown not only to perform better than recent TV-based approaches, but also to perform well on arbitrary graphs instead of regular grids. The proposed method consequently applies to a variety of other inverse problems including image fusion and mesh filtering.
Fichier principal
Vignette du fichier
journal_DCTV.pdf (3.29 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00743968 , version 1 (22-10-2012)
hal-00743968 , version 2 (20-04-2013)



Camille Couprie, Leo Grady, Laurent Najman, Jean-Christophe Pesquet, Hugues Talbot. Dual constrained TV-based regularization on graphs. SIAM Journal on Imaging Sciences, 2013, 6 (3), pp.246-1273. ⟨10.1137/120895068⟩. ⟨hal-00743968v2⟩
2246 View
1345 Download



Gmail Facebook X LinkedIn More