Effective zero-norm minimization algorithms for noisy compressed sensing

DOI10.1016/j.jfranklin.2020.03.023zbMath1455.94055OpenAlexW3025873826MaRDI QIDQ2198627

Chen-Kai Huang, Jason Sheng-Hong Tsai, Shu-Mei Guo, Jose I. Canelon, Tzu-Jui Huang, 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)

Related Items (1)

Exploiting prior knowledge in compressed sensing to design robust systems for endoscopy image recovery

Uses Software

• PDCO

Cites Work

• Unnamed Item
• Unnamed Item
• A new modified Barzilai-Borwein gradient method for the quadratic minimization problem
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• The restricted isometry property and its implications for compressed sensing
• A simple proof of the restricted isometry property for random matrices
• Atomic Decomposition by Basis Pursuit
• Using zero-norm constraint for sparse probability density function estimation
• Computational Complexity of Certifying Restricted Isometry Property
• Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
• Compressed sensing and best 𝑘-term approximation
• Decoding by Linear Programming
• Stable recovery of sparse overcomplete representations in the presence of noise
• An approximated scalar sign function approach to optimal anti-windup digital controller design for continuous-time nonlinear systems with input constraints
• Iteratively reweighted least squares minimization for sparse recovery
• Some properties of matrix sign functions derived from continued fractions
• Two-Point Step Size Gradient Methods
• A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
• Fast and Accurate Algorithms for Re-Weighted $\ell _{1}$-Norm Minimization
• Damping Noise-Folding and Enhanced Support Recovery in Compressed Sensing
• $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• Sparse Approximate Solutions to Linear Systems
• Matching pursuits with time-frequency dictionaries
• 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
• l¹-norm penalised orthogonal forward regression
• Stable signal recovery from incomplete and inaccurate measurements
• Sparse Signal Reconstruction via Iterative Support Detection
• Compressed sensing

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