Exact performance analysis of the oracle receiver for compressed sensing reconstruction

A sparse or compressible signal can be recovered from a certain number of noisy random projections, smaller than what dictated by classic Shannon/Nyquist theory. In this paper, we derive the closed-form expression of the mean square error performance of the oracle receiver, knowing the sparsity pattern of the signal. With respect to existing bounds, our result is exact and does not depend on a particular realization of the sensing matrix. Moreover, our result holds irrespective of whether the noise affecting the measurements is white or correlated. Numerical results show a perfect match between equations and simulations, confirming the validity of the result.

[1]  Roman Vershynin,et al.  Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.

[2]  Richard G. Baraniuk,et al.  Regime Change: Bit-Depth Versus Measurement-Rate in Compressive Sensing , 2011, IEEE Transactions on Signal Processing.

[3]  S. J. Press,et al.  Applied multivariate analysis : using Bayesian and frequentist methods of inference , 1984 .

[4]  Richard G. Baraniuk,et al.  The Pros and Cons of Compressive Sensing for Wideband Signal Acquisition: Noise Folding versus Dynamic Range , 2011, IEEE Transactions on Signal Processing.

[5]  Gitta Kutyniok,et al.  1 . 2 Sparsity : A Reasonable Assumption ? , 2012 .

[6]  Richard G. Baraniuk,et al.  The Pros and Cons of Compressive Sensing for Wideband Signal Acquisition: Noise Folding vs. Dynamic Range , 2011, ArXiv.

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

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

[9]  Rosen D Von.  On moments of the inverted Wishart distribution , 1997 .

[10]  José A. Díaz-García,et al.  Distribution of the generalised inverse of a random matrix and its applications , 2006 .

[11]  Olgica Milenkovic,et al.  Information Theoretical and Algorithmic Approaches to Quantized Compressive Sensing , 2011, IEEE Transactions on Communications.

[12]  R. Cook,et al.  On the mean and variance of the generalized inverse of a singular Wishart matrix , 2011 .

[13]  Emmanuel J. Candès,et al.  On the Fundamental Limits of Adaptive Sensing , 2011, IEEE Transactions on Information Theory.

[14]  Emmanuel J. Candès,et al.  How well can we estimate a sparse vector? , 2011, ArXiv.

[15]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

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

[17]  Enrico Magli,et al.  Operational Rate-Distortion Performance of Single-Source and Distributed Compressed Sensing , 2014, IEEE Transactions on Communications.

[18]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.