Majorization-minimization generalized Krylov subspace methods for _p- _q optimization applied to image restoration
From MaRDI portal
Publication:2359752
This paper considers the efficient computation of approximate solutions of \(\ell _p\)-\(\ell _q\) optimization problems that are applied to image restoration. The strategy used to generate adaptive or fixed quadratic majorants is described. A majorize-minimize generalized Krylov subspace algorithm is proposed by combining the majorize-minimize framework with generalized Krylov subspace methods. The convergence of the algorithm is established. Computed examples show that the proposed algorithm is more efficient than the current iteratively reweighted norm algorithm.
Recommendations
- A generalized Krylov subspace method for _p-_q minimization
- A majorization-minimization Golub-Kahan bidiagonalization method for _2-_q mimimization with applications in image restorization
- A majorize-minimize subspace approach for _2-_0 image regularization
- Limited memory restarted ^p-^q minimization methods using generalized Krylov subspaces
- A projection-based algorithm for \(\ell_{2}\)-\(\ell_{p}\) Tikhonov regularization
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A generalized Krylov subspace method for _p-_q minimization
- A unifying approach to isotropic and anisotropic total variation denoising models
- An Arnoldi method for nonlinear eigenvalue problems
- An iteratively approximated gradient projection algorithm for sparse signal reconstruction
- Compressed sensing
- Constrained TV\(_p\)-\(\ell_2\) model for image restoration
- DC programming: overview.
- Efficient Minimization Method for a Generalized Total Variation Functional
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 6276223 (Why is no real title available?)
- Incremental majorization-minimization optimization with application to large-scale machine learning
- Iteratively Reweighted Least Squares: Algorithms, Convergence Analysis, and Numerical Comparisons
- Large-scale Tikhonov regularization via reduction by orthogonal projection
- Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
- Nonlinear total variation based noise removal algorithms
- On the minimization of a Tikhonov functional with a non-convex sparsity constraint
- Regularization tools version 4.0 for matlab 7.3
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Reweighted _1-minimization for sparse solutions to underdetermined linear systems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- The Concave-Convex Procedure
Cited in
(50)- Generalized solution of linear systems and image restoration
- On the choice of regularization matrix for an \(\ell_2\)-\(\ell_q\) minimization method for image restoration
- An ^2-^q regularization method for large discrete ill-posed problems
- A non-convex regularization approach for compressive sensing
- Fast alternating direction multipliers method by generalized Krylov subspaces
- A comparison of parameter choice rules for \(\ell^p\)-\(\ell^q\) minimization
- Krylov subspace split Bregman methods
- Large-scale regression with non-convex loss and penalty
- Two-stage image segmentation based on nonconvex \(\ell_2-\ell_p\) approximation and thresholding
- An \(\ell^p\)-\(\ell^q\) minimization method with cross-validation for the restoration of impulse noise contaminated images
- Fractional Tikhonov regularization with a nonlinear penalty term
- Convex non-convex image segmentation
- Generalized cross validation for \(\ell^p\)-\(\ell^q\) minimization
- Graph Laplacian for image deblurring
- \(L_2\)-\(L_q\) reconstruction model for computational spectrometer
- A majorization-minimization Golub-Kahan bidiagonalization method for _2-_q mimimization with applications in image restorization
- A majorize-minimize subspace approach for _2-_0 image regularization
- Majorize-minimize linesearch for inversion methods involving barrier function optimization
- A generalized Krylov subspace method for _p-_q minimization
- A note on the minimization of a Tikhonov functional with \(\ell^1\)-penalty
- A variational non-linear constrained model for the inversion of FDEM data
- A Krylov subspace type method for electrical impedance tomography
- Modulus-based iterative methods for constrained \(\ell_p\)-\(\ell_q\) minimization
- Iteratively reweighted FGMRES and FLSQR for sparse reconstruction
- Flexible Krylov methods for \(\ell_p\) regularization
- Efficient Minimization Methods of Mixed l2-l1 and l1-l1 Norms for Image Restoration
- Block delayed Majorize-Minimize subspace algorithm for large scale image restoration *
- Limited memory restarted ^p-^q minimization methods using generalized Krylov subspaces
- An efficient implementation of the Gauss-Newton method via generalized Krylov subspaces
- A modulus iteration method for non-negatively constrained TV image restoration
- A computational framework for edge-preserving regularization in dynamic inverse problems
- Variable selection in saturated and supersaturated designs via lp-lq minimization
- A data-driven Kaczmarz iterative regularization method with non-smooth constraints for ill-posed problems
- A variable projection method for large-scale inverse problems with \(\ell^1\) regularization
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
- Variable projection methods for separable nonlinear inverse problems with general-form Tikhonov regularization
- Symmetrization techniques in image deblurring
- A local MM subspace method for solving constrained variational problems in image recovery
- A Flexible Space-Variant Anisotropic Regularization for Image Restoration with Automated Parameter Selection
- Fractional graph Laplacian for image reconstruction
- Software for limited memory restarted \(\ell^p\)-\(\ell^q\) minimization methods using generalized Krylov subspaces
- An alternating direction multiplier method for the inversion of FDEM data
- Convex predictor-nonconvex corrector optimization strategy with application to signal decomposition
- A fractional graph \(\mathrm{La}+\varPsi\) approach to image reconstruction
- Efficient decomposition-based algorithms for _1-regularized inverse problems with column-orthogonal and Kronecker product matrices
- On SCD semismooth^* Newton methods for the efficient minimization of Tikhonov functionals with non-smooth and non-convex penalties
- Augmented flexible Krylov subspace methods with applications to Bayesian inverse problems
- TRIPs-Py: techniques for regularization of inverse problems in Python
- Cartoon-texture image decomposition using least squares and low-rank regularization
- Accelerated preconditioning half thresholding algorithms for \(L_{1/2}\) regularization
This page was built for publication: Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359752)
