Skip to main content
Log in

Tree-Structured Haar Transforms

  • Published:
Journal of Mathematical Imaging and Vision Aims and scope Submit manuscript

Abstract

The Haar transform is generalized to the case of an arbitrary time and scale splitting. To any binary tree we associate an orthogonal system of Haar-type functions – tree-structured Haar (TSH) functions. Unified fast algorithm for computation of the introduced tree-structured Haar transforms is presented. It requires 2(N − 1) additions and 3N −2 multiplications, where N is transform order or, equivalently, the number of leaves of the binary tree.

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.

Similar content being viewed by others

References

  1. S.S. Agaian, “Advances and Problems of Fast Orthogonal Transforms for Signal-Images Processing Applications (part 1),” in the Yearbook: Pattern Recognition, Classification, Forecasting, Nauka, Moscow, No. 3, pp. 146-215, 1992 (in Russian).

    Google Scholar 

  2. N. Ahmed, K.R. Rao, “Orthogonal Transforms for Digital Signal Processing,” New York: Springer 1975.

    Google Scholar 

  3. K.G. Beauchamp, Walsh Functions and Their Applications, Academic Press, 1975.

  4. K. Egiazarian and J. Astola, “Discrete orthogonal transforms based on Fibonacci-type recursion,” Proc. IEEE Digital Signal Processing Workshop (DSPWS-96), Norway, 1996.

  5. K. Egiazarian, D. Gevorkian, and J. Astola, “Time-varying filter banks and multiresolution transforms based on generalized Fibonacci topology,” Proc. 5th IEEE Int. Workshop on Intelligent Signal Proc. and Communication Systems, Kuala Lumpur, Malaysia, 11-13 Nov. 1997, S16.5.1-S16.5.4.

  6. K. Egiazarian, J. Astola, and S. Agaian, “Orthogonal transforms based on generalized Fibonacci recursions”, Proc. 2nd Int. Workshop on Spectral Techniques and Filter Banks, Brandenburg, Germany, March 5-7, 1999.

  7. K. Egiazarian and J. Astola, “On generalized Fibonacci cubes and unitary transforms,” Applicable Algebra in Engineering, Communication and Computing, Vol. AAECC 8, 1997, pp. 371-377.

    Google Scholar 

  8. D.F. Elliott and K.R. Rao, Fast Transforms: Algorithms, Analyses, Applications, Academic Press, 1982.

  9. A. Haar, “Zur theorie der orthogonalen functionsysteme,” Math. Annal., Vol. 69, pp. 331-371, 1910.

    Google Scholar 

  10. H.L. Resnikoff and R.O. Jr.Wells, Wavelet Analysis: The Scalable Structure of Information, Springer, 1998.

  11. A.P. Stakhov, Algorithmic Measurement Theory, Moscow: Znanie 1979 (in Russian).

    Google Scholar 

  12. M. Vetterli and J. Kovaĉeviĉ, Wavelets and Subband Coding, Prentice Hall, 1995.

  13. J. L. Walsh, “A closed set of orthogonal functions,” Amer. J. Math., Vol. 55, pp. 5-24, 1923.

    Google Scholar 

  14. M.V. Wickerhauser, Adapted Wavelet Analysis from Theory to Software, IEEE Press, A.K.Peters, Wellesley, Massachusetts, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Egiazarian, K., Astola, J. Tree-Structured Haar Transforms. Journal of Mathematical Imaging and Vision 16, 269–279 (2002). https://doi.org/10.1023/A:1020385811959

Download citation

  • Issue Date:

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

Navigation