Approximation of functions over redundant dictionaries using coherence

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 243-252

  Gilbert, Anna C ^a   Muthukrishnan, S ^a   Strauss, Martin J ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; ESTIMATION; FUNCTIONS; POLYNOMIALS; PROBLEM SOLVING; VECTORS;

HIGHLY NONLINEAR APPROXIMATION THEORY; LINEAR APPROXIMATION THEORY; REDUNDANT DICTIONARIES;

APPROXIMATION THEORY;

EID: 0037740006     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. JCSS, 58(1):137-147, 1999.
2. Constructive Approximation. http://www.math.vanderbilt.edu/~ca.
3. E. Candes. Ridgelets: Theory and Applications. PhD thesis, Dept. of Statistics, Stanford University, 1998.
4. S. S. B. Chen, D. L. Donoho, and M. A. Saunders. Atomic decomposition by basis pursuit. SIAM J. Sci. Computing, 20:33-61, 1999.
5. R. Coifman and M. V. Wickerhauser. Entropy-based algorithms for best basis selection. IEEE Trans. Inform. Theory, 38(2), March 1992.
6. I. Daubechies. Ten lectures on wavelets. SIAM, Philadelphia, 1992.
7. G. Davis, S. Mallat, and M. Avellaneda. Greedy adaptive approximation. Journal of Constructive Approximation, 13:57-98, 1997.
8. R. A. DeVore. Nonlinear approximation. Acta Numerica, 7:51-150, 1998.
9. R. A. DeVore and G. G. Lorentz. Constructive Approximation. Springer-Verlag, New York, 1993.
10. D. Donoho. Wedgelets: Nearly-minimax estimation of edges. Annals of Statistics, 27:859-897, 1999.
11. D. L. Donoho and X. Huo. Beamlet pyramids: A new form of multiresolution analysis, suited for extracting lines, curves, and objects from very noisy image data. In Proceedings of SPIE 2000, 4119, 2000.
12. A. C. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. Strauss. Fast, small-space algorithms for approximate histogram maintenance. In Proceedings of ACM STOC 2002, 2002.
13. A. C. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, and M. Strauss. Near-optimal sparse Fourier representations via sampling. In Proc. of ACM STOC, 2002.
14. P. Indyk. High-Dimensional Computational Geometry. PhD thesis, Stanford, 2000.
15. P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of ACM STOC 1998, pages 604-613, 1998.
16. The Journal of Approximation Theory. http://www.math.ohio-state.edu/JAT.
17. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. In Proceedings of ACM STOC 1998, pages 614-623, 1998.
18. S. Mallat and Z. Zhang. Matching pursuits with time-frequency dictionaries. IEEE Transactions on Signal Processing, 41(12):3397-3415, 1993.
19. C. M. Thiele and L. F. Villemoes. A fast algorithm for adapted time frequency tillings. Applied and Computational Harmonic Analysis, 3:91-99, 1996.
20. N. Nisan and A. Wigderson. Hardness vs. randomness. J. Comput. System Sci., 49:149-167, 1994.
21. Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad. Orthogonal Matching Pursuit: Recursive Function Approximation with Applications to Wavelet Decomposition. In Proc. of the 27th Annual Asilomar Conference on Signals, and Computers, pages 40-44, 1993.
22. V. N. Temlyakov. The best m-term approximation and greedy algorityms. Advances in Computational Math., 8:249-265, 1998.
23. V. N. Temlyakov. Greedy algorithms and m-term approximation with regard to redundant dictionaries. J. Approximation Theory, to appear.
24. Lars Villemoes. Best approximation with Walsh atoms. Constructive Approximation, 13:329-355, 1997.
25. Lars Villemoes. Nonlinear approximation with Walsh atoms. In A. Le Méhauté, C. Rabut, and L. L. Schumaker, editors, Surface Fitting and Multiresolution Methods, pages 329-336. Vanderbilt University Press, 1997.