A comparative study of sparse recovery and compressed sensing algorithms with application to AoA estimation

We investigate the performance of some sparse recovery and compressed sensing algorithms when applied to the Angle-of-Arrival (AoA) estimation problem. In particular, we review three different approaches in compressed sensing, namely Pursuit-type, Thresholding-type, and Bayesian-based algorithms. The compressed sensing algorithms reviewed herein are of vast interest when applied to AoA estimation problems because of their ability to resolve sources with a single snapshot and without prior knowledge of the number of sources. We compare the performance of these algorithms in terms of Mean-Square Error (MSE) through simulations.

[1]  T. Blumensath,et al.  Iterative Thresholding for Sparse Approximations , 2008 .

[2]  R. DeVore,et al.  Compressed sensing and best k-term approximation , 2008 .

[3]  Javier Portilla,et al.  Image restoration through l0 analysis-based sparse optimization in tight frames , 2009, 2009 16th IEEE International Conference on Image Processing (ICIP).

[4]  Thomas L. Marzetta,et al.  Detection, Estimation, and Modulation Theory , 1976 .

[5]  T. Blumensath,et al.  Theory and Applications , 2011 .

[6]  M. Melamed.  Detection , 2021, SETI: Astronomy as a Contact Sport.

[7]  Joel A. Tropp,et al.  Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.

[8]  Michael Elad,et al.  Stable recovery of sparse overcomplete representations in the presence of noise , 2006, IEEE Transactions on Information Theory.

[9]  A.H. Sayed,et al.  Network-based wireless location: challenges faced in developing techniques for accurate wireless location information , 2005, IEEE Signal Processing Magazine.

[10]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[11]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[12]  Mike E. Davies,et al.  Gradient Pursuits , 2008, IEEE Transactions on Signal Processing.

[13]  Thomas Kailath,et al.  ESPRIT-estimation of signal parameters via rotational invariance techniques , 1989, IEEE Trans. Acoust. Speech Signal Process..

[14]  Erik G. Larsson,et al.  Linear Regression With a Sparse Parameter Vector , 2007, IEEE Trans. Signal Process..

[15]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[16]  K.J.R. Liu,et al.  Signal processing techniques in network-aided positioning: a survey of state-of-the-art positioning designs , 2005, IEEE Signal Processing Magazine.

[17]  Patrick L. Combettes,et al.  Signal Recovery by Proximal Forward-Backward Splitting , 2005, Multiscale Model. Simul..

[18]  George Eastman House,et al.  Sparse Bayesian Learning and the Relevance Vector Machine , 2001 .

[19]  Richard G. Baraniuk,et al.  Compressive Sensing , 2008, Computer Vision, A Reference Guide.

[20]  Jean-Luc Starck,et al.  Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit , 2012, IEEE Transactions on Information Theory.

[21]  J. Moreau.  Proximité et dualité dans un espace hilbertien , 1965 .

[22]  Rahul Garg,et al.  Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property , 2009, ICML '09.

[23]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[24]  Yoram Bresler,et al.  Exact maximum likelihood parameter estimation of superimposed exponential signals in noise , 1986, IEEE Trans. Acoust. Speech Signal Process..

[25]  Mário A. T. Figueiredo,et al.  Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems , 2007, IEEE Journal of Selected Topics in Signal Processing.

[26]  Alfred O. Hero,et al.  Space-alternating generalized expectation-maximization algorithm , 1994, IEEE Trans. Signal Process..

[27]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[28]  Dirk T. M. Slock,et al.  Sparse recovery using an iterative Variational Bayes algorithm and application to AoA estimation , 2016, 2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT).

[29]  Justin Ziniel,et al.  Fast bayesian matching pursuit , 2008, 2008 Information Theory and Applications Workshop.

[30]  Bhaskar D. Rao,et al.  Performance Analysis of Latent Variable Models with Sparse Priors , 2007 .

[31]  R. O. Schmidt,et al.  Multiple emitter location and signal Parameter estimation , 1986 .

[32]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[33]  T. Engin Tuncer,et al.  Classical and Modern Direction-of-Arrival Estimation , 2009 .

[34]  Tareq Y. Al-Naffouri,et al.  Sparse Reconstruction Using Distribution Agnostic Bayesian Matching Pursuit , 2013, IEEE Transactions on Signal Processing.

[35]  Matthew J. Beal.  Variational algorithms for approximate Bayesian inference , 2003 .

[36]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[37]  D. Donoho,et al.  Sparse nonnegative solution of underdetermined linear equations by linear programming. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[38]  I. Daubechies,et al.  An iterative thresholding algorithm for linear inverse problems with a sparsity constraint , 2003, math/0307152.

[39]  Wenjiang J. Fu.  Penalized Regressions: The Bridge versus the Lasso , 1998 .

[40]  Wei Guo,et al.  Signal Processing Techniques in Network- Aided Positioning , 2005 .

[41]  Balas K. Natarajan,et al.  Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..

[42]  W. Marsden.  I and J , 2012 .

[43]  R.G. Baraniuk,et al.  Compressive Sensing [Lecture Notes] , 2007, IEEE Signal Processing Magazine.

[44]  Arthur Jay Barabell,et al.  Improving the resolution performance of eigenstructure-based direction-finding algorithms , 1983, ICASSP.

[45]  Erik G. Larsson,et al.  Linear Regression With a Sparse Parameter Vector , 2006, IEEE Transactions on Signal Processing.

[46]  Mike E. Davies,et al.  Iterative Hard Thresholding for Compressed Sensing , 2008, ArXiv.

[47]  Michael Elad,et al.  Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[48]  Ehud Weinstein,et al.  Parameter estimation of superimposed signals using the EM algorithm , 1988, IEEE Trans. Acoust. Speech Signal Process..

[49]  Aggelos K. Katsaggelos,et al.  Bayesian Compressive Sensing Using Laplace Priors , 2010, IEEE Transactions on Image Processing.

[50]  Bhaskar D. Rao,et al.  Latent Variable Bayesian Models for Promoting Sparsity , 2011, IEEE Transactions on Information Theory.

[51]  D. Donoho,et al.  Neighborliness of randomly projected simplices in high dimensions. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[52]  Michael Elad,et al.  A generalized uncertainty principle and sparse representation in pairs of bases , 2002, IEEE Trans. Inf. Theory.

[53]  Ilan Ziskind,et al.  Maximum likelihood localization of multiple sources by alternating projection , 1988, IEEE Trans. Acoust. Speech Signal Process..

[54]  Mike E. Davies,et al.  Normalized Iterative Hard Thresholding: Guaranteed Stability and Performance , 2010, IEEE Journal of Selected Topics in Signal Processing.

[55]  David P. Wipf,et al.  Bayesian methods for finding sparse representations , 2006 .