Skip to main content
Log in

Efficient algorithms of local discrete wavelet transform with Haar-like bases

  • Representation, Processing, Analysis, and Understanding of Images
  • Published:
Pattern Recognition and Image Analysis Aims and scope Submit manuscript

Abstract

In this paper, two new fast algorithms for calculating a local discrete wavelet transform for a one-dimensional signal based on the example of Haar’s wavelet basis are presented and their computational complexities are evaluated. The algorithms are compared with each other and with well-known algorithms of fast wavelet transform. Employment recommendations are given for each algorithm presented. Among other things the preference domains of these algorithms are shown, i.e., the parameters of wavelet transform calculating problem are specified so that these algorithms are computationally efficient. Conclusions regarding the advantages of the recursive algorithm over the alternative one and over the well-known algorithm of the fast wavelet transform are reached using the analysis of algorithmic complexities as the base and with regard to additional possibilities of the recursive algorithm. The extension of the algorithms considered to a two-dimensional case is presented.

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. I. Daubechies, Ten Lectures on Wavelets (CBMS-NSF Lecture Notes, No. 61, SIAM, 1992).

  2. S. Mallat, A Wavelet Tour of Signal Processing (Academic Press, 1999).

  3. M. Holschneider, R. Kronland-Martinet, J. Morlet, and Ph. Tchhamitchian, “A Real-Time Algorithm for Signal Analysis with Help of the Wavelet Transform,” in Wavelets, Time-Frequency Methods and Phase Space (Springer-Verland, Berlin, 1989), Ch. A, pp. 289–297.

    Google Scholar 

  4. A. V. Chernov, V. V. Myasnikov, and V. V. Sergeev, “Fast Method for Local Image Processing and Analysis,” Pattern Recognition and Image Analysis 9(4), 572–577 (1999).

    Google Scholar 

  5. V. V. Myasnikov, “Methods for Designing Recursive FIR Filters,” in Processing of International Conference “Computer Vision and Graphics” (ICCVG 2004), Warsaw, Poland, September 22–24, 2004 (Springer), pp. 845–850.

  6. V. N. Kopenkov and V. V. Myasnikov, “Fast Algorithms of a Local Discrete Transform with Haar Basis,” in Proceedings of Scientific and Technical Conference with International Participation “PIT-2006,” Samara, Russia, Vol. 2, pp. 113–118.

  7. P. N. Podkur, “On Constructing Some Types of Wavelets with the Scaling Coefficient N” (Electronic Scientific J. “Sdelano v Rossii,” 2006, 965–974) [Electronic Scientific J. “Made in Russia,” 2006, 965–974].

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. N. Kopenkov.

Additional information

Vasilii N. Kopenkov. Was born in 1978. He was graduated in Samara State Aerospace University in 2001. At present time he works as an assistant on chair of geoinformatics in SSAU and as a junior research assistant in Institute of Image Processing Systems RAS. Head interests: image processing, earth remote sensing data and pattern recognition, geoinformatic systems. Author of 17 publications, including 7 articles. Member of the Russian Association Pattern Recognition and Image Analysis.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kopenkov, V.N. Efficient algorithms of local discrete wavelet transform with Haar-like bases. Pattern Recognit. Image Anal. 18, 654–661 (2008). https://doi.org/10.1134/S1054661808040184

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1054661808040184

Keywords

Navigation