Sequential sparse matching pursuit

2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Volumn , Issue , 2009, Pages 36-43

  Berinde, Radu ^a   Indyk, Piotr ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX ALGORITHMS; IMAGE DATA; LINEAR MEASUREMENTS; MATCHING PURSUIT; RECOVERY PROCESS; RECOVERY QUALITY; SIGNAL VECTORS; SPARSE APPROXIMATIONS; SPARSE RECOVERY;

APPROXIMATION ALGORITHMS;

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

References (27)

1. S. Muthukrishnan, "Data streams: Algorithms and applications (invited talk at soda'03)," Available at http://athos.rutgers.edu/ ~muthu/stream-1-1.ps, 2003.
2. P. Indyk, "Sketching, streaming and sublinear-space algorithms," Graduate course notes, available at http://stellar.mit.edu/ S/course/6/fa07/6.895, 2007.
3. E. J. Candés, J. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Comm. Pure Appl. Math., vol. 59, no. 8, pp. 1208-1223, 2006.
4. D. L. Donoho, "Compressed Sensing," IEEE Trans. Info. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
5. 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.
6. R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and M. Strauss, "Combining geometry and combinatorics: a unified approach to sparse signal recovery," Allerton, 2008.
7. W. Dai and O. Milenkovic, "Subspace pursuit for compressive sensing: Closing the gap between performance and complexity," Arxiv:0803. 0811, 2008.
8. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comp. Harmonic Anal., 2008, to appear.
9. 1 norm," FOCS, 2008.
10. 1 norm," Allerton, 2008.
11. 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.
12. M. Charikar, K. Chen, and M. Farach-Colton, "Finding frequent items in data streams," ICALP, 2002.
13. G. Cormode and S. Muthukrishnan, "Improved data stream summaries: The count-min sketch and its applications," LATIN, 2004.
14. A. Gilbert and P. Indyk, "Sparse recovery using sparse matrices," Manuscript, 2009.
15. D. Donoho, A. Maleki, and A. Montanari, "Message passing algorithms for compressed sensing," PNAS, 2009.
16. W. Xu and B. Hassibi, "Efficient compressive sensing with determinstic guarantees using expander graphs," IEEE Information Theory Workshop, 2007.
17. P. Indyk, "Explicit constructions for compressed sensing of sparse signals," SODA, 2008.
18. S. Jafarpour, W. Xu, B. Hassibi, and A. R. Calderbank, "Efficient and robust compressed sensing using high-quality expander graphs," Manuscript, 2008.
19. 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.
20. Y. Lu, A. Montanari, B. Prabhakar, S. Dharmapurikar, and A. Kabbani, "Counter braids: A novel counter architecture for per-flow measurement," SIGMETRICS, 2008.
21. M. Akçakaya, J. Park, and V. Tarokh, "Compressive sensing using low density frames," Submitted to IEEE Trans. on Signal Processing, 2009.
22. 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), 2007, pp. 96-108.
23. E. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Inf. Theory, vol. 52, no. 2, pp. 489-509, 2006.
24. V. Chandar, "A negative result concerning explicit matrices with the restricted isometry property," Preprint, 2008.
25. 1-MAGIC: Recovery of Sparse Signals via Convex Programming, 2005, available at http://www.acm.caltech.edu/l1magic.
26. M. Figueiredo, R. Nowak, and S. Wright, "Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems," IEEE Journal of Selected Topics in Signal Processing, vol. 1, 2007.
27. R. Berinde and P. Indyk, "Sparse recovery using sparse random matrices," MIT-CSAIL Technical Report, 2008.