An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration
From MaRDI portal
Publication:1716780
DOI10.1007/s10851-018-0830-0zbMath1487.94034OpenAlexW2858787217WikidataQ113106928 ScholiaQ113106928MaRDI QIDQ1716780
Chunlin Wu, Chao Zeng, Rui Jia
Publication date: 5 February 2019
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-018-0830-0
image restorationtotal variation regularizationlower bound theoryKurdyka-Łojasiewicz propertynon-Lipschitz optimizationnon-convex non-smooth optimization
Applications of mathematical programming (90C90) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (13)
Two-Phase Image Segmentation by Nonconvex Nonsmooth Models with Convergent Alternating Minimization Algorithms ⋮ A General Non-Lipschitz Infimal Convolution Regularized Model: Lower Bound Theory and Algorithm ⋮ A globally convergent algorithm for a constrained non-Lipschitz image restoration model ⋮ A convergent iterative support shrinking algorithm for non-Lipschitz multi-phase image labeling model ⋮ A novel variable exponent non-convex \(\mathrm{TV}^{p, q (x)}\) model in image restoration ⋮ A nonconvex truncated regularization and box-constrained model for CT reconstruction ⋮ A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal ⋮ Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm ⋮ An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing ⋮ The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms ⋮ On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms ⋮ Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems ⋮ An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model *
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Smoothing methods for nonsmooth, nonconvex minimization
- Iterative hard thresholding for compressed sensing
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- On gradients of functions definable in o-minimal structures
- Geometric categories and o-minimal structures
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Constrained TV\(_p\)-\(\ell_2\) model for image restoration
- Atomic Decomposition by Basis Pursuit
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization
- Nonconvex TV$^q$-Models in Image Restoration: Analysis and a Trust-Region Regularization--Based Superlinearly Convergent Solver
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- Linearly Constrained Non-Lipschitz Optimization for Image Restoration
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Clarke Subgradients of Stratifiable Functions
- Restricted isometry properties and nonconvex compressive sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse representations in unions of bases
- Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
- Iteratively reweighted least squares minimization for sparse recovery
- Variational Analysis
- On the Edge Recovery Property of Noncovex Nonsmooth Regularization in Image Restoration
- A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
- Sparse Approximate Solutions to Linear Systems
- Joint image reconstruction and segmentation using the Potts model
- On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision
- Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
- Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
This page was built for publication: An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration
