MATH 414 Lecture 30

From Notes
Jump to navigation Jump to search

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


Wavelet Decomposition and Reconstruction

fj(x)=kakjϕ(2jxk)fj1(x)=projVj1(fj)=kakj1ϕ(2j1xk)wj1(x)=projWj1(fj)=kbkj1ψ(2j1xk)akj1=12(a2kj+a2k+1j)bkj1=12(a2kja2k+1j)

Decomposition

Low pass filter =(,0,0,0,12k=1,12k=0,0,0,0,)

High pass filter h=(,0,0,0,12k=1,12k=0,0,0,0,)


Downsampling:

  1. Form 12(xk+xk+1)=yk
  2. Downsample by discarding odd k
  3. Call the resulting sequence akj1


y=*xyk=(*x)k(Dy)2k=y2k(Dy)2k+1=0


Thus aj1=D(*aj)

Similarly, bj1=D(h*aj)

Downsampling, high pass h, nor low pass depend on the level j!:


Reconstruction

a2kj=akj1+bkj1a2k+1j=akj1bkj1

To handle the even and odd cases in filter form, we need a few more operations:

New low pass filter ~=(,0,0,0,1k=0,1k=1,0,0,0,)

(~*z)k=zk+zk1

New high pass filter h~=(,0,0,0,1k=0,1k=1,0,0,0,)

(h~*z)k=zkzk1

Upsampling:

  1. Form x=(,x1,x0,x1,)
  2. Ux inserts zeroes at every odd term: (,0,x1,0,x0,0,x1,0,)


Summary