Chapter 3 Discrete Wavelet Transform

3.1 Definition
In the previous chapter, we discuss the scaling function, wavelet function, and their properties. Suppose the scaling function and wavelet function are given as Haar, Daubechies,... Say, the basis are known. We can approximate a discrete signal in l2(Z)1 by

(3.1)

Here f[n],j ,k[n]andj,k[n] are discrete functions defined in [0,M - 1], totally M points. Because the sets 1j ,k[n]lkZ and 1j,k[n]l(j,k)Z ,jj are orthogonal to each other. We can simply take the inner product to obtain the wavelet coefficients
0 0 2 0

(3.2)

(3.3)

3.2 are called approximation coefficients while 3.3 are called detailed coefficients.

3.2 The Fast Wavelet Transform

Start from the definition, if the form of scaling and wavelet function is known, its coefficients is defined in 3.2 and 3.3. If we can find another way to find the coefficients without knowing the scaling and dilation version of scaling and wavelet function. The computation time can be reduced. From 2.20, we have

(3.4) Let n = m - 2k, we have (3.5)

If we combine the equation above with 3.2, it becomes (3.6) (3.7) Similarly, for the detail coefficients, it is (3.8)

For the commonly used discrete signal, say, a digital image, the original data can be viewed as approximation coefficients with order J. That is, f[n] = W[J, n] By 3.7 and 3.8, next level of approximation and detail can be obtained. This algorithm is fast because one can find the coefficients level by level rather than directly using 3.2 and 3.3 to find the coefficients. This algorithm was first proposed in [2]. 16

Figure 3.1: The schematic diagram to realize discrete wavelet transform. Here the filter names are changed.