CoSaMP: Iterative signal recovery from incomplete and inaccurate samples

Applied and Computational Harmonic Analysis

Volumn 26, Issue 3, 2009, Pages 301-321

  Needell, D ^a   Tropp, J A ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algorithms; Approximation; Basis pursuit; Compressed sensing; Orthogonal matching pursuit; Restricted isometry property; Signal recovery; Sparse approximation; Uncertainty principle

Indexed keywords

INCOMPRESSIBLE FLOW; SIGNAL RECONSTRUCTION;

APPROXIMATION; BASIS PURSUIT; COMPRESSED SENSING; ORTHOGONAL MATCHING PURSUIT; RESTRICTED ISOMETRY PROPERTY; SIGNAL RECOVERY; SPARSE APPROXIMATION; UNCERTAINTY PRINCIPLE;

APPROXIMATION ALGORITHMS;

EID: 62749175137     PISSN: 10635203     EISSN: 1096603X     Source Type: Journal    
DOI: 10.1016/j.acha.2008.07.002     Document Type: Article

References (40)

1. Björck A. Numerical Methods for Least Squares Problems (1996), SIAM, Philadelphia
2. Candès E.J. The restricted isometry property and its implications for compressed sensing. C. R. Math. Acad. Sci. Paris, Ser. I 346 (2008) 589-592
3. Candès E., Romberg J., and Tao T. Robust uncertainty principles: Exact signal reconstruction from highly incomplete Fourier information. IEEE Trans. Inform. Theory 52 2 (2006) 489-509
4. Candès E., Romberg J., and Tao T. Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math. 59 8 (2006) 1207-1223
5. Candès E.J., and Tao T. Decoding by linear programming. IEEE Trans. Inform. Theory 51 12 (2005) 4203-4215
6. Candès E.J., and Tao T. Near optimal signal recovery from random projections: Universal encoding strategies?. IEEE Trans. Inform. Theory 52 12 (2006) 5406-5425
7. A. Cohen, W. Dahmen, R. DeVore, Compressed sensing and best k-term approximation, IGPM Report, RWTH-Aachen, July 2006
8. Cormen T., Lesierson C., Rivest L., and Stein C. Introduction to Algorithms. second ed. (2001), MIT Press, Cambridge, MA
9. G. Cormode, S. Muthukrishnan, Combinatorial algorithms for compressed sensing, Technical report, DIMACS, 2005
10. W. Dai, O. Milenkovic, Subspace pursuit for compressive sensing: Closing the gap between performance and complexity, available at: http://www.dsp.ece.rice.edu/cs/SubspacePursuit.pdf (preprint)
11. Daubechies I., Defrise M., and Mol C.D. An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Comm. Pure Appl. Math. 57 (2004) 1413-1457
12. Donoho D.L. Compressed sensing. IEEE Trans. Inform. Theory 52 4 (2006) 1289-1306
13. D.L. Donoho, J. Tanner, Counting faces of randomly projected polytopes when the projection radically lowers dimension, Department of Statistics Technical Report 2006-11, Stanford University, 2006
14. D.L. Donoho, Y. Tsaig, I. Drori, J.-L. Starck, Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit (StOMP), submitted for publication
15. Figueiredo M.A.T., Nowak R.D., and Wright S.J. Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems. IEEE J. Select. Top. Signal Process.: Special Issue on Convex Optimization Methods for Signal Processing 1 4 (2007) 586-598
16. Garnaev A., and Gluskin E. On widths of the Euclidean ball. Sov. Math. Dokl. 30 (1984) 200-204
17. A.C. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, M.J. Strauss, Fast, small-space algorithms for approximate histogram maintenance, in: ACM Symposium on Theoretical Computer Science, 2002
18. A.C. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, M.J. Strauss, Near-optimal sparse Fourier representations via sampling, in: Proceedings of the 2002 ACM Symposium on Theory of Computing STOC, 2002
19. A.C. Gilbert, M. Muthukrishnan, M.J. Strauss, Approximation of functions over redundant dictionaries using coherence, in: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003
20. A.C. Gilbert, S. Muthukrishnan, M.J. Strauss, Improved time bounds for near-optimal sparse Fourier representation via sampling, in: Proceedings of SPIE Wavelets XI, San Diego, CA, 2005
21. 1 norm for sparse vectors, submitted for publication
22. A. Gilbert, M. Strauss, J. Tropp, R. Vershynin, One sketch for all: Fast algorithms for compressed sensing, in: Proceedings of the 39th ACM Symp. Theory of Computing, San Diego, 2007
23. P. Indyk, R. Berinde, Sparse recovery using sparse matrices, CSAIL technical report, Massachusetts Institute of Technology, 2008
24. M. Iwen, A deterministic sub-linear time sparse Fourier algorithm via non-adaptive compressed sensing methods, in: Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), 2008
25. Kashin B. The widths of certain finite dimensional sets and classes of smooth functions. Izvestia 41 (1977) 334-351
26. 1-regularized least squares. IEEE J. Select. Top. Signal Process. 1 4 (2007) 606-617
27. Mallat S., and Zhang Z. Matching pursuits with time-frequency dictionaries. IEEE Trans. Signal Process. 41 12 (1993) 3397-3415
28. Miller A.J. Subset Selection in Regression. second ed. (2002), Chapman and Hall, London
29. D. Needell, J.A. Tropp, CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, ACM Technical Report 2008-01, California Institute of Technology, Pasadena, 2008
30. D. Needell, R. Vershynin, Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit, submitted for publication
31. D. Needell, R. Vershynin, Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit, Found. Comput. Math. (2008), in press
32. Nesterov Y.E., and Nemirovski A.S. Interior Point Polynomial Algorithms in Convex Programming (1994), SIAM, Philadelphia
33. H. Rauhut, On the impossibility of uniform sparse reconstruction using greedy methods, Sampl. Theory Signal Image Process. (2008), doi:10.1007/s10208-008-9031-3, in press
34. G. Reeves, M. Gastpar, Sampling bounds for sparse support recovery in the presence of noise, in: Proceedings of the IEEE International Symposium on Information Theory (ISIT 2008), Toronto, Canada, July 2008
35. M. Rudelson, R. Vershynin, Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements, in: Proceedings of the 40th Annual Conference on Information Sciences and Systems, Princeton, 2006
36. Temlyakov V. Nonlinear methods of approximation. Found. Comput. Math. 3 1 (2003) 33-107
37. Tropp J.A. Beyond Nyquist: Efficient sampling of sparse, bandlimited signals. presented at SampTA, June 2007; available at:. http://www.acm.caltech.edu/~jtropp/slides/Tro07-Beyond-Nyquist-Talk-long .pdf
38. Tropp J.A. Greed is good: Algorithmic results for sparse approximation. IEEE Trans. Inform. Theory 50 10 (2004) 2231-2242
39. Tropp J.A., and Gilbert A.C. Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inform. Theory 53 12 (2007) 4655-4666
40. J.A. Tropp, A.C. Gilbert, S. Muthukrishnan, M.J. Strauss, Improved sparse approximation over quasi-incoherent dictionaries, in: Proc. 2003 IEEE International Conference on Image Processing, Barcelona, 2003