Dual constrained TV-based regularization - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Dual constrained TV-based regularization


Algorithms based on the minimization of the Total Variation are prevalent in computer vision. They are used 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 in a flexible graph data representation by generalizing the constraint on the projection variable. We show how this new formulation of the TV problem may be solved by means of a fast parallel proximal algorithm, which performs better than the classical TV approach for denoising, and is also applicable to inverse problems such as image deblurring.
Fichier principal
Vignette du fichier
DCTV-ICASSP.pdf (189.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00744071 , version 1 (22-10-2012)



Camille Couprie, Hugues Talbot, Jean-Christophe Pesquet, Laurent Najman, Leo Grady. Dual constrained TV-based regularization. Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on, May 2011, Prague, Czech Republic. pp.945 - 948, ⟨10.1109/ICASSP.2011.5946561⟩. ⟨hal-00744071⟩
1621 View
584 Download



Gmail Facebook Twitter LinkedIn More