Haar wavelet explained

In mathematics, the Haar wavelet is a sequence of rescaled "square-shaped" functions which together form a wavelet family or basis. Wavelet analysis is similar to Fourier analysis in that it allows a target function over an interval to be represented in terms of an orthonormal basis. The Haar sequence is now recognised as the first known wavelet basis and is extensively used as a teaching example.

The Haar sequence was proposed in 1909 by Alfréd Haar.^[1] Haar used these functions to give an example of an orthonormal system for the space of square-integrable functions on the unit interval [0, 1]. The study of wavelets, and even the term "wavelet", did not come until much later. As a special case of the Daubechies wavelet, the Haar wavelet is also known as Db1.

The Haar wavelet is also the simplest possible wavelet. The technical disadvantage of the Haar wavelet is that it is not continuous, and therefore not differentiable. This property can, however, be an advantage for the analysis of signals with sudden transitions (discrete signals), such as monitoring of tool failure in machines.^[2]

The Haar wavelet's mother wavelet function

\psi(t) can be described as\psi(t) = \begin{cases} 1 & 0 \leq t < (1)/(2) ,\\ -1 & (1)/(2) \leq t < 1 ,\\ 0 & otherwise. \end{cases} \varphi(t) can be described as\varphi(t) = \begin{cases} 1 & 0 \leq t < 1 ,\\ 0 & otherwise. \end{cases}

Haar functions and Haar system

For every pair n, k of integers in

Z , the Haar function ψ_n,k is defined on the real line R by the formula\psi _{n,k} (t) = 2 ^{n} \psi( 2 ^{n} t - k), t \in R . This function is supported on the right-open interval, i.e., it vanishes outside that interval. It has integral 0 and norm 1 in the Hilbert space L²(R ),\int _{R} \psi _{n,} (t) d t = 0 , \|\psi _{n,} \| ^{2} _{L ^{2(R)}} = \int _{R} \psi _{n,} (t) ^{2} d t = 1 . The Haar functions are pairwise orthogonal,\int _{R} \psi _{n _{1,} k _{1}} (t) \psi _{n _{2,} k _{2}} (t) d t = \delta _{n _{1n} _{2}} \delta _{k _{1k} _{2}} , where \delta _{ij} represents the Kronecker delta. Here is the reason for orthogonality: when the two supporting intervals I _{n _{1,} k _{1}} and I _{n _{2,} k _{2}} are not equal, then they are either disjoint, or else the smaller of the two supports, say I _{n _{1,} k _{1}} , is contained in the lower or in the upper half of the other interval, on which the function \psi _{n _{2,} k _{2}} remains constant. It follows in this case that the product of these two Haar functions is a multiple of the first Haar function, hence the product has integral 0.

The Haar system on the real line is the set of functions

\{ \psi _{n,k} (t) : n \in Z , k \in Z \}. It is complete in L²(R ): The Haar system on the line is an orthonormal basis in L²(R ).

Haar wavelet properties

The Haar wavelet has several notable properties:

Haar system on the unit interval and related systems

In this section, the discussion is restricted to the unit interval [0,&nbsp;1] and to the Haar functions that are supported on [0,&nbsp;1]. The system of functions considered by Haar in 1910,^[3] called the Haar system on [0,&nbsp;1] in this article, consists of the subset of Haar wavelets defined as

\{ t \in [ 0 , 1 ] \mapsto \psi _{n,k} (t) : n, k \in \N \cup \{ 0 \}, 0 \leq k < 2 ^{n\},} with the addition of the constant function 1 on [0,&nbsp;1].

In Hilbert space terms, this Haar system on [0,&nbsp;1] is a complete orthonormal system, i.e., an orthonormal basis, for the space L²([0,&nbsp;1]) of square integrable functions on the unit interval.

The Haar system on [0,&nbsp;1] - with the constant function 1 as first element, followed with the Haar functions ordered according to the lexicographic ordering of couples - is further a monotone Schauder basis for the space L^p([0,&nbsp;1]) when .^[4] This basis is unconditional when .^[5]

There is a related Rademacher system consisting of sums of Haar functions,

