Compressed sensing recovery via nonconvex shrinkage penalties
Top Cited Papers
Open Access
- 18 May 2016
- journal article
- research article
- Published by IOP Publishing in Inverse Problems
- Vol. 32 (7) , 075004
Abstract
The ℓ 0 minimization of compressed sensing is often relaxed to ℓ 1 , which yields easy computation using the shrinkage mapping known as soft thresholding, and can be shown to recover the original solution under certain hypotheses. Recent work has derived a general class of shrinkages and associated nonconvex penalties that better approximate the original ℓ 0 penalty and empirically can recover the original solution from fewer measurements. We specifically examine p-shrinkage and firm thresholding . In this work, we prove that given data and a measurement matrix from a broad class of matrices, one can choose parameters for these classes of shrinkages to guarantee exact recovery of the sparsest solution. We further prove convergence of the algorithm iterative p-shrinkage (IPS) for solving one such relaxed problem.Keywords
All Related Versions
Funding Information
- UC Lab Fees (12-LR-236660)
- US Department of Energy LANL/LDRD
- Division of Graduate Education (1144087)
This publication has 44 references indexed in Scilit:
- Sharp RIP bound for sparse signal and low-rank matrix recoveryApplied and Computational Harmonic Analysis, 2013
- Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants2011
- A note on guaranteed sparse recovery via -minimizationApplied and Computational Harmonic Analysis, 2010
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$IEEE Transactions on Information Theory, 2009
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and ImagesSIAM Review, 2009
- Compressed sensingIEEE Transactions on Information Theory, 2006
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency informationIEEE Transactions on Information Theory, 2006
- Sparse representations in unions of basesIEEE Transactions on Information Theory, 2003
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimizationProceedings of the National Academy of Sciences, 2003
- A generalized uncertainty principle and sparse representation in pairs of basesIEEE Transactions on Information Theory, 2002