MATH 414 Lecture 35

From Notes
Jump to navigation Jump to search

« previous | Wednesday, April 16, 2014 | next »


Wavelet Review

{2j2ϕ(2jxk)}k is an orthonormal basis for Vj {2j2ψ(2jxk)}k is an orthonormal basis for Wj

Vj=Vj1Wj1


Decomposition and Reconstruction

For fjVj, fj={k=akjϕ(2jxk)k=akj1ϕ(2j1xk)fj1+k=bkj1ψ(2j1xk)wj1


Projecting an arbitrary function f into function fjVj involves sampling.

fj can then be decomposed into fj1 and wj1, and so on down to f0, w0, w1, …


Inversely, f0 and w0 can be used to reconstruct f1, f1 and w1 reconstruct f2, and so on up to fj


Questions:

  1. How do we get from akj's to akj1's and bkj1's?
  2. How do we get from akj1's and bkj1's back to akj's


Decomposition

pk=2ϕ(2xk)ϕ(x)dxqk=2ϕ(2xk)ψ(x)dx


wj1=projWj1(fj)=kbkj1ψ(2j1xk)=kbkj12j122j12ψ(2j1xk)orthonormalbkj12j12=(fj(x)ψ(2j1xk)dx)2j12=fj,ψj1,kbkj1=2j1fj(x)ψ(2j1xk)dx

We already have fj=ajϕ(2jx), so

bkj1=2j1ψ(2j1xk)fj(x)dx=2j1ψ(2j1xk)(ajϕ(2jx))=2j1ajψ(2j1xk)ϕ(2jx)dx

Let u=2j1xk, then 2jx=2u+2k, and du=2j1dx

Also recall qm=2ψ(x)ϕ(2xm)dx.

bkj1=2j1ajψ(u)ϕ(2u+2k)dx2=12ajq2k


Therefore, we are left with

akj1=12ajp2kbkj1=12ajq2k

If we let λ be a filter sequence, we have

akj1=(λ*aj)2k

Therefore, we can downsample:

akj1=DL(aj)

Note that this does not depend on j!!

Likewise, bkj1=DH(aj)

Projection

We are interested in coefficients akj that are projections of f(x) onto Vj. Therefore (let u=2jxk)

akj=2jf(x)ϕ(2jxk)=f(2ju+2jk)ϕ(u)du


"All" interesting wavelets have support contained in some finite interval [a,b]. Hence

akj=abf(2ju+2ju)ϕ(u)du

If j is large, then 2ja2ju2jb, where 2ja and 2jb are small.

Since fL2 is continuous, f(2ju+2jk)f(2jk) for small 2ju. Now what happens next is crucial:

akjf(2jk)abϕ(u)du1

(the integral equality to 1 is the case in most MRAs)

This means that akjf(2jk) is just a sampling of f at 2jk.

The Wavelet Crime

Given samples at any level j, we can decompose aj into component parts aj1, bj1 by using the same downsampling and convolution filters