Practical near-optimal sparse recovery in the L1 norm

46th Annual Allerton Conference on Communication, Control, and Computing

Volumn , Issue , 2008, Pages 198-205

  Berinde, R ^a   Indyk, P ^b   Ruzic M ^c  

^a Department of Electrical Engineering and Computer Science   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ERRORS; HIGH-DIMENSIONAL; L1 NORMS; MATCHING PURSUITS; MATRIX SPARSITIES; OPTIMAL PERFORMANCE; RECOVERY SCHEMES; RECOVERY TIME; RUNNING TIME; SPARSE RECOVERIES;

ENCODING (SYMBOLS); SHAPE MEMORY EFFECT;

RECOVERY;

EID: 64549129145     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2008.4797556     Document Type: Conference Paper

References (33)

1. R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and M. Strauss. Combining geometry and combinatorics: a unified approach to sparse signal recovery. Allerton, 2008.
2. R. Berinde and P. Indyk. Sparse recovery using sparse random matrices. MIT-CSAIL Technical Report, 2008.
3. T. Blumensath and M. E. Davies. Iterative hard thresholding for compressed sensing. Preprint, available at arXiv:0805.0510v1, 2008.
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. 1-MAGIC: Recovery of Sparse Signals via Convex Programming, 2005. Available at http://www.acm.caltech.edu/11magic.
9. 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.
10. 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.
11. 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.
12. W. Dai and O. Milenkovic. Subspace pursuit for compressive sensing: Closing the gap between performance and complexity. Arxiv:0803.0811, 2008.
13. C. Dwork, F. McSherry, and K. Talwar. The price of privacy and the limits of LP decoding. STOC, 2007.
14. D. L. Donoho. Compressed Sensing. IEEE Trans. Info. Theory, 52 (4) :1289-1306, Apr. 2006.
15. M. A. T Figueiredo, R. D Nowak, and S. J. Wright. Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems. IEE Journal of Selected Topics in Signal Processing, 1, 2007.
16. A. C. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. J. Strauss. Fast, small-space algorithms for approximate histogram maintenance. In ACM Symposium on Theoretical Computer Science, 2002.
17. 1 via expander codes. SODA, 2008.
18. Rice DSP Group. Compressed sensing resources. Available at http://www.dsp. ece.rice.edu/cs/, 2006.
19. 1 norm for sparse vectors. Submitted for publication, 2006.
20. 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.
21. 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.
22. P. Indyk. Sketching, streaming and sublinear-space algorithms. Graduate course notes, available at http://stellar.mit.edu/S/course/6/ fa07/6.895/, 2007.
23. P. Indyk. Explicit constructions for compressed sensing of sparse signals. SODA, 2008.
24. 1 norm. FOCS, 2008.
25. Y. Lu, A. Montanari, B. Prabhakar, S. Dharmapurikar, and A. Kabbani. Counter braids: A novel counter architecture for per-flow measurement. SIGMETRICS, 2008.
26. S. Muthukrishnan. Data streams: Algorithms and applications (invited talk at soda'03). Available at http://athos.rutgers.edu/?muthu/stream-1-1.ps, 2003.
27. D. Needell and J. A. Tropp. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. Appl. Comp. Harmonic Anal., 2008. To appear.
28. 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.
29. S. Sarvotham, D. Baron, and R. G. Baraniuk. Compressed sensing reconstruction via belief propagation. Technical Report ECE-0601, Electrical and Computer Engineering Department, Rice University, 2006.
30. S. Sarvotham, D. Baron, and R. G. Baraniuk. Sudocodes - fast measurement and reconstruction of sparse signals. IEEE International Symposium on Information Theory, 2006.
31. J. A. Tropp and A. C. Gilbert. Signal recovery from partial information via Orthogonal Matching Pursuit. Submitted to IEEE Trans. Inform. Theory, April 2005.
32. 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 optical-domain compression. In Proc. IS&T/SPIE Symposium on Electronic Imaging, 2006.
33. W. Xu and B. Hassibi. Efficient compressive sensing with determinstic guarantees using expander graphs. IEEE Information Theory Workshop, 2007.