MATH 414 Lecture 39

From Notes
Jump to navigation Jump to search

« previous | Monday, April 28, 2014 | next »


MRA in terms of Fourier Transforms

Gives (yet another) way to construct MRA Vj spaces, scaling function, and wavelet function: by finding Fourier transforms that depend on a special polynomial P(z).

Scaling Function

Recall the scaling relation:

ϕ(x)=kpkϕ(2xk)

Theorem 5.19. The Fourier Transform of a MRA scaling function ϕ(x) is given by:

ϕ^(ξ)=ϕ^(ξ2)P(eiξ2)

where P(z)=kpkzk

Proof. Use the scaling relation and follow the definitions.

Evaluating the Fourier Transform of ϕ(x)=kpkϕ(2xk) (with a change of variables u=2xk) gives

[ϕ(x)](ξ)=ϕ^(ξ)=kpk[ϕ(2xk)](ξ)where [ϕ(2xk)](ξ)=12eiξk2ϕ^(ξ2)=kpk(12eiξk2ϕ^(ξ2))=ϕ^(ξ2)12kpkeiξk2let P(z)=12kpkzk=ϕ^(ξ2)P(eiξ2)

quod erat demonstrandum


Corollary. If ϕ(x) satisfies the normalization condition: ϕ(x)dx=1, then

ϕ^(ξ)=12πr=1P(eiξ2r)

Proof. Evaluating the recursive function (from the theorem above) N times gives

ϕ^(ξ)=ϕ^(ξ2N)P(eiξ2)P(eiξ4)P(eiξ8)P(eiξ2N)=ϕ^(ξ2N)r=1NP(eiξ2r)

Taking the limit as N tends to infinity gives

ϕ^(ξ)=limNϕ^(ξ2N)r=1NP(eiξ2r)=ϕ^(0)r=1P(eiξ2r)

...and we know what ϕ^(0) is:

ϕ^(0)=12πϕ(x)ei(0)xdx=12πϕ(x)dx=12π

Therefore

ϕ^(ξ)=12πr=1P(eiξ2r)
quod erat demonstrandum

Wavelet Function

We can do a similar thing for the wavelet function ψ(x) given its definition in terms of ϕ(x):

ψ(x)=k(1)kp1kϕ(2xk)

Theorem. The Fourier Transform of a MRA wavelet function ψ(x) is given by:

ψ^(ξ)=zϕ^(ξ2)P(z)

Where z=eiξ2.


Moreover, assuming pk for all k, the above is equivalent to

ψ^(ξ)=zϕ^(ξ2)P(z¯)

Proof. Since ψ(x)=k(1)kp1kϕ(2xk), the Fourier transform of ψ(x) is:

[ψ(x)](ξ)=k(1)kp1k[ϕ(2xk)](ξ)=k(1)kp1k(12eiξk2ϕ^(ξ2))=ϕ^(ξ2)12k(1)kp1keiξk2=1k=ϕ^(ξ2)(12(1)peiξ(1)2)=ϕ^(ξ2)(eiξ212(1)peiξ2)let z=eiξ2=ϕ^(ξ2)(z12(1)pz)=zϕ^(ξ2)(12p(z))=zϕ^(ξ2)P(z)

If pk is real, then p=p, so

ψ^(ξ)=zϕ^(ξ2)(12p(z))=zϕ^(ξ2)P(z)

quod erat demonstrandum

Restrictions on P(x)

The P(z) polynomial used above must satisfy a couple of conditions. These conditions directly correspond to the conditions we placed on the pk coefficients.

Theorem 5.23. Given the definition of P(z)=12kpkzk above, if P(z) satisfies the following conditions

  1. P(1)=1 (since sum of all pk's is 2)
  2. |P(z)|2+|P(z)|2=1 for all |z|=1
  3. |P(eit)|>0 for all |t|π2

Then

ϕ^(ξ)=12πr=1P(eiξ2r)

is the Fourier transform of a scaling function.

Proof.

quod erat demonstrandum

Consequently, P(1)=0 since

k(1)kpk=kp2zkp2z+1=11=0

Note: Conditions 1 & 2 correspond to the following conditions on the pk's:
  • kpk2pk=2δ,0
  • kpk=2


Daubechies Wavelet

Defined based on number N of vanishing moments. This is what makes this wavelet/MRA unique.

pk=0 if k<0 or k>2N1. This shall be used to construct ψN(x).

What's really important is

P(z)=12kpkzk=12k=02N1pkzk=12(p0+p1z+p2z2++p2N1z2N1)

This is just a polynomial of degree 2N1.

In regards to vanishing moments, recall that the kth moment Mk is given by

Mk=xkψ(x)dx

The ψN(x) is defined to have N vanishing moments: M0=M1==MN1=0

In terms of the polynomial above, we factor as follows

P(z)=12(p0+p1z+p2z2++p2N1z2N1)=(z+12)NP~(z)

Where P~(1)0 and P~ has degree N1.


Matlab Example

Suppose we wanted to find a wavelet decomposition for f(t)=4t2+t1

This is a degree 2 polynomial, so in order to have no bj's, we need a Daubechies wavelet with N vanishing moments such that N1=2: N=3:

f(t) and db4 level 1 decomposition approximation f1(x)=kak1ϕ(2k1).