Sensitivity to Basis Mismatch in Compressed Sensing

The theory of compressed sensing suggests that successful inversion of an image of the physical world (broadly defined to include speech signals, radar/sonar returns, vibration records, sensor array snapshot vectors, 2-D images, and so on) for its source modes and amplitudes can be achieved at measurement dimensions far lower than what might be expected from the classical theories of spectrum or modal analysis, provided that the image is sparse in an apriori known basis. For imaging problems in spectrum analysis, and passive and active radar/sonar, this basis is usually taken to be a DFT basis. However, in reality no physical field is sparse in the DFT basis or in any apriori known basis. No matter how finely we grid the parameter space the sources may not lie in the center of the grid cells and consequently there is mismatch between the assumed and the actual bases for sparsity. In this paper, we study the sensitivity of compressed sensing to mismatch between the assumed and the actual sparsity bases. We start by analyzing the effect of basis mismatch on the best k-term approximation error, which is central to providing exact sparse recovery guarantees. We establish achievable bounds for the l1 error of the best k -term approximation and show that these bounds grow linearly with the image (or grid) dimension and the mismatch level between the assumed and actual bases for sparsity. We then derive bounds, with similar growth behavior, for the basis pursuit l1 recovery error, indicating that the sparse recovery may suffer large errors in the presence of basis mismatch. Although, we present our results in the context of basis pursuit, our analysis applies to any sparse recovery principle that relies on the accuracy of best k-term approximations for its performance guarantees. We particularly highlight the problematic nature of basis mismatch in Fourier imaging, where spillage from off-grid DFT components turns a sparse representation into an incompressible one. We substantiate our mathematical analysis by numerical examples that demonstrate a considerable performance degradation for image inversion from compressed sensing measurements in the presence of basis mismatch, for problem sizes common to radar and sonar.

[1]  Edward J. Wegman,et al.  Statistical Signal Processing , 1985 .

[2]  Deanna Needell,et al.  Signal Recovery From Incomplete and Inaccurate Measurements Via Regularized Orthogonal Matching Pursuit , 2007, IEEE Journal of Selected Topics in Signal Processing.

[3]  J. Ward Maximum likelihood angle and velocity estimation with space-time adaptive processing radar , 1996, Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers.

[4]  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.

[5]  A. Robert Calderbank,et al.  Efficient and Robust Compressed Sensing Using Optimized Expander Graphs , 2009, IEEE Transactions on Information Theory.

[6]  M. Viberg,et al.  Two decades of array signal processing research: the parametric approach , 1996, IEEE Signal Process. Mag..

[7]  E. Candès The restricted isometry property and its implications for compressed sensing , 2008 .

[8]  Thomas Strohmer,et al.  General Perturbations of Sparse Signals in Compressed Sensing , 2009 .

[9]  Thomas Kailath,et al.  ESPRIT-A subspace rotation approach to estimation of parameters of cisoids in noise , 1986, IEEE Trans. Acoust. Speech Signal Process..

[10]  Robert D. Nowak,et al.  Compressed channel sensing , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[11]  R. Vershynin,et al.  Signal Recovery from Inaccurate and Incomplete Measurements via Regularized Orthogonal Matching Pursuit , 2010 .

[12]  Thomas Strohmer,et al.  General Deviants: An Analysis of Perturbations in Compressed Sensing , 2009, IEEE Journal of Selected Topics in Signal Processing.

[13]  Volkan Cevher,et al.  A compressive beamforming method , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[14]  Thomas Strohmer,et al.  Compressed Remote Sensing of Sparse Objects , 2009, SIAM J. Imaging Sci..

[15]  C. T. Mullis,et al.  Quadratic Estimators of the Power Spectrum , 1989 .

[16]  Deanna Needell,et al.  Mixed operators in compressed sensing , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).

[17]  Harry L. Van Trees,et al.  Optimum Array Processing , 2002 .

[18]  R. DeVore,et al.  A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .

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

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

[21]  Robert D. Nowak,et al.  Compressed Channel Sensing: A New Approach to Estimating Sparse Multipath Channels , 2010, Proceedings of the IEEE.

[22]  Richard Klemm,et al.  Introduction to space-time adaptive processing , 1998 .

[23]  R. Kumaresan,et al.  Singular value decomposition and improved frequency estimation using linear prediction , 1982 .

[24]  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.

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

[26]  J. Romberg,et al.  Imaging via Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[27]  Thomas Strohmer,et al.  Compressed sensing radar , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[28]  Marco F. Duarte,et al.  Spectral compressive sensing , 2013 .

[29]  R. Baraniuk,et al.  Compressive Radar Imaging , 2007, 2007 IEEE Radar Conference.

[30]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[31]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

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

[33]  J. Tropp,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, Commun. ACM.

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

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

[36]  Michael Elad,et al.  Optimized Projections for Compressed Sensing , 2007, IEEE Transactions on Signal Processing.

[37]  Weiyu Xu,et al.  Compressed sensing of approximately sparse signals , 2008, 2008 IEEE International Symposium on Information Theory.

[38]  R. Kumaresan,et al.  Estimation of frequencies of multiple sinusoids: Making linear prediction perform like maximum likelihood , 1982, Proceedings of the IEEE.

[39]  A. Robert Calderbank,et al.  Construction of a Large Class of Deterministic Sensing Matrices That Satisfy a Statistical Isometry Property , 2009, IEEE Journal of Selected Topics in Signal Processing.

[40]  L. Scharf,et al.  Cramer-Rao bounds for deterministic modal analysis , 1991, [1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers.

[41]  Thomas Strohmer,et al.  High-Resolution Radar via Compressed Sensing , 2008, IEEE Transactions on Signal Processing.

[42]  R. Nowak,et al.  Learning sparse doubly-selective channels , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[43]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[44]  Robert D. Nowak,et al.  Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation , 2010, IEEE Transactions on Information Theory.