A Majorize-Minimize strategy for subspace optimization applied to image restoration

Abstract : This paper proposes accelerated subspace optimization methods in the context of image restoration. Subspace optimization methods belong to the class of iterative descent algorithms for unconstrained optimization. At each iteration of such methods, a stepsize vector allowing the best combination of several search directions is computed through a multi-dimensional search. It is usually obtained by an inner iterative second-order method ruled by a stopping criterion that guarantees the convergence of the outer algorithm. As an alternative, we propose an original multi-dimensional search strategy based on the majorize-minimize principle. It leads to a closed-form stepsize formula that ensures the convergence of the subspace algorithm whatever the number of inner iterations. The practical efficiency of the proposed scheme is illustrated in the context of edge-preserving image restoration.
Liste complète des métadonnées

Cited literature [46 references]  Display  Hide  Download

Contributor : Emilie Chouzenoux <>
Submitted on : Friday, September 10, 2010 - 11:24:51 AM
Last modification on : Wednesday, December 19, 2018 - 3:02:03 PM
Document(s) archivé(s) le : Saturday, December 11, 2010 - 2:45:02 AM


Files produced by the author(s)


  • HAL Id : hal-00516585, version 1


Emilie Chouzenoux, Jérôme Idier, Saïd Moussaoui. A Majorize-Minimize strategy for subspace optimization applied to image restoration. 2010. ⟨hal-00516585⟩



Record views


Files downloads