Orthogonal matching pursuit: A Brownian motion analysis

IEEE Transactions on Signal Processing

Volumn 60, Issue 3, 2012, Pages 1010-1021

  Fletcher, Alyson K ^a   Rangan, Sundeep ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Compressed sensing; detection; lasso; orthogonal matching pursuit (OMP); random matrices; sparse approximation; sparsity; subset selection

Indexed keywords

COMPRESSED SENSING; LASSO; ORTHOGONAL MATCHING PURSUIT; RANDOM MATRICES; SPARSE APPROXIMATIONS; SPARSITY; SUBSET SELECTION;

ERROR DETECTION; SIGNAL RECONSTRUCTION;

BROWNIAN MOVEMENT;

EID: 84857217156     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2011.2176936     Document Type: Article

References (39)

1. S. Mallat, A Wavelet Tour of Signal Processing, 2nd ed. New York: Academic, 1999.
2. A. Miller, Subset Selection in Regression, ser. Monographs on Statistics and Applied Probability, 2nd ed. New York: Chapman and Hall/CRC, 2002, no. 95.
3. E. J. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006. (Pubitemid 43174093)
4. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
5. E. J. Candès and T. Tao, "Near-optimal signal recovery from random projections: Universal encoding strategies?," IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006. (Pubitemid 46445381)
6. B. K. Natarajan, "Sparse approximate solutions to linear systems," SIAM J. Comput., vol. 24, no. 2, pp. 227-234, Apr. 1995.
7. S. Chen, S. A. Billings, and W. Luo, "Orthogonal least squares methods and their application to non-linear system identification," Int. J. Contr., vol. 50, no. 5, pp. 1873-1896, Nov. 1989. (Pubitemid 20636409)
8. Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," in Conf. Rec. 27th Asilomar Conf. Signals, Syst., Comput., Pacific Grove, CA, Nov. 1993, vol. 1, pp. 40-44.
9. G. Davis, S. Mallat, and Z. Zhang, "Adaptive time-frequency decomposition," Opt. Eng., vol. 33, no. 7, pp. 2183-2191, Jul. 1994.
10. J. A. Tropp and A. C. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit," IEEE Trans. Inf. Theory, vol. 53, no. 12, pp. 4655-4666, Dec. 2007.
11. J. A. Tropp and A. C. Gilbert, "Signal recovery from random measure ments via orthogonal matching pursuit: The Gaussian case," Calif. Inst. Tech., Appl. Comput. Math. 2007-01, Aug. 2007.
12. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
13. D. L. Donoho, M. Elad, and V. N. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise," IEEE Trans. Inf. Theory, vol. 52, no. 1, pp. 6-18, Jan. 2006. (Pubitemid 43263116)
14. M. A. Davenport and M. B. Wakin, "Analysis of orthogonal matching pursuit using the restricted isometry property," IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4395-4401, Sep. 2010.
15. R. Tibshirani, "Regression shrinkage and selection via the lasso," J. Roy. Stat. Soc., Ser. B, vol. 58, no. 1, pp. 267-288, 1996.
16. M. J. Wainwright, "Sharp thresholds for high-dimensional and noisy recovery of sparsity," Univ. of California, Berkeley, Dept. of Stat., Berkeley, CA, Tech. Rep., May 2006 [Online]. Available: http://arxiv. org/abs/math/0605740
17. M. J. Wainwright, "Sharp thresholds for high-dimensional and noisy sparsity recovery using -constrained quadratic programming (lasso)," IEEE Trans. Inf. Theory, vol. 55, no. 5, pp. 2183-2202, May 2009.
18. D. L. Donoho and J. Tanner, "Counting faces of randomly-projected polytopes when the projection radically lowers dimension," J. Amer. Math. Soc., vol. 22, no. 1, pp. 1-53, Jan. 2009.
19. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comput. Harm. Anal., vol. 26, no. 3, pp. 301-321, May 2009.
20. W. Dai and O. Milenkovic, "Subspace pursuit for compressive sensing signal reconstruction," IEEE Trans. Inf. Theory, vol. 55, no. 5, pp. 2230-2249, May 2009.
21. D. L. Donoho, Y. Tsaig, I. Drori, and J. L. Starck, "Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit," preprint, Mar. 2006.
22. D. Needell and R. Vershynin, "Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit," Found. Comput. Math., vol. 9, no. 3, pp. 317-334, Jun. 2009.
23. D. Needell and R. Vershynin, "Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit," IEEE J. Sel. Topics Signal Process., vol. 4, no. 2, pp. 310-316, Apr. 2010.
24. A. K. Fletcher and S. Rangan, "Orthogonal matching pursuit from noisy measurements: A new analysis," in Proc. Neural Inf. Process. Syst., Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, Eds., Vancouver, Canada, Dec. 2009.
25. A. K. Fletcher, S. Rangan, and V. K. Goyal, "Necessary and sufficient conditions for sparsity pattern recovery," IEEE Trans. Inf. Theory, vol. 55, no. 12, pp. 5758-5772, Dec. 2009.
26. M. J. Wainwright, "Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting," IEEE Trans. Inf. Theory, vol. 55, no. 12, pp. 5728-5741, Dec. 2009.
27. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comp., vol. 20, no. 1, pp. 33-61, 1999. (Pubitemid 128689501)
28. A. K. Fletcher, S. Rangan, and V. K. Goyal, "On-off random access channels: A compressed sensing framework," Mar. 2009 [Online]. Available: http://arxiv.org/abs/0903.1022
29. A. K. Fletcher, S. Rangan, and V. K. Goyal, "A sparsity detection framework for on-off random access channels," in Proc. IEEE Int. Symp. Inform. Theory, Seoul, Korea, Jun.-Jul. 2009, pp. 169-173.
30. A. K. Fletcher, S. Rangan, and V. K. Goyal, "Ranked sparse signal support detection," Oct. 2011 [Online]. Available: http://arxiv.org/abs/ 1110.6188.
31. D. Wipf and B. Rao, "Comparing the effects of different weight distributions on finding sparse representations," in Proc. Neural Inf. Process. Syst., Vancouver, Canada, Dec. 2006.
32. Y. Jin and B. Rao, "Performance limits of matching pursuit algorithms," in Proc. IEEE Int. Symp. Inf. Theory, Toronto, Canada, Jun. 2008, pp. 2444-2448.
33. M. Akçakaya and V. Tarokh, "Shannon-theoretic limits on noisy compressive sampling," IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 492-504, Jan. 2010.
34. G. Reeves, "Sparse signal sampling using noisy linear projections," Univ. Calif. Berkeley, Dept. Elect. Eng. Comp. Sci., Tech. Rep. UCB/EECS-2008-3, Jan. 2008.
35. S. Aeron, V. Saligrama, and M. Zhao, "Information theoretic bounds for compressed sensing," IEEE Trans. Inf. Theory, vol. 56, no. 10, pp. 5111-5130, Oct. 2010.
36. V. A. Marčenko and L. A. Pastur, "Distribution of eigenvalues for some sets of random matrices," Math. USSR-Sbornik, vol. 1, no. 4, pp. 457-483, 1967.
37. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1985, reprinted with corrections 1987.
38. J. Spanier and K. B. Oldham, An Atlas of Functions. Washington, DC: Hemisphere, 1987.
39. I. Karatzas and S. E. Shreve, Brownian Motion and Stochastic Calculus, 2nd ed. New York: Springer-Verlag, 1991.