Measurement matrix design for compressive sensing with side information at the encoder

We study the problem of measurement matrix design for Compressive Sensing (CS) when the encoder has access to side information, a signal analogous to the signal of interest. In particular, we propose to incorporate this extra information into the signal acquisition stage via a new design for the measurement matrix. The goal is to reduce the number of encoding measurements, while still allowing perfect signal reconstruction at the decoder. Then, the reconstruction performance of the resulting CS system is analysed in detail assuming the decoder reconstructs the original signal via Basis Pursuit. Finally, Gaussian width tools are exploited to establish a tight theoretical bound for the number of required measurements. Extensive numerical experiments not only validate our approach, but also demonstrate that our design requires fewer measurements for successful signal reconstruction compared with alternative designs, such as an i.i.d. Gaussian matrix.

[1]  Justin K. Romberg,et al.  Sparsity penalties in dynamical system estimation , 2011, 2011 45th Annual Conference on Information Sciences and Systems.

[2]  Miguel R. D. Rodrigues,et al.  Bayesian Compressed Sensing with Heterogeneous Side Information , 2016, 2016 Data Compression Conference (DCC).

[3]  Yonina C. Eldar,et al.  Compressed sensing for longitudinal MRI: An adaptive-weighted approach. , 2014, Medical physics.

[4]  Volkan Cevher,et al.  Dynamic sparse state estimation using ℓ1-ℓ1 minimization: Adaptive-rate measurement bounds, algorithms and applications , 2015, 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[5]  Y. Gordon On Milman's inequality and random subspaces which escape through a mesh in ℝ n , 1988 .

[6]  Hassan Mansour,et al.  Recovery Analysis for Weighted ℓ1-Minimization Using a Null Space Property , 2014, ArXiv.

[7]  Jamie S. Evans,et al.  Compressed Sensing With Prior Information: Information-Theoretic Limits and Practical Decoders , 2013, IEEE Transactions on Signal Processing.

[8]  Weiyu Xu,et al.  Weighted ℓ1 minimization for sparse recovery with prior information , 2009, 2009 IEEE International Symposium on Information Theory.

[9]  Namrata Vaswani,et al.  Modified-CS: Modifying compressive sensing for problems with partially known support , 2009, ISIT.

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

[11]  Volkan Cevher,et al.  Compressive Sensing for Background Subtraction , 2008, ECCV.

[12]  M. Rudelson,et al.  On sparse reconstruction from Fourier and Gaussian measurements , 2008 .

[13]  Miguel R. D. Rodrigues,et al.  Compressed Sensing with Prior Information: Optimal Strategies, Geometry, and Bounds , 2014, ArXiv.

[14]  Ben Adcock,et al.  BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING , 2013, Forum of Mathematics, Sigma.

[15]  Joel A. Tropp,et al.  Living on the edge: phase transitions in convex programs with random data , 2013, 1303.6672.

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

[17]  Babak Hassibi,et al.  Recovery threshold for optimal weight ℓ1 minimization , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[18]  Xing Wang,et al.  Side information-aided compressed sensing reconstruction via approximate message passing , 2013, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

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

[20]  Wei Lu,et al.  Exact Reconstruction Conditions for Regularized Modified Basis Pursuit , 2011, IEEE Transactions on Signal Processing.

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

[22]  A. Robert Calderbank,et al.  Classification and Reconstruction of High-Dimensional Signals From Low-Dimensional Features in the Presence of Side Information , 2014, IEEE Transactions on Information Theory.

[23]  Pablo A. Parrilo,et al.  The Convex Geometry of Linear Inverse Problems , 2010, Foundations of Computational Mathematics.

[24]  Volkan Cevher,et al.  Adaptive-Rate Sparse Signal Reconstruction With Application in Compressive Background Subtraction , 2015, ArXiv.

[25]  Miguel R. D. Rodrigues,et al.  Compressed Sensing With Prior Information: Strategies, Geometry, and Bounds , 2017, IEEE Transactions on Information Theory.

[26]  Michael P. Friedlander,et al.  Probing the Pareto Frontier for Basis Pursuit Solutions , 2008, SIAM J. Sci. Comput..

[27]  Robert D. Nowak,et al.  Compressive wireless sensing , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[28]  Miguel R. D. Rodrigues,et al.  Projection Design for Statistical Compressive Sensing: A Tight Frame Based Approach , 2013, IEEE Transactions on Signal Processing.

[29]  Miguel R. D. Rodrigues,et al.  Compressed sensing with side information: Geometrical interpretation and performance bounds , 2014, 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

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

[31]  Hassan Mansour,et al.  Recovering Compressively Sampled Signals Using Partial Support Information , 2010, IEEE Transactions on Information Theory.

[32]  D. Donoho,et al.  Sparse MRI: The application of compressed sensing for rapid MR imaging , 2007, Magnetic resonance in medicine.