Compressed sensing with prior information via maximizing correlation

Compressed sensing (CS) with prior information concerns the problem of reconstructing a sparse signal with the aid of a similar signal which is known beforehand. We consider a new approach to integrate the prior information into CS via maximizing the correlation between the prior knowledge and the desired signal. We then present a geometric analysis for the proposed method under sub-Gaussian measurements. Our results reveal that if the prior information is good enough, then the proposed approach can improve the performance of the standard CS. Simulations are provided to verify our results.

[1]  Jie Tang,et al.  Prior image constrained compressed sensing (PICCS): a method to accurately reconstruct dynamic CT images from highly undersampled projection data sets. , 2008, Medical physics.

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

[3]  Samuel Cheng,et al.  Compressive image sampling with side information , 2009, 2009 16th IEEE International Conference on Image Processing (ICIP).

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

[5]  Wei Lu,et al.  Modified-CS: Modifying compressive sensing for problems with partially known support , 2009, 2009 IEEE International Symposium on Information Theory.

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

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

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

[9]  Chun-Shien Lu,et al.  Distributed compressive video sensing , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

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

[11]  Abbas Mehrabian,et al.  A simple tool for bounding the deviation of random matrices on geometric sets , 2016, ArXiv.

[12]  Rina Foygel,et al.  Corrupted Sensing: Novel Guarantees for Separating Structured Signals , 2013, IEEE Transactions on Information Theory.

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

[14]  Weiyu Xu,et al.  Analyzing Weighted $\ell_1$ Minimization for Sparse Recovery With Nonuniform Sparse Models , 2010, IEEE Transactions on Signal Processing.

[15]  R. Tibshirani.  Regression Shrinkage and Selection via the Lasso , 1996 .

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

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