Total Variation Projection with First Order Schemes - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Image Processing Year : 2011

Total Variation Projection with First Order Schemes


This article proposes a new algorithm to compute the projection on the set of images whose total variation is bounded by a constant. The projection is computed through a dual formulation that is solved by first order non-smooth optimization methods. This yields an iterative algorithm that computes iterative soft thresholding of the dual vector fields. This projection algorithm can then be used as a building block in a variety of applications such as solving inverse problems under a total variation constraint, or for texture synthesis. Numerical results show that our algorithm competes favorably with state-of-the-art TV projection methods to solve denoising, texture synthesis, inpainting and deconvolution problems.
Fichier principal
Vignette du fichier
FadiliPeyreTVProj_twocolumns.pdf (775.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00380491 , version 1 (01-05-2009)
hal-00380491 , version 2 (06-05-2009)
hal-00380491 , version 3 (11-05-2009)



Jalal M. Fadili, Gabriel Peyré. Total Variation Projection with First Order Schemes. IEEE Transactions on Image Processing, 2011, 20 (3), pp.657-669. ⟨10.1109/TIP.2010.2072512⟩. ⟨hal-00380491v3⟩
1142 View
1915 Download



Gmail Facebook X LinkedIn More