DOI: 10.3724/SP.J.1146.2009.01623

Journal of Electronics & Information Technology (电子与信息学报) 2010/32:11 PP.2713-2717

Regularized Adaptive Matching Pursuit Algorithm for Signal Reconstruction Based on Compressive Sensing

Compressive sensing is a novel signal sampling theory under the condition that the signal is sparse or compressible. In this case, the small amount of signal values can be reconstructed accurately when the signal is sparse or compressible. In this paper, a new Regularized Adaptive Matching Pursuit (RAMP) algorithm is presented with the idea of regularization. The proposed algorithm could control the accuracy of reconstruction by both the adaptive process which chooses the candidate set automatically and the regularization process which gets the atoms in the final support set although the sparsity of the original signal is unknown. The experimental results show that the proposed algorithm can get better reconstruction performances and it is superior to other algorithms both visually and objectively.

Key words:Signal processing,Compressive sensing,Sparse representation,Reconstruction algorithm,Matching pursuit

ReleaseDate:2014-07-21 15:30:11

[1] Candés E. Compressive sampling. Proceedings of international congress of mathematicians. Zürich, Switzerland: European Mathematical Society Publishing House, 2006: 1433-1452.

[2] Baraniuk R. Compressive sensing. IEEE Signal Processing Magazine, 2007, 24(4): 118-121.

[3] Zhao Rui-zhen, Liu Xiao-yu, and Li Ching-chung, et al.. Wavelet denoising via sparse representation. Science in China Series F, 2009, 52(8): 1371-1377.

[4] Candès E, Romberg J, and Tao T. Stable signal recovery from incomplete and inaccurate measurements. Communications on Pure and Applied Mathematics, 2006, 59(8): 1207-1223.

[5] Figueiredo M, Nowak R, and Wright S. Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. IEEE Journal of Selected Topics in Signal Processing, 2007, 1(4): 586-597.

[6] Chen S B, Donoho D L, and Saunders M A. Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing, 1998, 20(1): 33-61.

[7] Mallat S and Zhang Z. Matching pursuits with time-frequency dictionaries. IEEE Transactions on Signal Processing, 1993, 41(12): 3397-3415.

[8] Tropp J and Gilbert A. Signal recovery from random measurements via orthogonal matching pursuit. IEEE Transactions on Information Theory, 2008, 53(12): 4655-4666.

[9] Needell D and Vershynin R. Greedy signal recovery and un-certainty principles. Proceedings of the Conference on Computational Imaging,San Jose, USA, SPIE, 2008: 1-12.

[10] Needell D and Vershynin D. Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit. Foundations of Computational Mathematics, 2009, 9(3): 317-334.

[11] Donoho D L, Elad M, and Temlyakov V N. Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Transactions on Information Theory, 2006, 52(1): 6-18.

[12] Dai W and Milenkovic O. Subspace pursuit for compressive sensing signal reconstruction. 2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING, Lausanne, Switzerland, 2008: 402-407.

[13] Needell D and Tropp J A. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. ACM Technical Report 2008-01, California Institute of Technology, Pasadena, 2008, 7.

[14] Candes E and Tao T. Decoding by linear programming. IEEE Transactions on Information Theory, 2005, 51(12): 4203-4215.

[15] Thong T Do, Gan Lu, Nguyen, and Tran D. Sparsity adaptive matching pursuit algorithm for practical compressed sensing. Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, California, 2008, 10: 581-587.

[16] Candès E, Romberg J, and Tao T. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory, 2006, 52(2): 489-509.