A memory gradient algorithm for l2-l0 regularization with applications to image restoration

Emilie Chouzenoux 1 Jean-Christophe Pesquet 1 Hugues Talbot 1 Anna Jezierska 1
1 LIGM - Laboratoire d'Informatique Gaspard-Monge
Abstract : In this paper, we consider a class of differentiable criteria for sparse image recovery problems. The regularization is applied to a linear transform of the target image. As special cases, it includes edge preserving measures or frame analysis potentials. As shown by our asymptotic results, the considered l2-l0 penalties may be employed to approximate solutions to l0 penalized optimization problems. One of the advantages of the approach is that it allows us to derive an efficient Majorize-Minimize Memory Gradient algorithm. The fast convergence properties of the proposed optimization algorithm are illustrated through image restoration examples.
Keywords : deblurring Non-convex optimization edge preservation sparse representations Majorize-Minimize algorithms inverse problems denoising
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download
https://hal-upec-upem.archives-ouvertes.fr/hal-00687500
Contributor : Emilie Chouzenoux <>
Submitted on : Sunday, July 14, 2013 - 6:42:55 PM
Last modification on : Thursday, July 5, 2018 - 2:25:27 PM
Long-term archiving on : Tuesday, October 15, 2013 - 2:20:09 AM

File

Chouzenoux_ICIP_11.pdf
Publisher files allowed on an open archive

Identifiers

Collections

LIGM_SIGNAL | UNIV-MLV | LIGM_A3SI | LIGM | PARISTECH | ENPC | UPEC-UPEM | ESIEE-PARIS

Citation

Emilie Chouzenoux, Jean-Christophe Pesquet, Hugues Talbot, Anna Jezierska. A memory gradient algorithm for l2-l0 regularization with applications to image restoration. 18th IEEE International Conference on Image Processing (ICIP 2011), Sep 2011, Bruxelles, Belgium. pp.2717-2720, ⟨10.1109/ICIP.2011.6116230⟩. ⟨hal-00687500⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

364

Files downloads

243

Contact

CCSD