A Majorize-Minimize subspace approach for l2-l0 image regularization
arXiv:1112.6272 · doi:10.1137/11085997X
Abstract
In this work, we consider a class of differentiable criteria for sparse image computing problems, where a nonconvex 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 nonconvex 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.
References in corpus (2)
Cited by in corpus (12)
- Sparse Regularization via Convex Analysis
- Total Variation Denoising via the Moreau Envelope
- Enhanced Sparsity by Non-Separable Regularization
- ICR: Iterative Convex Refinement for Sparse Signal Recovery Using Spike and Slab Priors
- SPOQ -Over- Regularization for Sparse Signal Recovery applied to Mass Spectrometry
- Convergence Rate Analysis of the Majorize-Minimize Subspace Algorithm -- Extended Version
- Disparity and Optical Flow Partitioning Using Extended Potts Priors
- Rational Optimization for Nonlinear Reconstruction with Approximate Penalization
- String-Averaging Incremental Subgradients for Constrained Convex Optimization with Applications to Reconstruction of Tomographic Images
- A Novel Variational Approach for Multiphoton Microscopy Image Restoration: from PSF Estimation to 3D Deconvolution
- A regularized tri-linear approach for optical interferometric imaging
- A Convex-Nonconvex Framework for Enhancing Minimization Induced Penalties