Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)

DOI10.1007/s10915-014-9930-1zbMath1327.65111OpenAlexW1991857131MaRDI QIDQ493283

Qi He, Yifei Lou, Penghang Yin, Jack X. Xin

Publication date: 3 September 2015

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-014-9930-1

zbMATH Keywords

simulated annealingsparse representation\(L_1-L_2\) minimizationcomparison with \(L_{p} \difference of convex programminghighly coherent dictionaryp \in (0,1)\)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items

An efficient semismooth Newton method for adaptive sparse signal recovery problems ⋮ Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence ⋮ A General Framework of Rotational Sparse Approximation in Uncertainty Quantification ⋮ Point source super-resolution via non-convex \(L_1\) based methods ⋮ Variational multiplicative noise removal by DC programming ⋮ DC programming and DCA for solving Brugnano-Casulli piecewise linear systems ⋮ Minimization of $L_1$ Over $L_2$ for Sparse Signal Recovery with Convergence Guarantee ⋮ A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing ⋮ Image Segmentation via Fischer-Burmeister Total Variation and Thresholding ⋮ A novel regularization based on the error function for sparse recovery ⋮ A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization ⋮ Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing ⋮ Stable Image Reconstruction Using Transformed Total Variation Minimization ⋮ Transformed \(\ell_1\) regularization for learning sparse deep neural networks ⋮ Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum ⋮ Sorted \(L_1/L_2\) minimization for sparse signal recovery ⋮ Structured model selection via ℓ1−ℓ2 optimization ⋮ \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery ⋮ Enhanced total variation minimization for stable image reconstruction ⋮ \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization ⋮ Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation ⋮ Open issues and recent advances in DC programming and DCA ⋮ A new hybrid \(l_p\)-\(l_2\) model for sparse solutions with applications to image processing ⋮ Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems ⋮ Fast L1-L2 minimization via a proximal operator ⋮ DC programming and DCA: thirty years of developments ⋮ Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing ⋮ Iteratively Reweighted Group Lasso Based on Log-Composite Regularization ⋮ Alternating direction method of multipliers with difference of convex functions ⋮ \(\ell_1\)- and \(\ell_2\)-norm joint regularization based sparse signal reconstruction scheme ⋮ A Scale-Invariant Approach for Sparse Signal Recovery ⋮ A sparse optimization problem with hybrid \(L_2\)-\(L_p\) regularization for application of magnetic resonance brain images ⋮ Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization ⋮ An image sharpening operator combined with framelet for image deblurring ⋮ ℓ ₁ − αℓ ₂ minimization methods for signal and image reconstruction with impulsive noise removal ⋮ A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization ⋮ Minimization of $\ell_{1-2}$ for Compressed Sensing ⋮ On the grouping effect of the \(l_{1-2}\) models ⋮ Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization ⋮ New Restricted Isometry Property Analysis for $\ell_1-\ell_2$ Minimization Methods ⋮ Limited-Angle CT Reconstruction via the $L_1/L_2$ Minimization ⋮ A Weighted Difference of Anisotropic and Isotropic Total Variation for Relaxed Mumford--Shah Color and Multiphase Image Segmentation ⋮ The Dantzig selector: recovery of signal via ℓ ₁ − αℓ ₂ minimization ⋮ Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise ⋮ A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization

Uses Software

• BLOOMP

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Super-resolution from noisy data
• Compressed sensing with coherent and redundant dictionaries
• Nonstationary Markov chains and convergence of the annealing algorithm
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Ratio and difference of \(l_1\) and \(l_2\) norms and sparse representation with coherent dictionaries
• Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
• A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
• Coherence Pattern–Guided Compressive Sensing with Unresolved Grids
• Decoding by Linear Programming
• Greed is Good: Algorithmic Results for Sparse Approximation
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• Sparse Approximate Solutions to Linear Systems
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization

This page was built for publication: Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)