Adaptive Compressed Sensing for Support Recovery of Structured Sparse Sets

This paper investigates the problem of recovering the support of structured signals via adaptive compressive sensing. We examine several classes of structured support sets, and characterize the fundamental limits of accurately recovering such sets through compressive measurements, while simultaneously providing adaptive support recovery protocols that perform near optimally for these classes. We show that by adaptively designing the sensing matrix, we can attain significant performance gains over non-adaptive protocols. These gains arise from the fact that adaptive sensing can: 1) better mitigate the effects of noise and 2) better capitalize on the structure of the support sets.

[1]  E. Candès,et al.  Detection of an anomalous cluster in a network , 2010, 1001.3209.

[2]  Yu. I. Ingster,et al.  Detection of a sparse submatrix of a high-dimensional noisy matrix , 2011, 1109.0898.

[3]  Terence Tao,et al.  The Dantzig selector: Statistical estimation when P is much larger than n , 2005, math/0506081.

[4]  R. Castro,et al.  Adaptive Sensing for Estimation of Structured Sparse Signals , 2013, IEEE Transactions on Information Theory.

[5]  Luc Devroye,et al.  Combinatorial Testing Problems , 2009, 0908.3437.

[6]  Matthew Malloy,et al.  Near-Optimal Compressive Binary Search , 2012, ArXiv.

[7]  L P Panych,et al.  A dynamically adaptive imaging algorithm for wavelet‐encoded MRI , 1994, Magnetic resonance in medicine.

[8]  Robert D. Nowak,et al.  Compressive distilled sensing: Sparse recovery using adaptivity in compressive measurements , 2009, 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers.

[9]  Ery Arias-Castro.  Detecting a Vector Based on Linear Measurements , 2011, ArXiv.

[10]  Jarvis D. Haupt,et al.  On the Fundamental Limits of Recovering Tree Sparse Vectors From Noisy Linear Measurements , 2013, IEEE Transactions on Information Theory.

[11]  Cem Aksoylar,et al.  Information-theoretic bounds for adaptive sparse recovery , 2014, 2014 IEEE International Symposium on Information Theory.

[12]  R. Castro.  Adaptive sensing performance lower bounds for sparse signal detection and support estimation , 2012, 1206.0648.

[13]  L. Wasserman,et al.  Statistical and computational tradeoffs in biclustering , 2011 .

[14]  Martin J. Wainwright,et al.  Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$ -Constrained Quadratic Programming (Lasso) , 2009, IEEE Transactions on Information Theory.

[15]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[16]  Amir Averbuch,et al.  Adaptive compressed image sensing based on wavelet modeling and direct sampling , 2017 .

[17]  Akshay Krishnamurthy,et al.  Recovering graph-structured activations using adaptive compressive measurements , 2013, 2013 Asilomar Conference on Signals, Systems and Computers.

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

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

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

[21]  Alexandre B. Tsybakov,et al.  Introduction to Nonparametric Estimation , 2008, Springer series in statistics.

[22]  Jarvis D. Haupt,et al.  Efficient adaptive compressive sensing using sparse hierarchical learned dictionaries , 2011, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[23]  Philippe Rigollet,et al.  Complexity Theoretic Lower Bounds for Sparse Principal Component Detection , 2013, COLT.

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

[25]  Ting Sun,et al.  Single-pixel imaging via compressive sampling , 2008, IEEE Signal Process. Mag..

[26]  Holger Rauhut,et al.  A Mathematical Introduction to Compressive Sensing , 2013, Applied and Numerical Harmonic Analysis.

[27]  Venkatesh Saligrama,et al.  Efficient Minimax Signal Detection on Graphs , 2014, NIPS.

[28]  Luca Benini,et al.  Discovering coherent biclusters from gene expression data using zero-suppressed binary decision diagrams , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[29]  C. Craig.  On the Tchebychef Inequality of Bernstein , 1933 .

[30]  Volkan Cevher,et al.  Model-Based Compressive Sensing , 2008, IEEE Transactions on Information Theory.

[31]  E. Arias-Castro,et al.  Community Detection in Random Networks , 2013, 1302.7099.

[32]  Deanna Needell,et al.  Constrained Adaptive Sensing , 2015, IEEE Transactions on Signal Processing.

[33]  Sivaraman Balakrishnan,et al.  Recovering block-structured activations using compressive measurements , 2012, 1209.3431.

[34]  E. Candès,et al.  Searching for a trail of evidence in a maze , 2007, math/0701668.

[35]  Cem Aksoylar,et al.  Sparse Signal Processing With Linear and Nonlinear Observations: A Unified Shannon-Theoretic Approach , 2017, IEEE Trans. Inf. Theory.

[36]  D. Curran‐Everett,et al.  Identification of asthma phenotypes using cluster analysis in the Severe Asthma Research Program. , 2010, American journal of respiratory and critical care medicine.

[37]  Alessandro Rinaldo,et al.  Changepoint Detection over Graphs with the Spectral Scan Statistic , 2012, AISTATS.

[38]  R. Khan,et al.  Sequential Tests of Statistical Hypotheses. , 1972 .