<< Chapter < Page Chapter >> Page >

Although when using the wavelet expansion as a tool in an abstract mathematical analysis, the infinite sum and the continuous description of t R are appropriate, as a practical signal processing or numerical analysis tool, the function or signal f ( t ) in [link] is available only in terms of its samples, perhaps with additionalinformation such as its being band-limited. In this chapter, we examine the practical problem of numerically calculating the discrete wavelettransform.

Finite wavelet expansions and transforms

The wavelet expansion of a signal f ( t ) as first formulated in [link] is repeated here by

f ( t ) = k = - j = - f , ψ j , k ψ j , k ( t )

where the { ψ j , k ( t ) } form a basis or tight frame for the signal space of interest (e.g., L 2 ). At first glance, this infinite series expansion seems to have the same practical problems in calculation that aninfinite Fourier series or the Shannon sampling formula has. In a practical situation, this wavelet expansion, where the coefficients arecalled the discrete wavelet transform (DWT), is often more easily calculated. Both the time summation over the index k and the scale summation over the index j can be made finite with little or no error.

The Shannon sampling expansion [link] , [link] of a signal with infinite support in terms of sinc ( t ) = sin ( t ) t expansion functions

f ( t ) = n = - f ( T n ) sinc ( π T t - π n )

requires an infinite sum to evaluate f ( t ) at one point because the sinc basis functions have infinite support. This is not necessarily true for awavelet expansion where it is possible for the wavelet basis functions tohave finite support and, therefore, only require a finite summation over k in [link] to evaluate f ( t ) at any point.

The lower limit on scale j in [link] can be made finite by adding the scaling function to the basis set as was done in [link] . By using the scaling function, the expansion in [link] becomes

f ( t ) = k = - f , φ J 0 , k φ J 0 , k ( t ) + k = - j = J 0 f , ψ j , k ψ j , k ( t ) .

where j = J 0 is the coarsest scale that is separately represented. The level of resolution or coarseness to start the expansion with is arbitrary,as was shown in  Chapter: A multiresolution formulation of Wavelet Systems in [link] , [link] , and [link] . The space spanned by the scaling function contains all the spaces spanned by the lower resolution wavelets from j = - up to the arbitrary starting point j = J 0 . This means V J 0 = W - W J 0 - 1 . In a practical case, this would be the scale where separating detail becomes important. For asignal with finite support (or one with very concentrated energy), the scaling function might be chosen so that the support of the scalingfunction and the size of the features of interest in the signal being analyzed were approximately the same.

This choice is similar to the choice of period for the basis sinusoids in a Fourier series expansion. If the period of the basis functions ischosen much larger than the signal, much of the transform is used to describe the zero extensions of the signal or the edge effects.

The choice of a finite upper limit for the scale j in [link] is more complicated and usually involves some approximation. Indeed, forsamples of f ( t ) to be an accurate description of the signal, the signal should be essentially bandlimited and the samples taken at least at theNyquist rate (two times the highest frequency in the signal's Fourier transform).

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Wavelets and wavelet transforms. OpenStax CNX. Aug 06, 2015 Download for free at https://legacy.cnx.org/content/col11454/1.6
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Wavelets and wavelet transforms' conversation and receive update notifications?

Ask