r _{n(t)} = 2 ^{-n/2} \sum ^{2 ^{n} -1} _{k =0} \psi _{n,} (t), t \in [ 0 , 1 ], n \ge 0 . Notice that |r_n(t)| = 1 on [0,&nbsp;1). This is an orthonormal system but it is not complete.<ref>{{SpringerEOM |title=Orthogonal system}}</ref><ref>{{cite book |first1=Gilbert G. |last1=Walter |first2=Xiaoping |last2=Shen |title=Wavelets and Other Orthogonal Systems |year=2001 |location=Boca Raton |publisher=Chapman |isbn=1-58488-227-1 }}</ref> In the language of [[probability theory]], the Rademacher sequence is an instance of a sequence of independent Bernoulli random variables with mean 0. The Khintchine inequality expresses the fact that in all the spaces L^p([0,&nbsp;1]),, the Rademacher sequence is equivalent to the unit vector basis in ℓ².^[6] In particular, the closed linear span of the Rademacher sequence in L^p([0,&nbsp;1]),, is isomorphic to ℓ².

The Faber - Schauder system

The Faber - Schauder system^{[7] [8]} is the family of continuous functions on [0,&nbsp;1] consisting of the constant function 1, and of multiples of indefinite integrals of the functions in the Haar system on [0,&nbsp;1], chosen to have norm 1 in the maximum norm. This system begins with s₀ = 1, then is the indefinite integral vanishing at 0 of the function 1, first element of the Haar system on [0,&nbsp;1]. Next, for every integer, functions are defined by the formula

s _{n,} (t) = 2 ^{1} \int ^{t} _{0} \psi _{n,} (u) d u, t \in [ 0 , 1 ], 0 \le k < 2 ^{n.} These functions are continuous, piecewise linear, supported by the interval that also supports . The function is equal to 1 at the midpoint of the interval , linear on both halves of that interval. It takes values between 0 and 1 everywhere.

The Faber - Schauder system is a Schauder basis for the space C([0,&nbsp;1]) of continuous functions on [0,&nbsp;1].^[4] For every f in C([0,&nbsp;1]), the partial sum

f _{n+1} = a _{0} s _{0} + a _{1} s _{1} + \sum ^{n -1} _{m =0} l ( \sum ^{2 ^{m} -1} _{k =0} a _{m,k} s _{m,} r ) \in C([ 0 , 1 ]) of the series expansion of f in the Faber - Schauder system is the continuous piecewise linear function that agrees with f at the points, where . Next, the formulaf _{n+2} - f _{n+1} = \sum ^{2 ^{n} -1} _{k =0} l ( f(x _{n,k} ) - f _{n+1} (x _{n,} ) r ) s _{n,} = \sum ^{2 ^{n} -1} _{k =0} a _{n,} s _{n,} gives a way to compute the expansion of f step by step. Since f is uniformly continuous, the sequence converges uniformly to f. It follows that the Faber - Schauder series expansion of f converges in C([0,&nbsp;1]), and the sum of this series is equal to f.

The Franklin system

The Franklin system is obtained from the Faber - Schauder system by the Gram - Schmidt orthonormalization procedure.^{[9] [10]} Since the Franklin system has the same linear span as that of the Faber - Schauder system, this span is dense in C([0,&nbsp;1]), hence in L²([0,&nbsp;1]). The Franklin system is therefore an orthonormal basis for L²([0,&nbsp;1]), consisting of continuous piecewise linear functions. P. Franklin proved in 1928 that this system is a Schauder basis for C([0,&nbsp;1]).^[11] The Franklin system is also an unconditional Schauder basis for the space L^p([0,&nbsp;1]) when .^[12] The Franklin system provides a Schauder basis in the disk algebra A(D).This was proved in 1974 by Bočkarev, after the existence of a basis for the disk algebra had remained open for more than forty years.^[13]

Bočkarev's construction of a Schauder basis in A(D) goes as follows: let f be a complex valued Lipschitz function on [0,&nbsp;π]; then f is the sum of a cosine series with absolutely summable coefficients. Let T(f) be the element of A(D) defined by the complex power series with the same coefficients,

\left\{ f : x \in [ 0 , \pi] → \sum ^{inf ty} _{n =0} a _{n} \cos(n x) \right\} \longrightarrow \left\{ T(f) : z → \sum ^{inf ty} _{n =0} a _{n} z ^{n,} |z| \le 1 \right\}. Bočkarev's basis for A(D) is formed by the images under T of the functions in the Franklin system on [0,&nbsp;π]. Bočkarev's equivalent description for the mapping T starts by extending f to an even Lipschitz function g₁ on [&minus;π,&nbsp;π], identified with a Lipschitz function on the unit circle T. Next, let g₂ be the conjugate function of g₁, and define T(f) to be the function in A(D) whose value on the boundary T of D is equal to .

