Exact discrete minimization for TV+L0 image decomposition models - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Exact discrete minimization for TV+L0 image decomposition models

(1, 2) , (3, 4) , (4)
1
2
3
4

Abstract

Penalized maximum likelihood denoising approaches seek a solution that fulfills a compromise between data fidelity and agreement with a prior model. Penalization terms are generally chosen to enforce smoothness of the solution and to reject noise. The design of a proper penalization term is a difficult task as it has to capture image variability. Image decomposition into two components of different nature, each given a different penalty, is a way to enrich the modeling. We consider the decomposition of an image into a component with bounded variations and a sparse component. The corresponding penalization is the sum of the total variation of the first component and the L0 pseudo-norm of the second component. The minimization problem is highly non-convex, but can still be globally minimized by a minimum s-t-cut computation on a graph. The decomposition model is applied to synthetic aperture radar image denoising.
Fichier principal
Vignette du fichier
graphcuts_image_decomposition_web.pdf (376.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ujm-00985427 , version 1 (29-04-2014)

Identifiers

Cite

Loïc Denis, Florence Tupin, X. Rondeau. Exact discrete minimization for TV+L0 image decomposition models. Image Processing (ICIP), 2010 17th IEEE International Conference on, Sep 2010, Hong Kong SAR China. pp.2525 - 2528, ⟨10.1109/ICIP.2010.5649204⟩. ⟨ujm-00985427⟩
191 View
298 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More