A Generalized Class of Hard Thresholding Algorithms for Sparse Signal Recovery
From MaRDI portal
Publication:2950600
DOI10.1007/978-3-319-06404-8_4zbMath1398.94057OpenAlexW166603807MaRDI QIDQ2950600
Publication date: 9 October 2015
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-06404-8_4
Related Items
The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing, Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms, Fusion frames and distributed sparsity, Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
Uses Software
Cites Work
- A mathematical introduction to compressive sensing
- Iterative hard thresholding for compressed sensing
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Hard thresholding pursuit algorithms: number of iterations
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
