A generalized class of hard thresholding algorithms for sparse signal recovery
From MaRDI portal
Publication:2950600
DOI10.1007/978-3-319-06404-8_4zbMATH Open1398.94057OpenAlexW166603807MaRDI QIDQ2950600FDOQ2950600
Authors: Jean-Luc Bouchot 
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
Recommendations
- Hard thresholding pursuit algorithms: number of iterations
- Hard thresholding pursuit: an algorithm for compressive sensing
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
- Dictionary-sparse recovery via thresholding-based algorithms
Cites Work
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Decoding by Linear Programming
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Iterative hard thresholding for compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- A mathematical introduction to compressive sensing
- Greed is Good: Algorithmic Results for Sparse Approximation
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Hard thresholding pursuit: an algorithm for compressive sensing
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
- Hard thresholding pursuit algorithms: number of iterations
Cited In (22)
- Fusion frames and distributed sparsity
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
- Sparse Signal Reconstruction from Quantized Noisy Measurements via GEM Hard Thresholding
- Matrix pseudoinverse hard thresholding pursuit and sparse recovery problem
- Thresholded Basis Pursuit: LP Algorithm for Order-Wise Optimal Support Recovery for Sparse and Approximately Sparse Signals From Noisy Random Measurements
- A tight bound of hard thresholding
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
- Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms
- Hard thresholding pursuit algorithms: number of iterations
- The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing
- On the sign recovery by least absolute shrinkage and selection operator, thresholded least absolute shrinkage and selection operator, and thresholded basis pursuit denoising
- Analysis of hard-thresholding for distributed compressed sensing with one-bit measurements
- A Lorentzian IHT for complex-valued sparse signal recovery
- Dictionary-sparse recovery via thresholding-based algorithms
- Fast thresholding algorithms with feedbacks for sparse signal recovery
- Structured iterative hard thresholding with on- and off-grid applications
- Convergence on thresholding-based algorithms for dictionary-sparse recovery
- Discrete and Continuous-Time Soft-Thresholding for Dynamic Signal Recovery
- An Impossibility Result for Linear Signal Processing Under Thresholding
- Hard thresholding pursuit: an algorithm for compressive sensing
Uses Software
This page was built for publication: A generalized class of hard thresholding algorithms for sparse signal recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2950600)
