Abstract : In this work, we consider a class of differentiable criteria for sparse image computing problems, where a non-convex regularization is applied to an arbitrary linear transform of the target image. As special cases, it includes edge preserving measures or frame analysis potentials commonly used in image processing. As shown by our asymptotic results, the l2-l0 penalties we consider may be employed to provide approximate solutions to l0-penalized optimization problems. One of the advantages of the proposed approach is that it allows us to derive an efficient Majorize-Minimize subspace algorithm. The convergence of the algorithm is investigated by using recent results in non-convex optimization. The fast convergence properties of the proposed optimization method are illustrated through image processing examples. In particular, its effectiveness is demonstrated on several data recovery problems.
https://hal.archives-ouvertes.fr/hal-00789962
Contributeur : Emilie Chouzenoux
<>
Soumis le : mardi 19 février 2013 - 10:31:30
Dernière modification le : jeudi 5 juillet 2018 - 14:25:27
