Effective zero-norm minimization algorithms for noisy compressed sensing
DOI10.1016/J.JFRANKLIN.2020.03.023zbMATH Open1455.94055OpenAlexW3025873826MaRDI QIDQ2198627FDOQ2198627
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
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
Numerical optimization and variational techniques (65K10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cites Work
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Title not available (Why is that?)
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Title not available (Why is that?)
- Matching pursuits with time-frequency dictionaries
- Two-Point Step Size Gradient Methods
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Stable signal recovery from incomplete and inaccurate measurements
- A simple proof of the restricted isometry property for random matrices
- Compressed sensing
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- Compressed sensing and best \(k\)-term approximation
- Reweighted \(\ell_1\)-minimization for sparse solutions to underdetermined linear systems
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Iteratively reweighted least squares minimization for sparse recovery
- Sparse Approximate Solutions to Linear Systems
- Sparse signal reconstruction via iterative support detection
- The restricted isometry property and its implications for compressed sensing
- Atomic decomposition by basis pursuit
- A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
- Some properties of matrix sign functions derived from continued fractions
- A new modified Barzilai-Borwein gradient method for the quadratic minimization problem
- Fast and Accurate Algorithms for Re-Weighted $\ell _{1}$-Norm Minimization
- Damping Noise-Folding and Enhanced Support Recovery in Compressed Sensing
- Using zero-norm constraint for sparse probability density function estimation
- Computational complexity of certifying restricted isometry property
- An approximated scalar sign function approach to optimal anti-windup digital controller design for continuous-time nonlinear systems with input constraints
- \(l^1\)-norm penalised orthogonal forward regression
Cited In (3)
Uses Software
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)