Efficient schemes for total variation minimization under constraints in image processing - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2007

Efficient schemes for total variation minimization under constraints in image processing

Résumé

This paper presents new algorithms to minimize total variation and more generally $l^1$-norms under a general convex constraint. The algorithms are based on a recent advance in convex optimization proposed by Yurii Nesterov. Depending on the regularity of the data fidelity term, we solve either a primal problem, either a dual problem. First we show that standard first order schemes allow to get solutions of precision $\epsilon$ in $O(\frac{1}{\epsilon^2})$ iterations at worst. For a general convex constraint, we propose a scheme that allows to obtain a solution of precision $\epsilon$ in $O(\frac{1}{\epsilon})$ iterations. For a strongly convex constraint, we solve a dual problem with a scheme that requires $O(\frac{1}{\sqrt{\epsilon}})$ iterations to get a solution of precision $\epsilon$. Thus, depending on the regularity of the data term, we gain from one to two orders of magnitude in the convergence rates with respect to standard schemes. Finally we perform some numerical experiments which confirm the theoretical results on various problems.
Fichier principal
Vignette du fichier
RR-6260.pdf (2.94 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00166096 , version 1 (31-07-2007)
inria-00166096 , version 2 (02-08-2007)
inria-00166096 , version 3 (07-03-2008)

Identifiants

  • HAL Id : inria-00166096 , version 3

Citer

Pierre Weiss, Gilles Aubert, Laure Blanc-Féraud. Efficient schemes for total variation minimization under constraints in image processing. [Research Report] RR-6260, INRIA. 2007, pp.36. ⟨inria-00166096v3⟩
696 Consultations
1043 Téléchargements

Partager

Gmail Facebook X LinkedIn More