A nonconvex penalization algorithm with automatic choice of the regularization parameter in sparse imaging
From MaRDI portal
Publication:5228006
Recommendations
- Well-posedness and convergence rates for sparse regularization with sublinear \(l^q\) penalty term
- On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
- A new iterative firm-thresholding algorithm for inverse problems with sparsity constraints
- Computational approaches to non-convex, sparsity-inducing multi-penalty regularization
- Iterative regularization with a general penalty term-theory and application to \(L^{1}\) and \(TV\) regularization
Cites work
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Accelerating the Nonuniform Fast Fourier Transform
- An Iterative $L_{1}$-Based Image Restoration Algorithm With an Adaptive Parameter Estimation
- Compressed sensing
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Decoupled algorithm for MRI reconstruction using nonlocal block matching model: BM3D-MRI
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision
- Online learning and online convex optimization
- Optimal approximations by piecewise smooth functions and associated variational problems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery by Proximal Forward-Backward Splitting
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- The Split Bregman Method for L1-Regularized Problems
Cited in
(11)- A scaled and adaptive FISTA algorithm for signal-dependent sparse image super-resolution problems
- A projected gradient method for nonlinear inverse problems with \(\alpha \ell_1 - \beta \ell_2\) sparsity regularization
- Computational approaches to non-convex, sparsity-inducing multi-penalty regularization
- Nonconvex sparse regularization and splitting algorithms
- Algorithmic versatility of SPF-regularization methods
- 2DNMR data inversion using locally adapted multi-penalty regularization
- A projected gradient method for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization
- A majorize-minimize subspace approach for \(\ell_2-\ell_0\) image regularization
- Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods
- Adaptive multi-penalty regularization based on a generalized Lasso path
- Morozov's discrepancy principle for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization
This page was built for publication: A nonconvex penalization algorithm with automatic choice of the regularization parameter in sparse imaging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5228006)
