Effective zero-norm minimization algorithms for noisy compressed sensing

DOI10.1016/J.JFRANKLIN.2020.03.023MaRDI QIDQ2198627zbMATHOpenAlexFDO

Authors Shu-Mei Guo, Chen-Kai Huang, Tzu-Jui Huang, Jason Tsai, Jose I. Canelon, Leang-San Shieh

Publication date 15 September 2020

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jfranklin.2020.03.023

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• A reweighted symmetric smoothed function approximating \(L_0\)-norm regularized sparse reconstruction method
• A piecewise linear programming algorithm for sparse signal reconstruction
• Sparse signal reconstruction based on multiparameter approximation function with smoothed \(\ell_0\) norm
• An improved condition of sparse signal reconstruction via \({l_1}\)-\({l_2}\) norm minimization
• A fast sparse signal recovery algorithm based on approximate \(l_0\) norm and hybrid optimization

Cites work

• scientific article; zbMATH DE number 1465030 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
• A new modified Barzilai-Borwein gradient method for the quadratic minimization problem
• A simple proof of the restricted isometry property for random matrices
• An approximated scalar sign function approach to optimal anti-windup digital controller design for continuous-time nonlinear systems with input constraints
• Atomic decomposition by basis pursuit
• Compressed sensing
• Compressed sensing and best \(k\)-term approximation
• Computational complexity of certifying restricted isometry property
• Damping Noise-Folding and Enhanced Support Recovery in Compressed Sensing
• Decoding by Linear Programming
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Fast and Accurate Algorithms for Re-Weighted $\ell _{1}$-Norm Minimization
• Iteratively reweighted least squares minimization for sparse recovery
• Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
• Matching pursuits with time-frequency dictionaries
• Reweighted \(\ell_1\)-minimization for sparse solutions to underdetermined linear systems
• Some properties of matrix sign functions derived from continued fractions
• Sparse Approximate Solutions to Linear Systems
• Sparse signal reconstruction via iterative support detection
• Stable recovery of sparse overcomplete representations in the presence of noise
• Stable signal recovery from incomplete and inaccurate measurements
• The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
• The restricted isometry property and its implications for compressed sensing
• Two-Point Step Size Gradient Methods
• Using zero-norm constraint for sparse probability density function estimation
• \(l^1\)-norm penalised orthogonal forward regression

Cited in

(3)

• Exploiting prior knowledge in compressed sensing to design robust systems for endoscopy image recovery
• Optimal dual certificates for noise robustness bounds in compressive sensing
• A reweighted symmetric smoothed function approximating \(L_0\)-norm regularized sparse reconstruction method

Describes a project that uses

Uses Software

• PDCO

This page was built for publication: Effective zero-norm minimization algorithms for noisy compressed sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198627)