Average-case analysis of greedy pursuit

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 5914, Issue , 2005, Pages 1-11

  Tropp, Joel A ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Compressed sensing; Orthogonal Matching Pursuit; Signal recovery; Sparse approximation

Indexed keywords

ALGORITHMS; PERFORMANCE; PROBLEM SOLVING; SPURIOUS SIGNAL NOISE; WIRELESS TELECOMMUNICATION SYSTEMS;

AVERAGE-CASE ANALYSIS; ORTHOGONAL MATCHING PERSUIT (OMP); SPRASE SIGNALS;

APPROXIMATION THEORY;

EID: 30844464336     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.618154     Document Type: Conference Paper

References (19)

1. G. Davis, S. Mallat, and M. Avellaneda, "Greedy adaptive approximation," J. Constr. Approx. 13, pp. 57-98, 1997.
2. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by Basis Pursuit," SIAM J. Sci. Comp. 20(1), pp. 33-61, 1999.
3. E. J. Candès and T. Tao, "Near optimal signal recovery from random projections: Universal encoding strategies?." Submitted for publication, Nov. 2004.
4. E. Candès, J. Romberg, and T. Tao, "Exact signal reconstruction from highly incomplete frequency information." Submitted for publication, June 2004.
5. 1-norm solution is also the sparsest solution," Statistics Department Technical Report, Stanford Univ., Sept. 2004.
6. 1-norm solution approximates the sparsest near-solution," Statistics Department Technical Report, Stanford Univ., Sept. 2004.
7. D. L. Donoho, "Compressed sensing." Unpublished manuscript, Oct. 2004.
8. D. L. Donoho, "Neighborly polytopes and sparse solutions of underdetermined linear equations," Statistics Department Technical Report, Stanford Univ., Jan. 2005.
9. E. J. Candès and T. Tao, "Decoding by linear programming." Available from arXiv:math.MG/0502327, Feb. 2005.
10. M. Rudelson and R. Veshynin, "Geometric approach to error correcting codes and reconstruction of signals." Available from arXiv:math.MG/ 0502299, Feb. 2005.
11. D. L. Donoho and J. Tanner, "Sparse nonnegative solutions of underdetermined linear equations by linear programming," Statistics Department Technical Report, Stanford Univ., April 2005.
12. J. A. Tropp, "Just relax: Convex programming methods for identifying sparse signals." Submitted for publication June 2004; revised Feb. 2005.
13. J. A. Tropp and A. C. Gilbert, "Signal recovery from partial information via Orthogonal Matching Pursuit." Submitted for publication, April 2005.
14. A. J. Miller, Subset Selection in Regression, Chapman and Hall, London, 2nd ed., 2002.
15. V. Temlyakov, "Nonlinear methods of approximation," Foundations of Comp. Math. , July 2002.
16. A. C. Gilbert, M. Muthukrishnan, and M. J. Strauss, "Approximation of functions over redundant dictionaries using coherence," in Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, Jan. 2003.
17. J. A. Tropp, A. C. Gilbert, and M. J. Strauss, "Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit," EURASIP J. Signal Processing , 2005. To appear.
18. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inform. Theory 50, pp. 2231-2242, Oct. 2004.
19. A. C. Gilbert, J. A. Tropp, and R. Vershynin, "Instant algorithms for signal recovery." Working draft.