Recovering simple signals

2012 Information Theory and Applications Workshop, ITA 2012 - Conference Proceedings

Volumn , Issue , 2012, Pages 382-391

  Gilbert, Anna C ^a   Hemenway, Brett ^a   Rudra, Atri ^b   Strauss, Martin J ^a   Wootters, Mary ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

^b UNIVERSITY AT BUFFALO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED MODEL; COMBINATORIAL GROUP TESTING; COMPRESSED SENSING; CRYPTOGRAPHIC ASSUMPTIONS; ERROR VECTOR; GROUP TESTING; LIMITED INFORMATION; LOG SPACE; LOWER BOUNDS; ONE-PASS; SPARSE VECTORS; STATISTICAL MODELS;

INFORMATION THEORY;

SIGNAL RECONSTRUCTION;

EID: 84860460972     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITA.2012.6181772     Document Type: Conference Paper

References (45)

1. R. J. Lipton, "A new approach to information theory," in STACS '94: Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science. London, UK: Springer-Verlag, 1994, pp. 699-708.
2. V. Guruswami and A. Smith, "Codes for computationally simple channels: Explicit constructions with optimal rate," 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 723-732, 2010.
3. S. Micali, C. Peikert, M. Sudan, and D. A. Wilson, "Optimal error correction against computationally bounded noise," in TCC, 2005, pp. 1-16.
4. R. Dorfman, "The detection of defective members of large populations," The Annals of Mathematical Statistics, vol. 14, no. 4, pp. 436-440, 1943.
5. H. Q. Ngo and D.-Z. Du, "A survey on combinatorial group testing algorithms with applications to DNA library screening," in Discrete mathematical problems with medical applications (New Brunswick, NJ, 1999), ser. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. Providence, RI: Amer. Math. Soc., 2000, vol. 55, pp. 171-182.
6. R. Kainkaryam and P. Woolf, "poolhits: A shifted transversal design based pooling strategy for high-throughput drug screening,"BMC Bioinformatics, vol. 9, no. 1, 2008.
7. X. Xin, J.-F. F. Rual, T. Hirozane-Kishikawa, D. E. Hill, M. Vidal, C. Boone, and N. Thierry-Mieg, "Shifted transversal design smart-pooling for high coverage interactome mapping." Genome research, vol. 19, no. 7, pp. 1262-1269, July 2009.
8. Kainkaryam, "Pooling in high-throughput drug screening,"Current Opinion in Drug Discovery & Development, vol. 12, no. 3, pp. 339-350, May 2009. [Online]. Available: http://www.biomedcentral.com/content/pdf/cd-1002721. pdf
9. T. Berger, N. Mehravari, D. Towsley, and J. Wolf, "Random multiple-access communications and group testing," IEEE Trans. Commun., vol. 32, no. 7, pp. 769-779, 1984.
10. J. K. Wolf, "Born again group testing: multiaccess communications,"IEEE Transaction on Information Theory, vol. IT-31, pp. 185-191, 1985.
11. S. M. Khattab, S. Gobriel, R. G. Melhem, and D. Mossé, "Live baiting for service-level dos attackers," in INFOCOM, 2008, pp. 171-175.
12. M. T. Goodrich, M. J. Atallah, and R. Tamassia, "Indexing information for data forensics," in Third International Conference on Applied Cryptography and Network Security (ANCS), 2005, pp. 206-221.
13. G. Cormode and S. Muthukrishnan, "What's hot and what's not: tracking most frequent items dynamically," ACM Trans. Database Syst., vol. 30, no. 1, pp. 249-278, 2005.
14. D.-Z. Du and F. K. Hwang, Combinatorial group testing and its applications, 2nd ed., ser. Series on Applied Mathematics. River Edge, NJ: World Scientific Publishing Co. Inc., 2000, vol. 12.
15. Candes, Romberg, and Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Transactions on Information Theory, vol. 52, no. 2, 2006. [Online]. Available: http://www.google.com/search?client=safari&rls=en-us&q= Robust+Uncertainty+Principles: +Exact+Signal+Reconstruction+From+Highly+Incomplete+Frequency+Information& ie=UTF-8&oe=UTF-8
16. D. Donoho, "Compressed sensing," Information Theory, vol. 52, no. 4, pp. 1289-1306, Jan 2006. [Online]. Available: http://ieeexplore.ieee.org/ xpls/abs all.jsp?arnumber=1614066
17. S. Kirolos, J. Laska, M. Wakin, M. Duarte, D. Baron, T. Ragheb, Y. Massoud, and R. Baraniuk, "Analog-to-information conversion via random demodulation," in IEEE Dallas Circuits and Systems Workshop (DCAS), Dallas, Texas, Oct. 2006.
18. M. Vetterli, P. Marziliano, and T. Blu, "Sampling signals with finite rate of innovation," IEEE Trans. Signal Proc., vol. 50, no. 6, June 2002.
19. J. Laska, S. Kirolos, Y. Massoud, R. Baraniuk, A. Gilbert, M. Iwen, and M. Strauss, "Random sampling for analog-to-information conversion of wideband signals," in IEEE Dallas Circuits and Systems Workshop (DCAS), Dallas, Texas, Oct. 2006.
20. Y. Zheng, D. J. Brady, M. E. Sullivan, and B. D. Guenther, "Fiber-optic localization by geometric space coding with a two-dimensional gray code," Applied Optics, vol. 44, no. 20, pp. 4306-4314, 2005.
21. D. Takhar, J. Laska, M. B. Wakin, M. F. Duarte, D. Baron, S. Sarvotham, K. Kelly, and R. G. Baraniuk, "A new compressive imaging camera architecture using optical-domain compression,"in Proc. IS&T/SPIE Symposium on Electronic Imaging, 2006.
22. M. Duarte, M. Davenport, D. Takhar, J. Laska, T. Sun, K. Kelly, and R. Baraniuk, "Single-pixel imaging via compressive sampling,"IEEE Signal Processing Magazine, 2008.
23. Y. Erlich, K. Chang, A. Gordon, R. Ronen, O. Navon, M. Rooks, and G. J. Hannon, "Dna sudoku - harnessing high-throughput sequencing for multiplexed specimen analysis," Genome Research, vol. 19, pp. 1243-1253, 2009.
24. M. Wakin, J. Laska, M. Duarte, D. Baron, S. Sarvotham, D. Takhar, K. Kelly, and R. Baraniuk, "Compressive imaging for video representation and coding," in Proc. Picture Coding Symposium 2006, Beijing, China, Apr. 2006.
25. R. Baraniuk, V. Cevher, M. Duarte, and C. Hegde, "Model-based compressive sensing," IEEE Transactions on Information Theory, Jan 2008. [Online]. Available: http://arxiv.org/pdf/0808.3572
26. R. Calderbank, S. Howard, and S. Jafarpour, "A sublinear algorithm for sparse reconstruction with l2/l2 recovery guarantees," arXiv, vol. cs.IT, Jun 2008. [Online]. Available: http://arxiv.org/abs/0806.3799v2
27. V. Cevher, M. Duarte, C. Hegde, and R. Baraniuk, "Sparse signal recovery using markov random fields," in Proc. Workshop on Neural Info. Proc. Sys.(NIPS). Citeseer, 2008.
28. E. Knill, "Lower bounds for identifying subset members with subset queries," in Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, ser. SODA '95. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 1995, pp. 369-377. [Online]. Available: http://portal.acm.org/citation.cfm?id=313651.313767
29. M. Sobel and P. A. Groll, "Binomial group-testing with an unknown proportion of defectives," Technometrics, vol. 8, no. 4, pp. pp. 631-656, 1966. [Online]. Available: http://www.jstor.org/stable/1266636
30. M. Mézard and C. Toninelli, "Group testing with random pools: optimal two-stage algorithms," CoRR, vol. abs/0706.3104, 2007.
31. R. Baraniuk and P. Steeghs, "Compressive radar imaging,"IEEE Radar Conference 2007, pp. 128-133, Jan 2007. [Online]. Available: http://ieeexplore.ieee.org/xpls/abs all.jsp?arnumber=4250297
32. E. Candes, M. Rudelson, T. Tao, and R. Vershynin, "Error correction via linear programming," in FOCS '05, 2005.
33. A. Lapidoth and P. Narayan, "Reliable communication under channel uncertainty," IEEE Transactions on Information Theory, vol. 44, pp. 2148-2177, 1998.
34. K. D. Ba, P. Indyk, E. Price, and D. Woodruff, "Lower bounds for sparse recovery," Proceedings of the Twenty-First Annual ACMSIAM Symposium on Discrete Algorithms, pp. 1190-1197, 2010.
35. A. G. Dýachkov and V. V. Rykov, "Bounds on the length of disjunctive codes," Problemy Peredachi Informatsii, vol. 18, no. 3, pp. 7-13, 1982.
36. A. G. Dýachkov, V. V. Rykov, and A. M. Rashad, "Superimposed distance codes," Problems Control Inform. Theory/Problemy Upravlen. Teor. Inform., vol. 18, no. 4, pp. 237-250, 1989.
37. Z. Füredi, "On r-cover-free families," J. Comb. Theory, Ser. A, vol. 73, no. 1, pp. 172-173, 1996.
38. A. Cohen, W. Dahmen, and R. DeVore, "Compressed sensing and best k-term approximation," American Mathematical Society, vol. 22, no. 1, pp. 211-231, 2009.
39. A. Gilbert, Y. Li, E. Porat, and M. Strauss, "Approximate sparse recovery: Optimizing time and measurements," Proceedings of the 42nd ACM symposium on Theory of computing, pp. 475-484, 2010.
40. E. Porat and A. Rothschild, "Explicit non-adaptive combinatorial group testing schemes," in ICALP '08, vol. 5125, 2008, pp. 748-759. [Online]. Available: http://arxiv.org/abs/0712.3876
41. S. Chaudhuri and J. Radhakrishnan, "Deterministic restrictions in circuit complexity," in STOC '96, 1996, pp. 30-36. [Online]. Available: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.427
42. D. Achlioptas, "Database-friendly random projections: Johnsonlindenstrauss with binary coins," Journal of Computer and System Sciences, vol. 66, no. 4, pp. 671-687, 2003.
43. D. Needell and R. Vershynin, "Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit," Selected Topics in Signal Processing, IEEE Journal of, vol. 4, no. 2, pp. 310-316, 2010.
44. D. Needell and J. Tropp, "Cosamp: iterative signal recovery from incomplete and inaccurate samples," Communications of the ACM, vol. 53, no. 12, pp. 93-100, 2010.
45. E. Porat and M. J. Strauss, "Sublinear time, measurement-optimal, sparse recovery for all," SODA, 2012. [Online]. Available: http://adsabs.harvard.edu/abs/2010arXiv1012.1886P