Draft:Vanishing moment

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Draft topics Template:AfC topic Template:AfC submission Template:AFC submission

Template:No footnotes


Vanishing moments are a fundamental concept in wavelet theory, signal processing, and functional analysis. They describe a property of a wavelet or function, wherein certain integrals of the function against polynomial terms up to a specific degree vanish. This property is crucial in determining the ability of a wavelet to represent and compress signals effectively. It is used to evaluate whether the mother wavelet effectively captures high-frequency components of a signal.

Origins

In the Continuous Wavelet Transform (CWT), the mother wavelet must satisfy five primary constraints:

1. Compact Support

2. Real Function

3. Even or Odd Symmetry

4. High Vanishing Moments[1]

5. Admissibility Criterion[2]

Cψ=0|Ψ(f)|2|f|df<,
where Ψ(f) is the Fourier transform of ψ(t).

Definition

Mathematically, a function ψ(t) is said to have n vanishing moments if [1]:

tkψ(t)dt=0,for 0k<p

In simpler terms, a wavelet has vanishing moments up to order n if it is orthogonal to all polynomials of degree n1 or lower.

The k-th moment mk is defined as:

mk=tkψ(t)dt

where ψ(t) has p vanishing moments if m0=m1=m2==mp1=0.

Calculations

Calculating the zeroth moment

To compute m0:

1. Calculate the Fourier transform of g(t):

G(f)=g(t)ej2πftdt

2. Extract the DC component (f=0)

m0=G(0)=g(t)dt

Calculating the k-th moment

Using a property of the Fourier transform: differentiating k-times in the frequency domain is equivalent to multiplying by tk in the time domain

1(j2π)kG(k)(f)=tkg(t)ej2πftdt.

When f=0, this simplifies to:

1(j2π)kG(k)(0)=tkg(t)dt

Thus, the k-th moment mk can be computed as:

mk=1(j2π)kG(k)(0)

Common functions and their vanishing moments

Vanishing moments are one of the properties for analyzing wavelets. Here are some commonly used functions categorized into continuous functions and discrete coefficients of continuous functions:

Continuous functions

Haar basis function

Expression[3]:
ψ(t)={10t<1/2,11/2t<1,0otherwise.
Since ψ(t) is an odd function:
m0=ψ(t)dt=0
However, tψ(t) is an even function:
m1=tψ(t)dt0
  • Vanishing moments: 1
Expression[4][5][6]:
ψ(t)=25/43(12πt2)eπt2
Since ψ(t) is the second derivative of Gaussian function, its Fourier transform is:
F.T.{ψ(t)}=F.T.{Cd2dt2eπt2}=C4π2f2eπf2,C=constants.
Using the moment formula:
1(j2π)kG(k)(0)=tkg(t)dt
we find:
m0=m1=0,m20
  • Vanishing moments: 2

p-th derivative of Gaussian function[7]

F.T.{ψ(t)}=F.T.{dpdtpeπt2}=(j2πf)peπf2
  • Vanishing moments: p

Discrete coefficients of continuous functions

Daubechies wavelet

  • Daubechies wavelet, widely used in practice, has varying numbers of vanishing moments, offering a balance between localization in time and frequency domains[1][3][8].
  • For a 2n-point Daubechies wavelet, vanishing moment =n.

Symlet and Coiflets

  • Symlets are designed for improved symmetry, and Coiflets ensure both wavelet and scaling functions have vanishing moments[9][10].
  • For a 2n-point Symlet, vanishing moment =n.
  • For a 6n-point Coiflet, vanishing moment =n.

Significance of Vanishing Moments for Functions

Vanishing moments serve as an indicator of how a function decreases in magnitude. For example, consider the function:

f(t)=sin(t)t2

As the input value t increases toward infinity, this function decreases at a rate proportional to 1t2. The decay rate of such a function can be evaluated using the momentum integral defined as tkf(t)dt.

In this example:

When k=0: The numerator sin(t) oscillates between [1,1], causing the function to oscillate within [1t2,1t2]. This oscillatory behavior ensures that:

tksin(t)t2dt0

Thus, the integral converges to 0, representing the zeroth momentum m0=0.

When k=1:

tksin(t)tdt=π

Here, the first momentum is nonzero, m1=π0.

For k>1: The momentum integral diverges as t.

From this example, the maximum value of k for which the momentum integral converges to zero determines the decay rate of the function. This maximum k value is defined as the vanishing moment of the function.

In continuous wavelet transforms, one of the conditions for designing a wavelet mother function is that its support must be finite. The rate at which the wavelet mother function decays within this finite support is characterized by its vanishing moments.

Equivalent Statements of Vanishing Moments

According to the definition, the condition for a wavelet mother function ψ(t) to have p vanishing moments is[1]:

tkψ(t)dt=0,for 0k<p

However, since this definition involves an infinite-range continuous integral, it is not practical for designing wavelet mother functions.

If the scaling function in the wavelet transform is defined as φ(t), and the following relationship between the wavelet mother function and the scaling function holds[1][11]:

|ψ(t)|=O((1+t2)p/21)
|φ(t)|=O((1+t2)p/21)

Then, the following four statements are equivalent[1]:

1. The wavelet mother function ψ(t) has p vanishing moments.

2. The Fourier transforms of ψ(t) and φ(t), along with their derivatives up to (p1)th order, are zero at ω=0.

3. The Fourier transforms of hφ(t) and Hφ(ejω), along with their derivatives up to p1th order, are zero at ω=0.

4. For any k in the interval 0k<p,

qk(t)=n=nkφ(tn)
is a polynomial function of degree k.

Vanishing Moments and Wavelet Function Design

When the Fourier transform of a filter satisfies the following condition:

|Hφ(ω)|2+|Hφ(ω+π)|2=2

the filter meets the condition of a conjugate mirror filter[12]. Here, Hφ(ω) represents the Fourier transform of the discrete low-pass filter hφ[n].

By combining the conjugate mirror filter condition with the third equivalent statement of vanishing moments, the low-pass filter can be expressed as:

Hφ(ejω)=2(1+ejω2)pL(ejω)

where L(x) is a polynomial function.

Using the above condition and the equivalent statements of vanishing moments, the design process for wavelet functions can be simplified.

Vanishing Moments and Filter Length

In wavelet transforms, the scaling function and wavelet mother function can be defined using discrete filters[12]:

φ(t)=nhφ[n]2φ(2tn)
ψ(t)=nhψ[n]2φ(2tn)

Here, hφ[n] is the discrete low-pass filter, and hψ[n] is the discrete high-pass filter. The filter length is usually expressed in terms of the size of support.

From the expression Hφ(ejω)=2(1+ejω2)pL(ejω), we can observe that:

Choosing a higher number of vanishing moments p results in Hφ(ejω) being a polynomial function with higher powers of ejω. Consequently, the corresponding hφ[n] will have a longer filter length.

In general, there is a trade-off between having a higher number of vanishing moments and a shorter filter length; both cannot be achieved simultaneously.

Thus, when designing the wavelet mother function for continuous wavelet transforms, considerations should include not only the number of vanishing moments but also the corresponding filter length.

References

Template:Reflist