Near-optimal sparse recovery in the L1 norm

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 199-207

  Indyk, Piotr ^a   Ružić, Milan ^b  

^a MIT MEDIA LAB   (United States)

^b IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

AND RECOVERIES; APPROXIMATION ERRORS; DIMENSIONAL VECTORS; OPTIMAL PERFORMANCES; RECOVERY SCHEMES; RECOVERY TIMES;

COMPUTERS; ENCODING (SYMBOLS); FIBER OPTIC CHEMICAL SENSORS; POLYNOMIAL APPROXIMATION; VECTORS;

RECOVERY;

EID: 57949089021     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.82     Document Type: Conference Paper

References (28)

1. R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and M. Strauss. Combining geometry and combinatorics: a unified approach to sparse signal recovery. Preprint, 2008.
2. E. Candès, J. Romberg, and T. Tao. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Inf. Theory, 52(2):489-509, 2006.
3. E. J. Candès, J. Romberg, and T. Tao. Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math., 59(8): 1208-1223, 2006.
4. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. ICALP, 2002.
5. A. Cohen, W. Dahmen, and R. DeVore. Compressed sensing and best k-term approximation. Preprint, 2006.
6. G. Cormode and S. Muthukrishnan. Improved data stream summaries: The count-min sketch and its applications. FSTTCS, 2004.
7. G. Cormode and S. Muthukrishnan. Combinatorial algorithms for Compressed Sensing. In Proc. 40th Ann. Conf. Information Sciences and Systems, Princeton, Mar. 2006.
8. W. Dai and O. Milenkovic. Subspace pursuit for compressive sensing: Closing the gap between performance and complexity. Arxiv:0803.0811, 2008.
9. D. L. Donoho. Compressed Sensing. IEEE Trans. Info. Theory, 52(4):1289-1306, Apr. 2006.
10. 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.
11. M. F. Duarte, M. B. Wakin, and R. G. Baraniuk. Fast reconstruction of piecewise smooth signals from random projections. In Proc. SPARS05, 2005.
12. C. Dwork, F. McSherry, and K. Talwar. The price of privacy and the limits of LP decoding. STOC, 2007.
13. 1 norm for sparse vectors. Submitted for publication, 2006.
14. A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin. One sketch for all: fast algorithms for compressed sensing. In ACM STOC 2007, pages 237-246, 2007.
15. Rice DSP Group. Compressed sensing resources. Available at http://www.dsp.ece.rice.edu/cs/, 2006.
16. 1 via expander codes. SODA, 2008.
17. V. Guruswami, C. Umans, and S. P. Vadhan. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. In IEEE Conference on Computational Complexity (CCC 2007), pages 96-108, 2007.
18. P. Indyk. Sketching, streaming and sublinearspace algorithms. Graduate course notes, available at http://stellar.mit.edu/S/course/6/fa07/6.895/, 2007.
19. P. Indyk. Explicit constructions for compressed sensing of sparse signals. SODA, 2008.
20. 1 norm. Allerton, 2008.
21. S. Muthukrishnan. Data streams: Algorithms and applications (invited talk at soda'03). Available at http://athos.rubgers.edu/~muthu/stream-1-1.ps 2003.
22. D. Needell and J. A. Tropp. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. Appl. Comp. Harmonic Anal., 2008. To appear.
23. D. Needell and R. Vershynin. Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit. 2007.
24. M. Rudelson and R. Veshynin. Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements. In Proc. 40th Ann. Conf. Information Sciences and Systems, Princeton, Mar. 2006.
25. Dharmpal Takhar, Jason Laska, Michael B. Wakin, Marco F. Duarte, Dror Baron, Shriram Sarvotham, Kevin Kelly, and Richard G. Baraniuk. A new compressive imaging camera architecture using opticaldomain compression. In Proc. IS&T/SPIE Symposium on Electronic Imaging, 2006.
26. J. A. Tropp. Greed is good: Algorithmic results for sparse approximation. IEEE Trans. Inform. Theory, 50(10):2231-2242, Oct. 2004.
27. J. A. Tropp and A. C. Gilbert. Signal recovery from partial information via Orthogonal Matching Pursuit. Submitted to IEEE Trans. Inform. Theory, April 2005.
28. W. Xu and B. Hassibi. Efficient compressive sensing with determinstic guarantees using expander graphs. IEEE Information Theory Workshop, 2007.