<< Chapter < Page Chapter >> Page >
1 K N 2 .

Daubechies used the degrees of freedom to obtain maximum regularity for a given N , or to obtain the minimum N for a given regularity. Others have allowed a smaller regularity and used the resulting extra degrees of freedomfor other design purposes.

Regularity is defined in terms of zeros of the transfer function or frequency response function of an FIR filter made up from thescaling coefficients. This is related to the fact that the differentiability of a function is tied to how fast its Fourier series coefficients drop off asthe index goes to infinity or how fast the Fourier transform magnitude drops off as frequency goes to infinity. The relation of the Fouriertransform of the scaling function to the frequency response of the FIR filter with coefficients h ( n ) is given by the infinite product [link] . From these connections, we reason that since H ( z ) is lowpass and, if it has a high order zero at z = - 1 (i.e., ω = π ), the Fourier transform of φ ( t ) should drop off rapidly and, therefore, φ ( t ) should be smooth. This turns out to be true.

We next define the k t h moments of φ ( t ) and ψ ( t ) as

m ( k ) = t k φ ( t ) d t

and

m 1 ( k ) = t k ψ ( t ) d t

and the discrete k t h moments of h ( n ) and h 1 ( n ) as

μ ( k ) = n n k h ( n )

and

μ 1 ( k ) = n n k h 1 ( n ) .

The partial moments of h ( n ) (moments of samples) are defined as

ν ( k , ) = n ( 2 n + ) k h ( 2 n + ) .

Note that μ ( k ) = ν ( k , 0 ) + ν ( k , 1 ) .

From these equations and the basic recursion [link] we obtain [link]

m ( k ) = 1 ( 2 k - 1 ) 2 = 1 k k μ ( ) m ( k - )

which can be derived by substituting [link] into [link] , changing variables, and using [link] . Similarly, we obtain

m 1 ( k ) = 1 2 k 2 = 0 k k μ 1 ( ) m ( k - ) .

These equations exactly calculate the moments defined by the integrals in [link] and [link] with simple finite convolutions of the discrete moments with the lower order continuous moments. A similar equationalso holds for the multiplier- M case described in Section: Multiplicity-M (M-Band) Scaling Functions and Wavelets [link] . A Matlab program that calculates the continuous moments from the discrete moments using [link] and [link] is given in Appendix C.

Vanishing wavelet moments

Requiring the moments of ψ ( t ) to be zero has several interesting consequences. The following three theorems show a variety of equivalentcharacteristics for the K -regular scaling filter, which relate both to our desire for smooth scaling functions and wavelets as well as polynomialrepresentation.

Theorem 20 (Equivalent Characterizations of K-Regular Filters) A unitary scaling filter is K-regular if and only if the following equivalentstatements are true:

  1. All moments of the wavelet filters are zero, μ 1 ( k ) = 0 , for k = 0 , 1 , , ( K - 1 )
  2. All moments of the wavelets are zero, m 1 ( k ) = 0 , for k = 0 , 1 , , ( K - 1 )
  3. The partial moments of the scaling filter are equal for k = 0 , 1 , , ( K - 1 )
  4. The frequency response of the scaling filter has a zero of order K at ω = π , i.e. [link] .
  5. The k t h derivative of the magnitude-squared frequency response of the scaling filter is zero at ω = 0 for k = 1 , 2 , , 2 K - 1 .
  6. All polynomial sequences up to degree ( K - 1 ) can be expressed as a linear combination of shifted scaling filters.
  7. All polynomials of degree up to ( K - 1 ) can be expressed as a linear combination of shifted scaling functions at any scale.

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