Denoising-Based Turbo Compressed Sensing
Open Access
- 26 April 2017
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 5, 7193-7204
Abstract
Turbo compressed sensing (Turbo-CS) is an efficient iterative algorithm for sparse signal recovery with partial orthogonal sensing matrices. In this paper, we extend the Turbo-CS algorithm to solve compressed sensing problems involving a more general signal structure, including compressive image recovery and low-rank matrix recovery. A main difficulty for such an extension is that the original Turbo-CS algorithm requires a prior knowledge of the signal distribution that is usually unavailable in practice. To overcome this difficulty, we propose to redesign the Turbo-CS algorithm by employing a generic denoiser that does not depend on the prior distribution, and hence the name denoising-based Turbo-CS (D-Turbo-CS). We then derive the extrinsic information for a generic denoiser by following the Turbo-CS principle. Based on that, we optimize the parametric extrinsic denoisers to minimize the output mean-square error (MSE). Explicit expressions are derived for the extrinsic SURE-LET denoiser used in image denoising and also for the singular value thresholding denoiser used in low-rank matrix denoising. We find that the dynamics of D-Turbo-CS can be well described by a scaler recursion called MSE evolution, similar to the case for Turbo-CS. Numerical results demonstrate that D-Turbo-CS considerably outperforms the counterpart algorithms in both reconstruction quality and running time.Keywords
All Related Versions
Funding Information
- China Recruitment Program of Global Young Experts
- Natural Science Foundation of China (61471241)
This publication has 30 references indexed in Scilit:
- A Singular Value Thresholding Algorithm for Matrix CompletionSIAM Journal on Optimization, 2010
- Message-passing algorithms for compressed sensingProceedings of the National Academy of Sciences of the United States of America, 2009
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samplesApplied and Computational Harmonic Analysis, 2009
- Interior-point methods for optimizationActa Numerica, 2008
- Family of iterative LS-based dictionary learning algorithms, ILS-DLA, for sparse signal representationDigital Signal Processing, 2007
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse RepresentationIEEE Transactions on Signal Processing, 2006
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004
- Near optimum error correcting coding and decoding: turbo-codesIEEE Transactions on Communications, 1996
- Matching pursuits with time-frequency dictionariesIEEE Transactions on Signal Processing, 1993
- Estimation of the Mean of a Multivariate Normal DistributionThe Annals of Statistics, 1981