Non-adaptive pooling strategies for detection of rare faulty items

We study non-adaptive pooling strategies for detection of rare faulty items. Given a binary sparse N dimensional signal x, how to construct a sparse binary M × N pooling matrix F such that the signal can be reconstructed from the smallest possible number M of measurements y = Fx? We show that a very small number of measurements is possible for random spatially coupled design of pools F. Our design might find application in genetic screening or compressed genotyping. We show that our results are robust with respect to the uncertainty in the matrix F when some elements are mistaken.

[1]  David Saad,et al.  Sparsely spread CDMA—a statistical mechanics-based analysis , 2007, ArXiv.

[2]  Florent Krzakala,et al.  Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices , 2012, ArXiv.

[3]  Andrea Montanari,et al.  Message-passing algorithms for compressed sensing , 2009, Proceedings of the National Academy of Sciences.

[4]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[5]  Yoshiyuki Kabashima,et al.  Compressed sensing with sparse, structured matrices , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[6]  B. Lindström.  On B2-sequences of vectors , 1972 .

[7]  William T. Freeman,et al.  Understanding belief propagation and its generalizations , 2003 .

[8]  Kamil Sh. Zigangirov,et al.  Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.

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

[10]  Toshiyuki Tanaka,et al.  Performance Improvement of Iterative Multiuser Detection for Large Sparsely Spread CDMA Systems by Spatial Coupling , 2012, IEEE Transactions on Information Theory.

[11]  Florent Krzakala,et al.  Compressed sensing of approximately-sparse signals: Phase transitions and optimal reconstruction , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[12]  Yaniv Erlich,et al.  Compressed sensing approach for high throughput carrier screen , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[13]  Dariusz R. Kowalski,et al.  Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness , 2013, Random Struct. Algorithms.

[14]  Rüdiger L. Urbanke,et al.  Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC , 2010, IEEE Transactions on Information Theory.

[15]  Balakrishnan Narayanaswamy,et al.  Sparse measurement systems: applications, analysis, algorithms and design , 2011 .

[16]  Florent Krzakala,et al.  Statistical physics-based reconstruction in compressed sensing , 2011, ArXiv.

[17]  Michael Lentmaier,et al.  Iterative Decoding Threshold Analysis for LDPC Convolutional Codes , 2010, IEEE Transactions on Information Theory.

[18]  Gerhard Fettweis,et al.  Asymptotically good LDPC convolutional codes with AWGN channel thresholds close to the Shannon limit , 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.

[19]  Venkatesh Saligrama,et al.  Non-adaptive group testing: Explicit bounds and novel algorithms , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[20]  Chih-Chun Wang,et al.  Multiuser Detection of Sparsely Spread CDMA , 2008, IEEE Journal on Selected Areas in Communications.

[21]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[22]  Noam Shental,et al.  Rare-Allele Detection Using Compressed Se(que)nsing , 2009, ArXiv.

[23]  Toshiyuki Tanaka,et al.  Improvement of BP-based CDMA multiuser detection by spatial coupling , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[24]  H. S. Shapiro,et al.  A Combinatory Detection Problem , 1963 .

[25]  Florent Krzakala,et al.  Compressed sensing under matrix uncertainty: Optimum thresholds and robust approximate message passing , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[26]  N. Shental,et al.  Identification of rare alleles and their carriers using compressed se(que)nsing , 2010, Nucleic acids research.

[27]  Christian Schlegel,et al.  Multiple Access Demodulation in the Lifted Signal Graph With Spatial Coupling , 2011, IEEE Transactions on Information Theory.

[28]  Michael Brand,et al.  Compressed Genotyping , 2009, IEEE Transactions on Information Theory.

[29]  Nader H. Bshouty,et al.  Optimal Algorithms for the Coin Weighing Problem with a Spring Scale , 2009, COLT.

[30]  Raghunandan M. Kainkaryam,et al.  Pooling Designs for High-Throughput Biological Experiments. , 2010 .

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

[32]  George Atia,et al.  Boolean Compressed Sensing and Noisy Group Testing , 2009, IEEE Transactions on Information Theory.

[33]  Paul Erdgs,et al.  ON TWO PROBLEMS OF INFORMATION THEORY bY PAUL ERDGS and ALFRJ~D RgNYI , 2001 .

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