When dealing with 1-periodic continuous functions, or rather with continuous functions f on [0,&nbsp;1] such that, one removes the function from the Faber - Schauder system, in order to obtain the periodic Faber - Schauder system. The periodic Franklin system is obtained by orthonormalization from the periodic Faber - -Schauder system.^[14] One can prove Bočkarev's result on A(D) by proving that the periodic Franklin system on [0,&nbsp;2π] is a basis for a Banach space A_r isomorphic to A(D). The space A_r consists of complex continuous functions on the unit circle T whose conjugate function is also continuous.

Haar matrix

The 2×2 Haar matrix that is associated with the Haar wavelet is

H _{2} = \begin{bmatrix} 1 & 1 \ 1 & -1 \end{bmatrix}. Using the discrete wavelet transform, one can transform any sequence (a _{0,a} _{1,...,a} _{2n} ,a _{2n+1} ) of even length into a sequence of two-component-vectors \left(\left(a _{0,a} _{1\right),\left(a} _{2,a} _{3\right),...,\left(a} _{2n} ,a _{2n+1} \right)\right) . If one right-multiplies each vector with the matrix H _{2} , one gets the result \left(\left(s _{0,d} _{0\right),...,\left(s} _{n,d} _{n\right)\right)} of one stage of the fast Haar-wavelet transform. Usually one separates the sequences s and d and continues with transforming the sequence s. Sequence s is often referred to as the averages part, whereas d is known as the details part.^[15]

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

H _{4} = \begin{bmatrix} 1 & 1 & 1 & 1 \ 1 & 1 & -1 & -1 \ 1 & -1 & 0 & 0 \ 0 & 0 & 1 & -1 \end{bmatrix}, which combines two stages of the fast Haar-wavelet transform.

Compare with a Walsh matrix, which is a non-localized 1/–1 matrix.

Generally, the 2N×2N Haar matrix can be derived by the following equation.

H _{2N} = \begin{bmatrix} H _{N} ⊗ [ 1 , 1 ] \ I _{N} ⊗ [ 1 , -1 ] \end{bmatrix}

where

I _{N} = \begin{bmatrix} 1 & 0 & ... & 0 \ 0 & 1 & ... & 0 \ \vdots & \vdots & \ddots & \vdots \ 0 & 0 & ... & 1 \end{bmatrix} and ⊗ is the Kronecker product.

The Kronecker product of

A ⊗ B , where A is an m×n matrix and B is a p×q matrix, is expressed asA ⊗ B = \begin{bmatrix} a _{11} B & ... & a _{1n} B \ \vdots & \ddots & \vdots \ a _{m1} B & ... & a _{mn} B\end{bmatrix}.

An un-normalized 8-point Haar matrix

H _{8} is shown belowH _{8} = \begin{bmatrix} 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 \ 1 & 1 & 1 & 1 & -1 & -1 & -1 & -1 \ 1 & 1 & -1 & -1 & 0 & 0 & 0 & 0 & \ 0 & 0 & 0 & 0 & 1 & 1 & -1 & -1 \ 1 & -1 & 0 & 0 & 0 & 0 & 0 & 0 & \ 0 & 0 & 1 & -1 & 0 & 0 & 0 & 0 \ 0 & 0 & 0 & 0 & 1 & -1 & 0 & 0 & \ 0 & 0 & 0 & 0 & 0 & 0 & 1 & -1 \end{bmatrix}.

Note that, the above matrix is an un-normalized Haar matrix. The Haar matrix required by the Haar transform should be normalized.

From the definition of the Haar matrix

H , one can observe that, unlike the Fourier transform, H has only real elements (i.e., 1, -1 or 0) and is non-symmetric.

Take the 8-point Haar matrix

H _{8} as an example. The first row of H _{8} measures the average value, and the second row of H _{8} measures a low frequency component of the input vector. The next two rows are sensitive to the first and second half of the input vector respectively, which corresponds to moderate frequency components. The remaining four rows are sensitive to the four section of the input vector, which corresponds to high frequency components.^[16]

Haar transform

The Haar transform is the simplest of the wavelet transforms. This transform cross-multiplies a function against the Haar wavelet with various shifts and stretches, like the Fourier transform cross-multiplies a function against a sine wave with two phases and many stretches.^[17]

