Total Variation Projection with First Order Schemes - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Total Variation Projection with First Order Schemes

Résumé

This paper proposes a new class of algorithms to compute the projection onto the set of images with a total variation bounded by a constant. The projection is computed on a dual formulation of the problem that is minimized using either a one-step gradient descent method or a multi-step Nesterov scheme. This yields iterative algorithms that compute soft thresholding of the dual vector fields. We show the convergence of the method with a convergence rate of O(1/k) for the one step method and O(1/k^2) for the multi-step one, where k is the iteration number. The projection algorithm can be used as a building block in several applications, and we illusrtate it by solving linear inverse problems under total variation constraint. Numerical results show that our algorithm competes favorably with state-of-the-art TV projection methods to solve denoising, inpainting and deblurring problems.
Fichier principal
Vignette du fichier
FadiliPeyreTVProj.pdf (533.97 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00401251 , version 1 (02-07-2009)

Identifiants

  • HAL Id : hal-00401251 , version 1

Citer

Jalal M. Fadili, Gabriel Peyré. Total Variation Projection with First Order Schemes. ICIP'09, Nov 2009, Cairo, Egypt. pp.1325-1328. ⟨hal-00401251⟩
357 Consultations
232 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More