Boolean Compressed Sensing and Noisy Group Testing

The fundamental task of group testing is to recover a small distinguished subset of items from a large population while efficiently reducing the total number of tests (measurements). The key contribution of this paper is in adopting a new information-theoretic perspective on group testing problems. We formulate the group testing problem as a channel coding/decoding problem and derive a single-letter characterization for the total number of tests used to identify the defective set. Although the focus of this paper is primarily on group testing, our main result is generally applicable to other compressive sensing models.

[1]  Venkatesh Saligrama,et al.  Information Theoretic Bounds for Compressed Sensing , 2008, IEEE Transactions on Information Theory.

[2]  Martin J. Wainwright,et al.  Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting , 2009, IEEE Trans. Inf. Theory.

[3]  A. Sebő.  ON TWO RANDOM SEARCH PROBLEMS , 1985 .

[4]  Venkatesh Saligrama,et al.  Thresholded Basis Pursuit: Support Recovery for Sparse and Approximately Sparse Signals , 2008 .

[5]  D. Du,et al.  Pooling Designs And Nonadaptive Group Testing: Important Tools For Dna Sequencing , 2006 .

[6]  George K. Atia,et al.  A Mutual Information Characterization for Sparse Signal Processing , 2011 .

[7]  Richard C. Singleton,et al.  Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.

[8]  Frank K. Hwang,et al.  Exploring the missing link among d-separable, d_-separable and d-disjunct matrices , 2007, Discret. Appl. Math..

[9]  George Atia,et al.  Noisy group testing: An information theoretic perspective , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[10]  A.C. Gilbert,et al.  Group testing and sparse signal recovery , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[11]  B. M. Fulk.  MATH , 1992 .

[12]  A. Sahai,et al.  Codes to unmask spectrum violators in cognitive radio systems , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[13]  A. Sterrett.  On the Detection of Defective Members of Large Populations , 1957 .

[14]  Sundeep Rangan,et al.  Necessary and Sufficient Conditions for Sparsity Pattern Recovery , 2008, IEEE Transactions on Information Theory.

[15]  R. Dorfman.  The Detection of Defective Members of Large Populations , 1943 .

[16]  Arkadii G. D'yachkov,et al.  Lectures on Designing Screening Experiments , 2014, ArXiv.

[17]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[18]  P. Erdös,et al.  Families of finite sets in which no set is covered by the union ofr others , 1985 .

[19]  G. Reeves,et al.  A note on optimal support recovery in compressed sensing , 2009, 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers.

[20]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[21]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[22]  Toby Berger,et al.  Asymptotic efficiency of two-stage disjunctive testing , 2002, IEEE Trans. Inf. Theory.

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

[24]  M. Malyutov.  The separating property of random matrices , 1978 .

[25]  Kannan Ramchandran,et al.  Denoising by Sparse Approximation: Error Bounds Based on Rate-Distortion Theory , 2006, EURASIP J. Adv. Signal Process..

[26]  Arkadii G. D'yachkov,et al.  A survey of superimposed code theory , 1983 .

[27]  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.

[28]  A. Sahai,et al.  Spectrum Enforcement and Liability Assignment in Cognitive Radio Systems , 2008, 2008 3rd IEEE Symposium on New Frontiers in Dynamic Spectrum Access Networks.