Introduction

The Haar transform is one of the oldest transform functions, proposed in 1910 by the Hungarian mathematician Alfréd Haar. It is found effective in applications such as signal and image compression in electrical and computer engineering as it provides a simple and computationally efficient approach for analysing the local aspects of a signal.

The Haar transform is derived from the Haar matrix. An example of a 4×4 Haar transformation matrix is shown below.

H _{4} = (1)/(2) \begin{bmatrix} 1 & 1 & 1 & 1 \ 1 & 1 & -1 & -1 \ \sqrt{ 2 } & - \sqrt{ 2 } & 0 & 0 \ 0 & 0 & \sqrt{ 2 } & - \sqrt{ 2 }\end{bmatrix}

The Haar transform can be thought of as a sampling process in which rows of the transformation matrix act as samples of finer and finer resolution.

Compare with the Walsh transform, which is also 1/–1, but is non-localized.

Property

The Haar transform has the following properties

1. No need for multiplications. It requires only additions and there are many elements with zero value in the Haar matrix, so the computation time is short. It is faster than Walsh transform, whose matrix is composed of +1 and −1.
2. Input and output length are the same. However, the length should be a power of 2, i.e.

N = 2 ^{k,} k\in N .

1. It can be used to analyse the localized feature of signals. Due to the orthogonal property of the Haar function, the frequency components of input signal can be analyzed.

Haar transform and Inverse Haar transform

The Haar transform y_n of an n-input function x_n is

y _{n} = H _{n} x _{n}

The Haar transform matrix is real and orthogonal. Thus, the inverse Haar transform can be derived by the following equations.

H = H ^{*,} H ^{-1} = H ^{T,} i.e. HH ^{T} = I

where

I is the identity matrix. For example, when n = 4H ^{T} _{4} H _{4} = (1)/(2) \begin{bmatrix} 1 & 1 &\sqrt{ 2 }& 0 \ 1 & 1 & - \sqrt{ 2 }& 0 \ 1 & -1 & 0 &\sqrt{ 2 } \ 1 & -1 & 0 & - \sqrt{ 2 }\end{bmatrix} ⋅ (1)/(2) \begin{bmatrix} 1 & 1 & 1 & 1 \ 1 & 1 & -1 & -1 \ \sqrt{ 2 }& - \sqrt{ 2 }& 0 & 0 \ 0 & 0 &\sqrt{ 2 }& - \sqrt{ 2 }\end{bmatrix} = \begin{bmatrix} 1 & 0 & 0 & 0 \ 0 & 1 & 0 & 0 \ 0 & 0 & 1 & 0 \ 0 & 0 & 0 & 1 \end{bmatrix}

Thus, the inverse Haar transform is

x _{n} = H ^{T} y _{n}

Example

The Haar transform coefficients of a n=4-point signal

x _{4} = [ 1 , 2 , 3 , 4 ] ^{T} can be found asy _{4} = H _{4} x _{4} = (1)/(2) \begin{bmatrix} 1 & 1 & 1 & 1 \ 1 & 1 & -1 & -1 \ \sqrt{ 2 }& - \sqrt{ 2 }& 0 & 0 \ 0 & 0 &\sqrt{ 2 }& - \sqrt{ 2 }\end{bmatrix} \begin{bmatrix} 1 \ 2 \ 3 \ 4 \end{bmatrix} = \begin{bmatrix} 5 \ -2 \ -1 /\sqrt{ 2 } \ -1 /\sqrt{ 2 }\end{bmatrix}

The input signal can then be perfectly reconstructed by the inverse Haar transform

\hat{x _{4} } = H_^y_ = \frac\begin 1&1&\sqrt&0 \\ 1&1&-\sqrt&0 \\ 1&-1&0&\sqrt \\ 1&-1&0&-\sqrt\end \begin 5 \\ -2 \\ -1/\sqrt \\ -1/\sqrt\end= \begin 1 \\ 2 \\ 3 \\ 4 \end

See also

• Dimension reduction
• Walsh matrix
• Walsh transform
• Wavelet
• Chirplet
• Signal
  • Haar-like feature Strömberg wavelet
• Dyadic transformation

References

• • Charles K. Chui, An Introduction to Wavelets, (1992), Academic Press, San Diego,
• English Translation of Haar's seminal article: https://web.archive.org/web/20120123124430/https://www.uni-hohenheim.de/~gzim/Publications/haar.pdf

