Robust recovery algorithm for compressed sensing in the presence of noise
Authors:
Open Access
- 1 May 2016
- journal article
- research article
- Published by Institution of Engineering and Technology (IET) in IET Signal Processing
- Vol. 10 (3) , 227-236
Abstract
The authors propose entropy minimisation‐based matching pursuit algorithm which has the capability to reject noise even when the noise level is comparable to the signal level. The proposed algorithm can cater to compressible signals and sparse signals with unknown sparsity.Keywords
This publication has 25 references indexed in Scilit:
- Learning Sparsifying TransformsIEEE Transactions on Signal Processing, 2012
- Generalized Orthogonal Matching PursuitIEEE Transactions on Signal Processing, 2012
- Best Basis Compressed SensingIEEE Transactions on Signal Processing, 2010
- Comparing Measures of SparsityIEEE Transactions on Information Theory, 2009
- An Introduction To Compressive SamplingIEEE Signal Processing Magazine, 2008
- Signal Recovery From Random Measurements Via Orthogonal Matching PursuitIEEE Transactions on Information Theory, 2007
- Compressive Sensing [Lecture Notes]IEEE Signal Processing Magazine, 2007
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimizationProceedings of the National Academy of Sciences, 2003