Fast thresholding algorithms with feedbacks for sparse signal recovery

DOI10.1016/j.acha.2013.09.001zbMath1294.65068arXiv1204.3700OpenAlexW2963416009MaRDI QIDQ2252504

Shidong Li, Tiebin Mi, Yu-Long Liu

Publication date: 18 July 2014

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.3700

zbMATH Keywords

convergenceiterative algorithmfeedbacksignal recoverynumerical examplespreconditioningthresholdingsparse representationcompressed sensingnull space tuningrestricted isometry principle

Mathematics Subject Classification ID

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

Related Items (4)

The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing ⋮ Fast Thresholding Algorithms with Feedbacks and Partially Known Support for Compressed Sensing ⋮ The convergence guarantee of the iterative hard thresholding algorithm with suboptimal feedbacks for large systems ⋮ Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots

Uses Software

• CVX
• PDCO
• CoSaMP
• TwIST

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Iterative hard thresholding for compressed sensing
• Iterative thresholding for sparse approximations
• Linear convergence of iterative soft-thresholding
• Iterative thresholding algorithms
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
• Atomic Decomposition by Basis Pursuit
• Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
• Linearized Bregman iterations for compressed sensing
• Non-asymptotic theory of random matrices: extreme singular values
• Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
• On Sparse Representations in Arbitrary Redundant Bases
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Stable recovery of sparse overcomplete representations in the presence of noise
• Sparse representations in unions of bases
• Greed is Good: Algorithmic Results for Sparse Approximation
• Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
• Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
• Uncertainty principles and ideal atomic decomposition
• Sparse Reconstruction by Separable Approximation
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• A generalized uncertainty principle and sparse representation in pairs of bases
• Sparse Approximate Solutions to Linear Systems
• Matching pursuits with time-frequency dictionaries
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Shrinkage rules for variational minimization problems and applications to analytical ultracentrifugation

This page was built for publication: Fast thresholding algorithms with feedbacks for sparse signal recovery