Dual constrained TV-based regularization

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

Cited literature [11 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00744071
Contributor : Laurent Najman <>
Submitted on : Monday, October 22, 2012 - 11:44:19 AM
Last modification on : Thursday, July 5, 2018 - 2:25:08 PM
Long-term archiving on : Saturday, December 17, 2016 - 3:02:16 AM

File

DCTV-ICASSP.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

1397

Files downloads

295