Sparse recovery using sparse matrices

Proceedings of the IEEE

Volumn 98, Issue 6, 2010, Pages 937-947

  Gilbert, Anna ^a   Indyk, Piotr ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b USA   (United States)

Author keywords

Compressive sensing; Expanders; Sparse matrices; Sparse recovery; Streaming algorithms

Indexed keywords

COMPRESSED SENSING; RECOVERY;

COMPRESSIVE SENSING; EXPANDERS; SPARSE MATRICES; SPARSE RECOVERY; STREAMING ALGORITHM;

MATRIX ALGEBRA;

EID: 77952733655     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2010.2045092     Document Type: Article

References (44)

1. M. Akcakaya, J. Park, V. Tarokh. (2009). Compressive sensing using low density frames. [Online]. Available: http://arxiv.org/abs/0903.0650
2. R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and M. Strauss, "Combining geometry and combinatorics: A unified approach to sparse signal recovery," in Proc. 46th Annu. Allerton Conf. Commun. Control Comput., 2008, pp. 798-805.
3. R. Berinde and P. Indyk, "Sequential sparse matching pursuit," in Proc. 47th Annu. Allerton Conf. Commun. Control Comput., 2009, pp. 36-43.
4. K. Do Ba, P. Indyk, E. Price, and D. Woodruff, "Lower bounds for sparse recovery," in Proc. 19th Annu. ACM-SIAM Symp. Discrete Algorithms, 2010.
5. 1 norm," in Proc. 46th Annu. Allerton Conf. Commun. Control Comput., 2008, pp. 198-205.
6. M. Charikar, K. Chen, and M. Farach-Colton, "Finding frequent items in data streams," in Proc. Int. Coll. Autom. Lang. Programm., pp. 693-703, 2002.
7. G. Cormode and M. Hadjieleftheriou, "Finding the frequent items in streams of data," Commun. ACM, vol.52, pp. 97-105, 2009.
8. V. Chandar, "A negative result concerning explicit matrices with the restricted isometry property," 2008, preprint.
9. G. Cormode and S. Muthukrishnan, "Improved data stream summaries: The count-min sketch and its applications," J. Algorithms, vol. 55, no. 1, pp. 58-75, 2005. (Pubitemid 40357145)
10. G. Cormode and S. Muthukrishnan, "Summarizing and mining skewed data streams," in Proc. SIAM Int. Data Mining Conf., 2005.
11. G. Cormode and S. Muthukrishnan, "Combinatorial algorithms for compressed sensing," in Proc. 40th Annu. Conf. Inf. Sci. Syst., Princeton, NJ, Mar. 2006, pp. 198-201. (Pubitemid 44113053)
12. E. Cand̀es, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans Inf. Theory, vol.52, no.2, pp. 489-509, Feb. 2006. (Pubitemid 43174093)
13. M. Duarte, M. Davenport, D. Takhar, J. Laska, T. Sun, K. Kelly, and R. Baraniuk, "Single-pixel imaging via compressive sampling," IEEE Signal Process. Mag., vol.25, no.2, pp. 83-91, Mar. 2008.
14. R. DeVore, "Deterministic constructions of compressed sensing matrices," 2007, preprint.
15. D.-Z. Du and F. K. Hwang, Combinatorial Group Testing and Its Applications. Singapore: World Scientific, 1993.
16. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol.52, no.4, pp. 1289-1306, Apr. 2006.
17. Y. Erlich, N. Shental, A. Amir, and O. Zuk, "Compressed sensing approach for high throughput carrier screen," in Proc. 47th Annu. Allerton Conf. Commun. Control Comput., 2009, pp. 539-544.
18. C. Estan and G. Varghese, "New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice," ACM Trans. Comput. Syst., vol.21, no.3, pp. 270-313, Aug. 2003.
19. A. C. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. J. Strauss, "Fast, small-space algorithms for approximate histogram maintenance," in Proc. 34th Annu. ACM Symp. Theory Comput., 2002, pp. 389-398. (Pubitemid 35009399)
20. A. C. Gilbert, Y. Kotidis, S Muthukrishnan, and M. Strauss, "One-pass wavelet decompositions of data streams," IEEE Trans. Knowl. Data Eng., vol.15, no.3, pp. 541-554, May/Jun. 2003.
21. A. Gilbert, Y. Li, E. Porat, and M. Strauss. (2009). Approximate sparse recovery: Optimizing time and measurements. [Online]. Available: http://arxiv.org/abs/0912.0229
22. A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin, "One sketch for all: Fast algorithms for compressed sensing," in Proc. 39th Annu. ACM Symp. Theory Comput., 2007, pp. 237-246. (Pubitemid 47630740)
23. V. Guruswami, C. Umans, and S. P. Vadhan, "Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes," in Proc. IEEE Conf. Comput. Complex., 2007, pp. 96-108. (Pubitemid 47485128)
24. P. Indyk. (2007). Sketching, streaming and sublinear-space algorithms. graduate course notes. [Online]. Available: http://stellar.mit.edu/S/course/6/ fa07/6.895/
25. P. Indyk, "Explicit constructions for compressed sensing of sparse signals," in Proc. 19th Annu. ACM-SIAM Symp. Discrete Algorithms, 2008, pp. 30-33.
26. 1 norm," in Proc. 49th Annu. Symp. Found. Comput. Sci., 2008, pp. 199-207.
27. S. Jafarpour, W. Xu, B. Hassibi, and A. R. Calderbank. (2008). Efficient and robust compressed sensing using high-quality expander graphs. [Online]. Available: http://arxiv.org/PS-cache/arxiv/pdf/0806/0806.3802v1.pdf
28. R. Kainkaryam, A. Bruex, A. Gilbert, P. Woolf, and J. Schiefelbein, "Poolmc: Smart pooling of MRNA samples in microarray experiments," 2010, Manuscript.
29. M. A. Khajehnejad, A. G. Dimakis, W. Xu, and B. Hassibi. (2008). Sparse recovery of positive signals with minimal expansion. [Online]. Available: http://arxiv.org/abs/0902.4045
30. B. Krishnamurthy, S. Sen, Y. Zhang, and Y. Chen, "Sketch-based change detection," in Proc. 3rd ACM SIGCOMM Conf. Internet Meas., 2003, pp. 234-247.
31. 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 Proc. IEEE Dallas CAS Workshop Design Appl. Integr. Softw., 2006, pp. 119-122.
32. Y. Lu, A. Montanari, B. Prabhakar, S. Dharmapurikar, and A. Kabbani, "Counter braids: A novel counter architecture for per-flow measurement," in Proc. ACM SIGMETRICS Int. Conf. Meas. Model. Comput. Syst., 2008, pp. 121-132.
33. S. Muthukrishnan. (2003). Data streams: Algorithms and applications, Invited Talk at the 14th Annu. ACM-IAM Symp. Discrete Algorithms. [Online]. Available: http://athos. rutgers.edu/~muthu/stream-1-1.ps
34. S. Muthukrishnan, "Some algorithmic problems and results in compressed sensing," in Proc. Annu. Allerton Conf. Commun. Control Comput., 2006.
35. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comput. Harmonic Anal., vol.26, no.3, pp. 301-321, 2009.
36. N. Shental, A. Amir, and O. Zuk. (2009). Rare-Allele detection using compressed se(que)nsing. [Online]. Available: arXiv:0909.0400
37. S. Sarvotham, D. Baron, and R. G. Baraniuk, "Compressed sensing reconstruction via belief propagation," Electr. Comput. Eng. Dept., Rice Univ., Houston, TX, Tech. Rep. ECE-0601, 2006.
38. S. Sarvotham, D. Baron, and R. G. Baraniuk, "SudocodesVFast measurement and reconstruction of sparse signals," in Proc. IEEE Int. Symp. Inf. Theory, 2006. (Pubitemid 351244615)
39. S. Sarvotham, D. Baron, and R. G. Baraniuk. (2008). Bayesian compressive sensing via belief propagation. [Online]. Available: http://arxiv.org/abs/0812. 4627
40. J. A. Tropp and A. C. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit," IEEE Trans. Inf. Theory, vol.53, no.12, pp. 4655-4666, Dec. 2007.
41. J. Tropp, M. Laska, M. Duarte, J. Romberg, and R. Baraniuk, "Beyond Nyquist: Efficient sampling of sparse bandlimited signals," IEEE Trans. Inf. Theory, vol.56, no.1, pp. 520-544, Jan. 2010.
42. 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 Symp. Electron. Imaging, 2006, vol.6065, DOI:10.1117/12.659602606509.
43. W. Wang, M. J. Wainwright, and K. Ramchandran. (2008). Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices. [Online]. Available: http://arxiv.org/abs/0806.0604
44. W. Xu and B. Hassibi, "Efficient compressive sensing with deterministic guarantees using expander graphs," in Proc. IEEE Inf. Theory Workshop, 2007, pp. 414-419.