On Compressive orthonormal Sensing

The Compressive Sensing (CS) approach for recovering sparse signal with orthonormal measurements has been studied under various notions of coherence. However, existing notions of coherence either do not exploit the structure of the underlying signal, or are too complicated to provide an explicit sampling scheme for all orthonormal basis sets. Consequently, there is lack of understanding of key factors that guide the sampling of CS with orthonormal measurements and achieve as low sample complexity as possible. In this paper, we introduce a new notion of π-coherence that exploits both the sparsity structure of the signal and the local coherence. Based on π-coherence, we propose a sampling scheme that is adapted to the underlying true signal and is applicable for CS under all orthonormal basis. Our scheme outperforms (up to a constant factor) existing sampling schemes for orthonormal measurements, and achieves a near-optimal sample complexity (up to certain logarithm factors) for several popular choices of orthonormal basis. Furthermore, we characterize the necessary conditions on the sampling schemes for CS with orthonormal measurements. We then propose a practical multi-phase implementation of our sampling scheme, and verify its advantage over existing sampling schemes via application to magnetic resonance imaging (MRI) in medical science.

[1]  Rachel Ward,et al.  Stable and Robust Sampling Strategies for Compressive Imaging , 2012, IEEE Transactions on Image Processing.

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

[3]  E. Candès,et al.  Sparsity and incoherence in compressive sampling , 2006, math/0611957.

[4]  Christos Boutsidis,et al.  An improved approximation algorithm for the column subset selection problem , 2008, SODA.

[5]  David Gross,et al.  Recovering Low-Rank Matrices From Few Coefficients in Any Basis , 2009, IEEE Transactions 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]  Allen Y. Yang,et al.  Robust Face Recognition via Sparse Representation , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Jean-Philippe Thiran,et al.  Spread Spectrum Magnetic Resonance Imaging , 2012, IEEE Transactions on Medical Imaging.

[9]  Pierre Weiss,et al.  Variable density compressed sensing in MRI. Theoretical vs heuristic sampling strategies , 2013, 2013 IEEE 10th International Symposium on Biomedical Imaging.

[10]  Yi Zhou,et al.  Analysis of Robust PCA via Local Incoherence , 2015, NIPS.

[11]  Yudong Chen,et al.  Coherent Matrix Completion , 2013, ICML.

[12]  Robert D. Nowak,et al.  Sequentially designed compressed sensing , 2012, 2012 IEEE Statistical Signal Processing Workshop (SSP).

[13]  H. Rauhut Compressive Sensing and Structured Random Matrices , 2009 .

[14]  Holger Rauhut,et al.  Compressive Sensing with structured random matrices , 2012 .

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

[16]  Peter Börnert,et al.  Spatial excitation using variable‐density spiral trajectories , 2003, Journal of magnetic resonance imaging : JMRI.

[17]  Emmanuel J. Candès,et al.  A Probabilistic and RIPless Theory of Compressed Sensing , 2010, IEEE Transactions on Information Theory.

[18]  Ahmed H. Tewfik,et al.  Adaptive compressed sensing for sparse signals in noise , 2011, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[19]  Matthew Malloy,et al.  Near-Optimal Adaptive Compressed Sensing , 2012, IEEE Transactions on Information Theory.

[20]  Pierre Weiss,et al.  Compressed sensing with structured sparsity and structured acquisition , 2015, Applied and Computational Harmonic Analysis.

[21]  Frédéric Lesage,et al.  The Application of Compressed Sensing for Photo-Acoustic Tomography , 2009, IEEE Transactions on Medical Imaging.

[22]  Zhongmin Wang,et al.  Variable density compressed image sampling , 2009, 2009 17th European Signal Processing Conference.

[23]  Sujay Sanghavi,et al.  Completing any low-rank matrix, provably , 2013, J. Mach. Learn. Res..

[24]  Ben Adcock,et al.  Breaking the coherence barrier: asymptotic incoherence and asymptotic sparsity in compressed sensing , 2013, ArXiv.

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

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

[27]  M. Lustig,et al.  Compressed Sensing MRI , 2008, IEEE Signal Processing Magazine.

[28]  Klaas Paul Pruessmann,et al.  A Fast Wavelet-Based Reconstruction Method for Magnetic Resonance Imaging , 2011, IEEE Transactions on Medical Imaging.

[29]  Michael W. Mahoney Randomized Algorithms for Matrices and Data , 2011, Found. Trends Mach. Learn..