On oracle-type local recovery guarantees in compressed sensing

We present improved sampling complexity bounds for stable and robust sparse recovery in compressed sensing. Our unified analysis based on l1 minimization encompasses the case where (i) the measurements are block-structured samples in order to reflect the structured acquisition that is often encountered in applications; (ii) the signal has an arbitrary structured sparsity, by results depending on its support S. Within this framework and under a random sign assumption, the number of measurements needed by l1 minimization can be shown to be of the same order than the one required by an oracle least-squares estimator. Moreover, these bounds can be minimized by adapting the variable density sampling to a given prior on the signal support and to the coherence of the measurements. We illustrate both numerically and analytically that our results can be successfully applied to recover Haar wavelet coefficients that are sparse in levels from random Fourier measurements in dimension one and two, which can be of particular interest in imaging problems. Finally, a preliminary numerical investigation shows the potential of this theory for devising adaptive sampling strategies in sparse polynomial approximation.

[1]  Holger Rauhut,et al.  Sparse Legendre expansions via l1-minimization , 2012, J. Approx. Theory.

[2]  Pierre Weiss,et al.  An Analysis of Block Sampling Strategies in Compressed Sensing , 2013, IEEE Transactions on Information Theory.

[3]  Jianguo Zhang,et al.  Optimum linear array for aperture synthesis imaging based on redundant spacing calibration , 2014 .

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

[5]  Adrian Basarab,et al.  Compressed sensing of ultrasound images: Sampling of spatial and frequency domains , 2010, 2010 IEEE Workshop On Signal Processing Systems.

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

[7]  Ben Adcock,et al.  A Note on Compressed Sensing of Structured Sparse Wavelet Coefficients From Subsampled Fourier Measurements , 2014, IEEE Signal Processing Letters.

[8]  Yi Wang,et al.  Description of parallel imaging in MRI using multiple coils , 2000, Magnetic resonance in medicine.

[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]  Joel A. Tropp,et al.  Convex recovery of a structured signal from independent random linear measurements , 2014, ArXiv.

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

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

[13]  Pierre Weiss,et al.  An Algorithm for Variable Density Sampling with Block-Constrained Acquisition , 2014, SIAM J. Imaging Sci..

[14]  Ben Adcock,et al.  Compressed Sensing and Parallel Acquisition , 2016, IEEE Transactions on Information Theory.

[15]  Chen Li,et al.  Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class , 2016, Applied and Computational Harmonic Analysis.

[16]  Pierre Vandergheynst,et al.  On Variable Density Compressive Sampling , 2011, IEEE Signal Processing Letters.

[17]  Pierre Weiss,et al.  Variable Density Sampling with Continuous Trajectories , 2014, SIAM J. Imaging Sci..

[18]  Ben Adcock,et al.  Compressed Sensing Approaches for Polynomial Approximation of High-Dimensional Functions , 2017, 1703.06987.

[19]  Hoang Tran,et al.  Polynomial approximation via compressed sensing of high-dimensional functions on lower sets , 2016, Math. Comput..

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

[21]  Ben Adcock,et al.  The quest for optimal sampling: Computationally efficient, structure-exploiting measurements for compressed sensing , 2014, ArXiv.

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

[23]  慧 廣瀬.  A Mathematical Introduction to Compressive Sensing , 2015 .

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