Skip to main content
Log in

Near Best Tree Approximation

  • Published:
Advances in Computational Mathematics Aims and scope Submit manuscript

Abstract

Tree approximation is a form of nonlinear wavelet approximation that appears naturally in applications such as image compression and entropy encoding. The distinction between tree approximation and the more familiar n-term wavelet approximation is that the wavelets appearing in the approximant are required to align themselves in a certain connected tree structure. This makes their positions easy to encode. Previous work [4,6] has established upper bounds for the error of tree approximation for certain (Besov) classes of functions. This paper, in contrast, studies tree approximation of individual functions with the aim of characterizing those functions with a prescribed approximation error. We accomplish this in the case that the approximation error is measured in L 2, or in the case p≠2, in the Besov spaces B p 0(L p ), which are close to (but not the same as) L p . Our characterization of functions with a prescribed approximation order in these cases is given in terms of a certain maximal function applied to the wavelet coefficients.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Baraniuk, Optimal tree approximation using wavelets, in: Proc. SPIE Tech. Conf. on Wavelet Applications in Signal Processing VII, Vol. 3813, Denver, July 1999.

  2. R. Baraniuk and D. Jones, A signal-dependent time-frequency representation: Fast algorithm for optimal kernel design, IEEE Trans. Signal Processing 45(1) (1994) 134-146.

    Google Scholar 

  3. J. Bergh and J. Löfström, Interpolation Spaces (Springer, New York, 1976).

    Google Scholar 

  4. A. Cohen, W. Dahmen, I. Daubechies and R. DeVore, Tree approximation and optimal encoding, IMI Preprint Series, University of South Carolina, No. 9 (1999).

  5. A. Cohen, I. Daubechies and J.-C. Feauveau, Biorthogonal bases of compactly supported wavelets, Comm. Pure Appl. Math. 45 (1992)

  6. A. Cohen, I. Daubechies, O. Guleryuz and M. Orchard, On the importance of combining wavelet based non-linear approximation in coding strategies, preprint, Princeton University (1998).

  7. A. Cohen, R. DeVore and R. Hochmuth, Restricted approximation, Constructive Approximation 16 (2000) 85-113.

    Google Scholar 

  8. I. Daubechies, Orthonormal bases of compactly supported wavelets, Comm. Pure Appl. Math. 41 (1988) 909-996.

    Google Scholar 

  9. I. Daubechies, Ten Lectures on Wavelets (SIAM, Philadelphia, 1992).

    Google Scholar 

  10. R. DeVore, B. Jawerth and V. Popov, Compression of wavelet decompositions, Amer. J. Math. 114 (1992) 737-785.

    Google Scholar 

  11. R. DeVore and G.G. Lorentz, Constructive Approximation (Springer, New York, 1993).

    Google Scholar 

  12. D.L. Donoho, CART and best-ortho-basis: A connection, Ann. Statist. 25(5) (1997) 1870-1911.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baraniuk, R., DeVore, R., Kyriazis, G. et al. Near Best Tree Approximation. Advances in Computational Mathematics 16, 357–373 (2002). https://doi.org/10.1023/A:1014554317692

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1014554317692

Navigation