External links

• • Free Haar wavelet filtering implementation and interactive demo
• Free Haar wavelet denoising and lossy signal compression

Haar transform

• Web site: The Haar Transform. https://web.archive.org/web/20060419183057/http://cnx.org/content/m11087/latest/. 19 April 2006. Nick. Kingsbury.
• Web site: Haar Transform Demo Applets. David. Eck. 31 January 2006.
• Web site: Image Compression. https://web.archive.org/web/20110125080404/http://online.redwoods.cc.ca.us/instruct/darnold/laproj/Fall2002/ames/paper.pdf. 25 January 2011. Greg. Ames. 7 December 2002.
• Web site: MOSMAT 500. A photomosaic generator. 2. Theory. https://web.archive.org/web/20080318071618/http://scien.stanford.edu/class/ee368/projects2000/project12/2.html. 18 March 2008. Anne. Aaron. Michael. Hill. Anand. Srivatsa.
• Web site: Haar Transform. https://web.archive.org/web/20120821004423/http://fourier.eng.hmc.edu/e161/lectures/Haar/index.html . 21 August 2012 . Ruye. Wang. 4 December 2008.

Notes and References

1. see p. 361 in .
2. B. . Lee . Y. S. . Tarng . Application of the discrete wavelet transform to the monitoring of tool failure in end milling using the spindle motor current . International Journal of Advanced Manufacturing Technology . 1999 . 15 . 4 . 238–243 . 10.1007/s001700050062 . 109908427 .
3. p. 361 in
4. see p. 3 in J. Lindenstrauss, L. Tzafriri, (1977), "Classical Banach Spaces I, Sequence Spaces", Ergebnisse der Mathematik und ihrer Grenzgebiete 92, Berlin: Springer-Verlag, .
5. The result is due to R. E. Paley, A remarkable series of orthogonal functions (I), Proc. London Math. Soc. 34 (1931) pp. 241-264. See also p. 155 in J. Lindenstrauss, L. Tzafriri, (1979), "Classical Banach spaces II, Function spaces". Ergebnisse der Mathematik und ihrer Grenzgebiete 97, Berlin: Springer-Verlag, .
6. see for example p. 66 in J. Lindenstrauss, L. Tzafriri, (1977), "Classical Banach Spaces I, Sequence Spaces", Ergebnisse der Mathematik und ihrer Grenzgebiete 92, Berlin: Springer-Verlag, .
7. Faber, Georg (1910), "Über die Orthogonalfunktionen des Herrn Haar", Deutsche Math.-Ver (in German) 19: 104 - 112. ; http://www-gdz.sub.uni-goettingen.de/cgi-bin/digbib.cgi?PPN37721857X ; http://resolver.sub.uni-goettingen.de/purl?GDZPPN002122553
8. Schauder, Juliusz (1928), "Eine Eigenschaft des Haarschen Orthogonalsystems", Mathematische Zeitschrift 28: 317 - 320.
9. see Z. Ciesielski, Properties of the orthonormal Franklin system. Studia Math. 23 1963 141–157.
10. Franklin system. B.I. Golubov (originator), Encyclopedia of Mathematics. URL: http://www.encyclopediaofmath.org/index.php?title=Franklin_system&oldid=16655
11. Philip Franklin, A set of continuous orthogonal functions, Math. Ann. 100 (1928), 522-529.
12. S. V. Bočkarev, Existence of a basis in the space of functions analytic in the disc, and some properties of Franklin's system. Mat. Sb. 95 (1974), 3–18 (Russian). Translated in Math. USSR-Sb. 24 (1974), 1–16.
13. The question appears p. 238, §3 in Banach's book, . The disk algebra A(D) appears as Example 10, p. 12 in Banach's book.
14. See p. 161, III.D.20 and p. 192, III.E.17 in
15. Book: David K. . Ruch . Patrick J. . Van Fleet . Wavelet Theory: An Elementary Approach with Applications . 2009 . John Wiley & Sons. 978-0-470-38840-2 .
16. Web site: haar . Fourier.eng.hmc.edu . 30 October 2013 . 23 November 2013 . 21 August 2012 . https://web.archive.org/web/20120821004423/http://fourier.eng.hmc.edu/e161/lectures/Haar/index.html . dead .
17. http://sepwww.stanford.edu/public/docs/sep75/ray2/paper_html/node4.html The Haar Transform