| HAL : hal-00380491, version 3 |
| DOI : 10.1109/TIP.2010.2072512 |
| Fiche détaillée | Récupérer au format |
|
|
| Image Processing, IEEE Transactions on 20, 3 (2011) 657-669 |
|
|
| Versions disponibles : | v1 (01-05-2009) | v2 (07-05-2009) | v3 (11-05-2009) |
|
|
|
|
| Total Variation Projection with First Order Schemes |
|
|
| Jalal Fadili 1Gabriel Peyré 2 |
|
|
| (01/2011) |
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
| 1 : | Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen (GREYC) |
| CNRS : UMR6072 – Université de Caen Basse-Normandie – Ecole Nationale Supérieure d'Ingénieurs de Caen | |
| 2 : | CEntre de REcherches en MAthématiques de la DEcision (CEREMADE) |
| CNRS : UMR7534 – Université Paris IX - Paris Dauphine | |
|
|
|
|
|
|
|
|
| image |
|
|
|
|
| Domaine | : | Informatique/Traitement du signal et de l'image Sciences de l'ingénieur/Traitement du signal et de l'image |
|
|
| Total variation – projection – duality – proximal operator – forward-backward splitting – Nesterov scheme – inverse problems |
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|
|
| hal-00380491, version 3 | |
| http://hal.archives-ouvertes.fr/hal-00380491 | |
| oai:hal.archives-ouvertes.fr:hal-00380491 | |
| Contributeur : Gabriel Peyré | |
| Soumis le : Lundi 11 Mai 2009, 20:17:44 | |
| Dernière modification le : Mercredi 23 Mai 2012, 22:00:17 | |