| It has been suggested that Haar transform be merged into this article or section. (Discuss) |
| The introduction to this article provides insufficient context for those unfamiliar with the subject. Please help improve the article with a good introductory style. |
In mathematics, the Haar wavelet is a certain sequence of functions. It is now recognised as the first known wavelet.
This sequence was proposed in 1909 by Alfréd Haar[1]. Haar used these functions to give an example of a countable orthonormal system for the space of square-integrable functions on the real line. The study of wavelets, and even the term "wavelet", did not come until much later. As a special case of the Daubechies wavelet, it is also known as D2.
The Haar wavelet is also the simplest possible wavelet. The technical disadvantage of the Haar wavelet is that it is not continuous, and therefore a fortiori not differentiable.
The Haar wavelet's mother wavelet function ψ(t) can be described as
and its scaling function φ(t) can be described as
Contents |
Haar system
In functional analysis, the Haar systems denotes the set of Haar wavelets
In Hilbert space terms, this constitutes a complete orthogonal system for the functions on the unit interval. There is a related Rademacher system, of sums of Haar functions, which is an orthogonal system but not complete.[2][3]
The Haar system (with the natural ordering) is further a Schauder basis for the space Lp[0,1] for
. This basis is unconditional for p > 1.
Haar wavelet properties
The Haar wavelet has several properties:
- Any function can be approximated by linear combinations of
and their shifted functions. - Any function can be approximated by linear combinations of the constant function,
and their shifted functions. - Orthogonality in the form
-

- Here δi,j represents the Kronecker delta. The dual function of ψ(t) is ψ(t) itself.
- 4. Wavelet/scaling functions with different scale m have a functional relationship:
- φ(t) = φ(2t) + φ(2t − 1)
- ψ(t) = φ(2t) − φ(2t − 1)
- 5. Coefficients of scale m can be calculated by coefficients of scale m+1:
- If

- and

- then
Haar matrix
The 2×2 Haar matrix that is associated with the Haar wavelet is
Using the discrete wavelet transform, one can transform any sequence
of even length into a sequence of two-component-vectors
. If one right-multiplies each vector with the matrix H2, one gets the result
of one stage of the fast Haar-wavelet transform. Usually one separates the sequences s and d and continues with transforming the sequence s.
If one has a sequence of length a multiple of four, one can build blocks of 4 elements and transform them in a similar manner with the 4×4 Haar matrix
which combines two stages of the fast Haar-wavelet transform.
Notes
- ^ Haar, Alfred; Zur Theorie der orthogonalen Funktionensysteme. (German) Mathematische Annalen 69 (1910), no. 3, 331--371.
- ^ http://eom.springer.de/O/o070380.htm
- ^ Gilbert G. Walter, Xiaoping Shen, Wavelets and Other Orthogonal Systems (2001)
References
- Haar A. Zur Theorie der orthogonalen Funktionensysteme, Mathematische Annalen, 69, pp 331-371, 1910.
- Charles K. Chui, An Introduction to Wavelets, (1992), Academic Press, San Diego, ISBN 0585470901
External links
No comments have been added.












