CoSaMP: Iterative signal recovery from incomplete and inaccurate samples

Communications of the ACM

Volumn 53, Issue 12, 2010, Pages 93-100

  Needell, Deanna ^a   Tropp, Joel A ^b  

^a STANFORD UNIVERSITY   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSIVE SAMPLING; COMPUTATIONAL CHALLENGES; DATA RECOVERY; DATA SAMPLING; DIMENSION REDUCTION; EXTENDED ABSTRACTS; HARDWARE DEVICES; ITERATIVE SIGNALS; REDUCED REPRESENTATION; RESOURCE USAGE; SAMPLING DEVICES; VECTOR-SPACE;

SIGNAL PROCESSING; VECTOR SPACES;

SAMPLING;

EID: 78650162049     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/1859204.1859229     Document Type: Article

References (24)

1. Candès E, Romberg J., Tao T. Robust uncertainty principles: Exact signal reconstruction from highly incomplete Fourier information. IEEE Trans. Info. Theory 52, 2 (Feb. 2006), 489-509.
2. Candès, E.J. The restricted isometry property and its implications for compressed sensing. C. R. Math. Acad. Sci. Paris, Serie I 346 (2008), U589-U592.
3. Candès, E.J., Romberg, J., Tao, T. Stable signal recovery from incomplete and inaccurate measurements. Commun. Pur. Appl. Math. 59, 8 (2006), 1207-1223.
4. Candès, E.J., Tao, T. Decoding by linear programming. IEEE Trans. Info. Theory 51 (2005), 4203-4215.
5. Candès, E.J., Tao, T. Near optimal signal recovery from random projections: Universal encoding strategies? IEEE Trans. Info. Theory 52, 12 (Dec. 2006), 5406-5425.
6. Cohen, A., Dahmen, W., DeVore, R. Compressed sensing and best k-term approximation. J. Am. Math. Soc. 22, 1 (2009) 211-231.
7. Cormen, T., Lesierson, C., Rivest, L., Stein, C. Introduction to Algorithms, 2nd edition, MIT Press, Cambridge, MA, 2001.
8. Cormode, G., Muthukrishnan, S. Combinatorial algorithms for compressed sensing. Technical report, DIMACS, 2005.
9. Dai, W., Milenkovic, O. Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans. Info. Theory 55, 5 (2009).
10. Donoho, D.L. Compressed sensing. IEEE Trans. Info. Theory 52, 4 (Apr. 2006), 1289-1306.
11. D onoho, D.L., Stark, P.B. Uncertainty principles and signal recovery. SIAM J. Appl. Math. 49, 3 (June 1989)906-931.
12. D onoho, D.L., Tsaig, Y., Drori, I., Starck, J.-L. Sparse solution of underdetermined linear equations by stagewise Orthogonal Matching Pursuit (StOMP). Submitted for publication (2007)
13. Foucart, S. A note on guaranteed sparse recovery via l1-minimization. Appl. Comput. Harmon. Anal. (2010). To appear.
14. G ilbert, A., Strauss M., Tropp J., Vershynin R. Algorithmic linear dimension reduction in the l1 norm for sparse vectors. In Proceedings of the 44th Annual Allerton Conference on Communication, Control and Computing (Sept. 2006).
15. Gilbert, A., Strauss, M., Tropp, J., Vershynin, R. One sketch for all: fast algorithms for compressed sensing. In Proceedings of the 39th ACM Symposium. Theory of Computing (San Diego, June 2007).
16. G ilbert, A.C., Guha, S., Indyk, P., Muthukrishnan, S., Strauss, M.J. Near-optimal sparse Fourier representations via sampling. In Proceedings of the 2002 ACM Symposium on Theory of Computing STOC (2002), 152-161.
17. Kim, S.-J., Koh, K., Lustig, M., Boyd, S., Gorinevsky, D. An interiorpoint method for large-scale l1- regularized least squares. IEEE J. Sel. Top. Signa. 1, 4 (2007) 606-617.
18. N eedell, D., Tropp, J.A. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. ACM Technical Report 2008-01, California Institute of Technology, Pasadena, July 2008.
19. Needell, D., Tropp, J.A. CoSaMP: Iterative signal recovery from noisy samples. Appl. Comput. Harmon. Anal. 26, 3 (2008), 301-321.
20. N eedell, D., Vershynin, R. Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit. IEEE J. Sel. Top. Signa. (2007). To appear.
21. Nesterov, Y.E., Nemirovski, A.S. Interior Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia, 1994.
22. P aige, C.C., Saunders, M.A. LSQR: An algorithm for sparse linear equations and sparse least squares. TOMS 8, 1 (1982), 43-71.
23. R udelson, M., Vershynin, R. Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements. In Proceedings of the 40th Annual Conference on Info. Sciences and Systems, Princeton, Mar. 2006.
24. Tropp, J.A., Gilbert, A.C. Signal recovery from random measurements via Orthogonal Matching Pursuit. IEEE Trans. Info. Theory 53, 12 (2007), 4655-4666.