Haar wavelet

] -->The Haar wavelet is the first known wavelet and was proposed in 1909 by Alfréd Haar [Haar, Alfred; Zur Theorie der orthogonalen Funktionensysteme. (German) Mathematische Annalen 69 (1910), no. 3, 331--371.] . 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, as well as 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 disadvantage of the Haar wavelet is that it is not continuous and therefore not differentiable.

The Haar wavelet's mother wavelet function $psi(t)$ can be described as

:

and its scaling function $phi(t)$ can be described as

:

Haar wavelet properties

The Haar wavelet has several properties:

(1) Any function can be approximated by linear combinations of $phi(t),phi(2t),phi(4t),dots,phi(2^k\; t),dots$ and their shifted functions.

(2) Any function can be approximated by linear combinations of the constant function, $psi(t),psi(2t),psi(4t),dots,psi(2^k\; t),dots$ and their shifted functions.

(3) Orthogonality: $int\_\{-infty\}^\{infty\}2^mpsi(2^\{m\_1\}t-n\_1)psi(2^mt-n),\; dt=delta(m-m\_1)delta(n-n\_1)$

The dual function of $psi(t)$ is $psi(t)$ itself.

(4) Wavelet/scaling functions with different scale "m" have a functional relationship:

:$psi(t)=psi(2t)+psi(2t-1)$

:$phi(t)=psi(2t)-psi(2t-1)$

(5) Coefficients of scale "m" can be calculated by coefficients of scale "m+1":

If $chi\_w(n,m)=2^\{m/2\}int\_\{-infty\}^\{infty\}x(t)phi(2^mt-n),\; dt$

:$chi\_w(n,m)=sqrt\{frac\{1\}\{2(chi\_w(2n,m+1)+chi\_w(2n+1,m+1))$:$Chi\_w(n,m)=2^\{m/2\}int\_\{-infty\}^\{infty\}x(t)psi(2^mt-n),\; dt$:$Chi\_w(n,m)=sqrt\{frac\{1\}\{2(chi\_w(2n,m+1)-chi\_w(2n+1,m+1))$

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 $(a\_0,a\_1,dots,a\_\{2n\},a\_\{2n+1\})$ of even length into a sequence of two-component-vectors $left(left(a\_0,a\_1\; ight),dots,left(a\_\{2n\},a\_\{2n+1\}\; ight)\; ight)$. If one right-multiplies each vector with the matrix $H\_2$, one gets the result $left(left(s\_0,d\_0\; ight),dots,left(s\_n,d\_n\; ight)\; ight)$ 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.

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

* [http://www.tomgibara.com/computer-vision/haar-wavelet Free Haar wavelet filtering implementation and interactive demo]