Explicit constructions for compressed sensing of sparse signals

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 30-33

  Indyk, Piotr ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 57049125348     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. STOC, pages 20-29, 1996.
2. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. ICALP, 2002.
3. G. Cormode and S. Muthukrishnan. What is hot and what is not: tracking most frequent items dynamically. PODS, 2003.
4. G. Cormode and S. Muthukrishnan. Improved data stream summaries: The count-min sketch and its applications. FSTTCS, 2004.
5. G. Cormode and S. Muthukrishnan. Combinatorial algorithms for compressed sensing. SIROCCO, 2006.
6. E. Candes, J. Romberg, and T. Tao. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory, 52:489-509, 2006.
7. E. Candes, M. Rudelson, T. Tao, and R. Vershynin. Error correction via linear programming. FOCS, 2005.
8. E. Candes and T. Tao. Near optimal signal recovery from random projections: Universal encoding strategies. IEEE Transactions on Information Theory, 2006.
9. R. DeVore. Optimal computation. Proceedings of the International Congress of Mathematicians, 2006.
10. R. DeVore. Deterministic constructions of compressed sensing matrices. preprint, 2007.
11. D. Donoho. Compressed sensing. IEEE Transactions on Information Theory, 52(4):1289-1306, 2006.
12. C. Estan and G. Varghese. New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice. ACM Transactions on Computer Systems, 2003.
13. A. Gilbert, S. Guha, R Indyk, Y. Kotidis, M. Muthukrishnan, and M. Strauss. Fast, smallspace algorithms for approximate histogram maintenance. STOC, 2002.
14. A. Gilbert, S. Guha, R Indyk, M. Muthukrishnan, and M. Strauss. Near-optimal sparse fourier representations via sampling. STOC, 2002.
15. M. Garofalakis, J. Gehrke, and R. Rastogi. Querying and mining data streams: You only get one look. SIGMOD, 2002.
16. A. Gilbert, Y. Kotidis, M. Muthukrishnan, and M. Strauss. Surfing wavelets on streams: Onepass summaries for approximate aggregate queries. VLDB, 2001.
17. A. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. Strauss. Quicksand: Quick summary and analysis of network data. DIMACS Technical Report 2001-43, 2001.
18. A. Gilbert, M. Muthukrishnan, and M. Strauss. Improved time bounds for near-optimal space fourier representations. SPIE Conference, Wavelets, 2005.
19. Rice DSP Group. Compressed sensing resources. Available at http://www.dsp.ece.rice.edu/cs/, 2006.
20. A. Gilbert, M. Strauss, J. Tropp, and R. Vershynin. Algorithmic linear dimension reduction in the 11 norm for sparse vectors. Allerton, 2006.
21. A. Gilbert, M. Strauss, J. Tropp, and R. Vershynin. One sketch for all: fast algorithms for compressed sensing. STOC, 2007.
22. P. Indyk. Uncertainty principles, extractors and explicit embedding of 12 into 11. STOC, 2007.
23. W.B. Johnson and J. Lindenstrauss. Extensions of lipshitz mapping into hilbert space. Contemporary Mathematics, 26:189-206, 1984.
24. Y. Mansour. Randomized interpolation and approximation of sparse polynomials. ICALP, 1992.
25. S. Muthukrishnan. Compressed sensing algorithms for functions. Allerton, 2006.
26. R. Shaltiel. Recent developments in extractors. In Current trends in theoretical computer science. The Challenge of the New Century. Vol 1: Algorithms and Complexity, 2004.
27. T. Tao. Open question; deterministic uup matrices. Weblog at http://terrytao.wordpress.com, 2007.
28. N. Thaper, S. Guha, P. Indyk, and N. Koudas. Dynamic multidimensional histograms. SIGMOD, 2002.
29. S. Vadhan. Pseudorandomness (cs225). available at http://www.eecs.harvard.edu/salil/, Spring 2007.
30. Michael Wakin, Jason Laska, Marco Duarte, Dror Baron, Shriram Sarvotham, Dharmpal Takhar, Kevin Kelly, and Richard Baraniuk. An architecture for compressive imaging. Proc. Int. Conf. on Image Processing (ICIP), 2006.