New Improved Algorithms for Compressive Sensing Based on $\ell_{p}$ Norm

作者: Jeevan K. Pant , Wu-Sheng Lu , Andreas Antoniou

DOI: 10.1109/TCSII.2013.2296133

关键词:

摘要: A new algorithm for the reconstruction of sparse signals, which is referred to as lp-regularized least squares ( lp-RLS) algorithm, proposed. The based on minimization a smoothed lp-norm regularized square error with p <; 1 . It uses conjugate-gradient (CG) optimization method in sequential strategy that involves two-parameter continuation technique. An improved version also proposed, entails bisection technique optimizes an inherent regularization parameter. Extensive simulation results show offers signal performance and requires reduced computational effort relative several state-of-the-art competing algorithms. lp-RLS better than basic version, although this achieved at cost increased effort.

参考文章(14)
Scott Shaobing Chen, David L. Donoho, Michael A. Saunders, Atomic Decomposition by Basis Pursuit SIAM Journal on Scientific Computing. ,vol. 20, pp. 33- 61 ,(1998) , 10.1137/S1064827596304010
Simon Foucart, Ming-Jun Lai, Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0<q⩽1 Applied and Computational Harmonic Analysis. ,vol. 26, pp. 395- 407 ,(2009) , 10.1016/J.ACHA.2008.09.001
Michael Zibulevsky, Michael Elad, L1-L2 Optimization in Signal and Image Processing IEEE Signal Processing Magazine. ,vol. 27, pp. 76- 88 ,(2010) , 10.1109/MSP.2010.936023
Ming-Jun Lai, Yangyang Xu, Wotao Yin, Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization SIAM Journal on Numerical Analysis. ,vol. 51, pp. 927- 957 ,(2013) , 10.1137/110840364
David L. Donoho, Arian Maleki, Andrea Montanari, Message-passing algorithms for compressed sensing Proceedings of the National Academy of Sciences of the United States of America. ,vol. 106, pp. 18914- 18919 ,(2009) , 10.1073/PNAS.0909892106
Jeevan K. Pant, Wu-Sheng Lu, Andreas Antoniou, Recovery of sparse signals from noisy measurements using an ℓ p regularized least-squares algorithm pacific rim conference on communications, computers and signal processing. pp. 48- 53 ,(2011) , 10.1109/PACRIM.2011.6032866
H. Mohimani, M. Babaie-Zadeh, C. Jutten, A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm IEEE Transactions on Signal Processing. ,vol. 57, pp. 289- 301 ,(2009) , 10.1109/TSP.2008.2007606
Rayan Saab, Rick Chartrand, Ozgur Yilmaz, Stable sparse approximations via nonconvex optimization international conference on acoustics, speech, and signal processing. pp. 3885- 3888 ,(2008) , 10.1109/ICASSP.2008.4518502
Y.C. Pati, R. Rezaiifar, P.S. Krishnaprasad, Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition asilomar conference on signals, systems and computers. pp. 40- 44 ,(1993) , 10.1109/ACSSC.1993.342465
Emmanuel J. Candes, Terence Tao, Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? IEEE Transactions on Information Theory. ,vol. 52, pp. 5406- 5425 ,(2006) , 10.1109/TIT.2006.885507