Pushing the Limits of Sparse Support Recovery Using Correlation Information
Authors:
- 1 February 2015
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 63 (3) , 711-726
Abstract
A new framework for the problem of sparse support recovery is proposed, which exploits statistical information about the unknown sparse signal in the form of its correlation. A key contribution of this paper is to show that if existing algorithms can recover sparse support of size s, then using such correlation information, the guaranteed size of recoverable support can be increased to O(s 2 ), although the sparse signal itself may not be recoverable. This is proved to be possible by (a) formulating the sparse support recovery problem in terms of the covariance matrix of the measurements, and (b) designing a suitable measurement/sampling matrix which inherently exploits the correlation priors. The so-called Khatri-Rao product of the measurement matrix is shown to play an important role in deciding the level of recoverable sparsity. A systematic analysis of the proposed framework is also presented for the cases when the covariance matrix is only approximately known, by estimating it from finite number of measurements, obtained from the Multiple Measurement Vector (MMV) model. In this case, the use of LASSO on the estimated covariance matrix is proposed for recovering the support. However, the recovery may not be exact and hence a probabilistic guarantee is developed both for sources with arbitrary distribution as well as for Gaussian sources. In the latter case, it is shown that such recovery can happen with overwhelming probability as the number of available measurement vectors increases.Keywords
Funding Information
- ONR (N00014-11-1-0676)
- University of Maryland, College Park,
- California Institute of Technology
This publication has 71 references indexed in Scilit:
- Wideband Spectrum Sensing Based on Sub-Nyquist SamplingIEEE Transactions on Signal Processing, 2013
- Correlation-aware techniques for sparse support recovery2012
- Compressive Wideband Power Spectrum EstimationIEEE Transactions on Signal Processing, 2012
- Nested Arrays: A Novel Approach to Array Processing With Enhanced Degrees of FreedomIEEE Transactions on Signal Processing, 2010
- Compressive wide-band spectrum sensing2009
- Algorithms for simultaneous sparse approximation. Part II: Convex relaxationSignal Processing, 2006
- Algorithms for simultaneous sparse approximation. Part I: Greedy pursuitSignal Processing, 2006
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004
- On the uniqueness of multilinear decomposition ofN-way arraysJournal of Chemometrics, 2000
- Modeling of non-Gaussian array data using cumulants: DOA estimation of more sources with less sensorsSignal Processing, 1993