Minimizing L 1 over L 2 norms on the gradient
From MaRDI portal
Publication:5076010
DOI10.1088/1361-6420/ac64fbzbMath1487.94031arXiv2101.00809OpenAlexW3120838973MaRDI QIDQ5076010
Yifei Lou, James G. Nagy, Chao Wang, Chen-nee Chuah, Min Tao
Publication date: 12 May 2022
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.00809
global convergencealternating direction method of multipliers\(L_1/L_2\) minimizationpiecewise constant images
Computing methodologies for image processing (68U10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items
Efficient color image segmentation via quaternion-based \(L_1/L_2\) Regularization ⋮ Low-rank matrix recovery problem minimizing a new ratio of two norms approximating the rank function then using an ADMM-type solver with applications ⋮ Sorted \(L_1/L_2\) minimization for sparse signal recovery
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Nearly unbiased variable selection under minimax concave penalty
- A unified approach to model selection and sparse recovery using regularized least squares
- Nonlinear total variation based noise removal algorithms
- Fractional-order total variation image denoising based on proximity algorithm
- Point source super-resolution via non-convex \(L_1\) based methods
- Super-resolution from noisy data
- Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- A nonconvex model with minimax concave penalty for image restoration
- IR tools: a MATLAB package of iterative regularization methods and large-scale test problems
- AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
- Minimization of transformed \(l_1\) penalty: closed form representation and iterative thresholding algorithms
- Super-Resolution of Positive Sources: The Discrete Setup
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
- A Total Fractional-Order Variation Model for Image Restoration with Nonhomogeneous Boundary Conditions and Its Numerical Solution
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Superresolution via Sparsity Constraints
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Decomposition of images by the anisotropic Rudin-Osher-Fatemi model
- Sparse Approximate Solutions to Linear Systems
- Likelihood-Based Selection and Sharp Parameter Estimation
- Accelerated Schemes for the $L_1/L_2$ Minimization
- A Scale-Invariant Approach for Sparse Signal Recovery
- A Multiplicative Iterative Algorithm for Box-Constrained Penalized Likelihood Image Restoration
- Towards a Mathematical Theory of Super‐resolution
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Stable signal recovery from incomplete and inaccurate measurements
- Total Generalized Variation
- Limited-Angle CT Reconstruction via the $L_1/L_2$ Minimization
