Some applications of $l^\infty$-constraints in image processing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

Some applications of $l^\infty$-constraints in image processing


Our goal in this paper is to give algorithms for minimizing generic regularizing functionals under a $l^\infty$-constraint. We show that many classical models using total variation can be stated under this formalism. Among others are the Rudin-Oscher-Fatemi model, the BV-l1 model, BV-$l^\infty$ model and Meyer's cartoon +texture decomposition model. Then we describe a general convergence algorithm to solve such problems. This algorithm is the projected subgradient descent. We finally give numerical results that show the qualities and limits of our model, and we tackle the question of the use of the total variation to treat bounded noises such as quantization noise.
Fichier principal
Vignette du fichier
RR-6115.pdf (1.36 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00114051 , version 1 (15-11-2006)
inria-00114051 , version 2 (09-02-2007)


  • HAL Id : inria-00114051 , version 2


Pierre Weiss, Gilles Aubert, Laure Blanc-Féraud. Some applications of $l^\infty$-constraints in image processing. [Research Report] RR-6115, INRIA. 2006, pp.33. ⟨inria-00114051v2⟩
214 View
384 Download


Gmail Facebook Twitter LinkedIn More