C H W T: Oding The AAR Avelet Ransform

C ODING THE H AAR WAVELET T RANSFORM
Catherine Bnteau, Caroline Haddad, David Ruch and Patrick J. Van Fleet
Department of Mathematics & Statistics University of South Florida Tampa, FL USA
PREP - Wavelet Workshop, 2009
T UESDAY, 2 J UNE , 2009 (L ECTURE 4)
C ODING THE HWT
PREP 2009
1/9
T ODAY S S CHEDULE
T ODAY S S CHEDULE
9:00-9:15 Welcome, Introductions 9:15-10:15 Lecture One: Why Wavelets? 10:15-10:30 Coffee Break (SCA 202) 10:30-11:45 Lecture Two: Digital Images 12:00-1:00 Lunch 1:30-2:45 Lecture Three: The Discrete Haar Wavelet Transform 2:45-3:00 Coffee Break (SCA 202) 3:00-4:15 Lecture Four: Coding the HWT, Edge Detection
C ODING THE HWT
PREP 2009
2/9
T ODAY S S CHEDULE
O UTLINE
T ODAY S S CHEDULE C ODING THE H AAR T RANSFORM

Implementing WN T Implementing WN Coding the 2D Transform
I N THE C LASSROOM
Teaching Ideas Computer Usage
C ODING THE HWT
PREP 2009
3/9
C ODING THE H AAR T RANSFORM
I MPLEMENTING WN

I MPLEMENTING WN
The natural inclination when coding the HWT is to simply write a loop and compute the lowpass portion and the highpass portion in the same loop.
C ODING THE HWT
PREP 2009
4/9
I MPLEMENTING WN

I MPLEMENTING WN
The natural inclination when coding the HWT is to simply write a loop and compute the lowpass portion and the highpass portion in the same loop. This bogs down in Mathematica and is also difcult to generalize when we consider longer lters.
C ODING THE HWT
PREP 2009
4/9
I MPLEMENTING WN

I MPLEMENTING WN
The natural inclination when coding the HWT is to simply write a loop and compute the lowpass portion and the highpass portion in the same loop. This bogs down in Mathematica and is also difcult to generalize when we consider longer lters. If we look at the lowpass portion of the transform, Hv, we can see a better way to code things.
C ODING THE HWT
PREP 2009
4/9
I MPLEMENTING WN

I MPLEMENTING WN
Consider H v when v R8 . We have 0 0 0 0 0 0 0 0 1 1 0 0 0 0 2 2 Hv= 0 0 0 0 1 1 0 0 2 2 1 0 0 0 0 0 0 2 1 2

1 2 1 2
v1 v2 v3 v4 v5 v6 v7 v8
v1 + v2 1 v3 + v4 = 2 v5 + v6 v7 + v8
C ODING THE HWT
PREP 2009
4/9
I MPLEMENTING WN

I MPLEMENTING WN
If we rewrite this, we have v1 + v2 1 v3 + v4 Hv= 2 v5 + v6 v7 + v8
v1 v3 = v5 v7
v2 v4 v6 v8
1 2 1 2
= Vh
C ODING THE HWT
PREP 2009
4/9
I MPLEMENTING WN

I MPLEMENTING WN
In a similar way we see that 1 1 0 0 0 0 0 0 2 2 0 0 1 1 0 0 0 0 2 2 Gv = 1 0 0 0 0 2 1 0 0 2 1 0 0 0 0 0 0 2 1 2 v1 v2 v3 v4 v5 v6 v7 v8 v1 + v2 1 v3 + v4 = 2 v5 + v6 v7 + v8
C ODING THE HWT
PREP 2009
4/9
I MPLEMENTING WN

I MPLEMENTING WN
Rewriting gives v1 v1 + v2 1 v3 + v4 v3 = Gv = 2 v5 + v6 v5 v7 v7 + v8 v2 v4 v6 v8
1 2 1 2
= Vg
So all we need to do to compute Wn v is to create V , multiply it with h and g, and join to the two blocks together!
C ODING THE HWT
PREP 2009
4/9
I MPLEMENTING WN

I MPLEMENTING WN
Here is some Matlab code to do it:
function y=MyHWT1D1(v) V=reshape(v,2,length(v)/2); lp=V*[1/2,1/2]; hp=V*[-1/2,1/2]; y=[lp;hp];
C ODING THE HWT
PREP 2009
4/9
I MPLEMENTING WN

I MPLEMENTING WN
And some Mathematica code as well:
MyHWT1D1[v_]:=Module[{V,lp,hp,y}, V=Partition[v,2]; lp=V.{1/2,1/2}; hp=V.{-1/2,1/2}; y=Join[lp,hp]; Return[y]; ];
C ODING THE HWT
PREP 2009
4/9
T I MPLEMENTING WN
T I MPLEMENTING WN
Writing the code for the inverse transform is a bit trickier.
C ODING THE HWT
PREP 2009
5/9
T I MPLEMENTING WN
T I MPLEMENTING WN
Writing the code for the inverse transform is a bit trickier. Now the computation is
T WN v = H T GT v
C ODING THE HWT
PREP 2009
5/9
T I MPLEMENTING WN
T I MPLEMENTING WN
Writing the code for the inverse transform is a bit trickier. Now the computation is
T WN v = H T GT v T Lets again look at a vector v R8 and consider the product W8 v:
C ODING THE HWT
PREP 2009
5/9
T I MPLEMENTING WN
T I MPLEMENTING WN
T W8 v =
1 1 0 0 0 0 0 0
0 0 1 1 0 0 0 0
0 0 0 0 1 1 0 0
0 1 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 1 0 1 0 0 0 1 1 0 0 0 1
v1 v2 v3 v4 v5 v6 v7 v8
C ODING THE HWT
PREP 2009
5/9
T I MPLEMENTING WN
T I MPLEMENTING WN
or T W8 v = v1 v5 v1 + v5 v2 v6 v2 + v6 v3 v7 v3 + v7 v4 v8 v4 + v8
C ODING THE HWT
PREP 2009
5/9
T I MPLEMENTING WN
T I MPLEMENTING WN
The matrix V takes a bit different shape this time.
C ODING THE HWT
PREP 2009
5/9
T I MPLEMENTING WN
T I MPLEMENTING WN
The matrix V takes a bit different shape this time. Now V is v1 v2 V = v3 v4 v5 v6 v7 v8
C ODING THE HWT
PREP 2009
5/9
T I MPLEMENTING WN
T I MPLEMENTING WN
The matrix V takes a bit different shape this time. Now V is v1 v2 V = v3 v4 v5 v6 v7 v8
We need to dot V with both h = [1, 1]T and g = [1, 1]T but then intertwine the results.
C ODING THE HWT
PREP 2009
5/9
T I MPLEMENTING WN
T I MPLEMENTING WN
Given v = (v1 , . . . , v8 )T , how can we use Matlab/Mathematica commands to form v1 v5 v v V = 2 6 v3 v7 v4 v8
C ODING THE HWT
PREP 2009
5/9
T I MPLEMENTING WN
T I MPLEMENTING WN
Answer (Matlab): V = reshape(v,length(v)/2,2);
C ODING THE HWT
PREP 2009
5/9
T I MPLEMENTING WN
T I MPLEMENTING WN
Answer (Mathematica): V = Transpose[Partition[v,Length[v]/2]];
C ODING THE HWT
PREP 2009
5/9
T I MPLEMENTING WN
T I MPLEMENTING WN
We can compute
v1 + v5 v + v6 Vh = 2 v3 + v7 v4 + v8
and
v1 v5 v v6 Vg = 2 v3 v7 v4 v8
T How do we form W8 v from this?
C ODING THE HWT
PREP 2009
5/9
T I MPLEMENTING WN
T I MPLEMENTING WN
Answer (Matlab): reshape([V*g V*h],1,length(v));
C ODING THE HWT
PREP 2009
5/9
T I MPLEMENTING WN
T I MPLEMENTING WN
Answer (Mathematica): Flatten[Transpose[{ V g, V h } ]]; or one I just learned: Riffle[ Vg, Vh ];
C ODING THE HWT
PREP 2009
5/9
T I MPLEMENTING WN
T I MPLEMENTING WN
Lets have a look at the Mathematica notebook HaarTransform1D.nb to see how to code the onedimensional HWT and its inverse.
C ODING THE HWT
PREP 2009
5/9
C ODING THE 2D T RANSFORM
2D H AAR T RANSFORM
Coding the 2D Haar transform is easy - we already have a routine that will apply the HWT to each column of A,
C ODING THE HWT
PREP 2009
6/9
2D H AAR T RANSFORM
Coding the 2D Haar transform is easy - we already have a routine that will apply the HWT to each column of A, We can easily write a routine to compute C = WN A. Lets call this routine W.
C ODING THE HWT
PREP 2009
6/9
2D H AAR T RANSFORM
T T Our goal is to compute B = WN AWN = CWN .
C ODING THE HWT
PREP 2009
6/9
2D H AAR T RANSFORM
T T Our goal is to compute B = WN AWN = CWN . T It turns out that writing code for CWN is a bit tedious, but if we use some linear algebra . . .
C ODING THE HWT
PREP 2009
6/9
2D H AAR T RANSFORM
T If we transpose both sides of B = CWN , we have
B T = WN C T
C ODING THE HWT
PREP 2009
6/9
2D H AAR T RANSFORM
B T = WN C T So we can simply apply W to C T and transpose the result.
C ODING THE HWT
PREP 2009
6/9
2D H AAR T RANSFORM
B T = WN C T So we can simply apply W to C T and transpose the result. One student wasnt so sure about this . . .
C ODING THE HWT
PREP 2009
6/9
2D H AAR T RANSFORM
C ODING THE HWT
PREP 2009
6/9
I N THE C LASSROOM
T EACHING I DEAS
I N THE C LASSROOM
T EACHING I DEAS
The students really enjoy the material in this chapter. It is quite straightforward and ties together everything new weve done to date.
C ODING THE HWT
PREP 2009
7/9
I N THE C LASSROOM
T EACHING I DEAS
I N THE C LASSROOM
T EACHING I DEAS
The students really enjoy the material in this chapter. It is quite straightforward and ties together everything new weve done to date. We have them look at the entropy of particular vectors when processed by the Haar transform. This gives them some idea of the potential for wavelet-based compression.
C ODING THE HWT
PREP 2009
7/9
I N THE C LASSROOM
C OMPUTER U SAGE
I N THE C LASSROOM
C OMPUTER U SAGE
As you might imagine, we do lots of coding in this chapter.
C ODING THE HWT
PREP 2009
8/9
I N THE C LASSROOM
C OMPUTER U SAGE
I N THE C LASSROOM
C OMPUTER U SAGE
As you might imagine, we do lots of coding in this chapter. We let the students work in pairs and they write code for the Haar transform and its inverse (1D and 2D) as well as iterated versions.
C ODING THE HWT
PREP 2009
8/9
I N THE C LASSROOM
C OMPUTER U SAGE
I N THE C LASSROOM
C OMPUTER U SAGE
As you might imagine, we do lots of coding in this chapter. We let the students work in pairs and they write code for the Haar transform and its inverse (1D and 2D) as well as iterated versions. They can get pretty frustrated with Mathematica at this point - it is good to show them some simple debugging techniques.
C ODING THE HWT
PREP 2009
8/9
I N THE C LASSROOM
C OMPUTER U SAGE
I N THE C LASSROOM
C OMPUTER U SAGE
We let them use their own images/audio les (sometimes dangerous).
C ODING THE HWT
PREP 2009
8/9
I N THE C LASSROOM
C OMPUTER U SAGE
I N THE C LASSROOM
C OMPUTER U SAGE
We let them use their own images/audio les (sometimes dangerous). To test their iterated 1D inverse, they must download an audio clip from the course web site that has been transformed p times, guess at p, and then apply their inverse to guess the movie clip.
C ODING THE HWT
PREP 2009
8/9
T ODAY S S CHEDULE
9:00-9:15 Welcome, Introductions 9:15-10:15 Lecture One: Why Wavelets? 10:15-10:30 Coffee Break (SCA 202) 10:30-11:45 Lecture Two: Digital Images 12:00-1:00 Lunch 1:30-2:45 Lecture Three: The Discrete Haar Wavelet Transform 2:45-3:00 Coffee Break (SCA 202) 3:00-4:15 Lecture Four: Coding the HWT, Edge Detection Dinner and free time
C ODING THE HWT
PREP 2009
9/9

C H W T: Oding The AAR Avelet Ransform

Загружено:

Сведения о документе

Исходное описание:

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

C H W T: Oding The AAR Avelet Ransform

Загружено:

Авторское право:

Доступные форматы

C ODING THE H AAR WAVELET T RANSFORM

PREP - Wavelet Workshop, 2009

T UESDAY, 2 J UNE , 2009 (L ECTURE 4)

C ODING THE HWT

T UESDAY, 2 J UNE , 2009 (L ECTURE 4)

C ODING THE HWT

T ODAY S S CHEDULE C ODING THE H AAR T RANSFORM

T UESDAY, 2 J UNE , 2009 (L ECTURE 4)

C ODING THE HWT

C ODING THE H AAR T RANSFORM

C ODING THE H AAR T RANSFORM

T UESDAY, 2 J UNE , 2009 (L ECTURE 4)

C ODING THE HWT

C ODING THE H AAR T RANSFORM

C ODING THE H AAR T RANSFORM

T UESDAY, 2 J UNE , 2009 (L ECTURE 4)

C ODING THE HWT

C ODING THE H AAR T RANSFORM

C ODING THE H AAR T RANSFORM

T UESDAY, 2 J UNE , 2009 (L ECTURE 4)

C ODING THE HWT

C ODING THE H AAR T RANSFORM

C ODING THE H AAR T RANSFORM

Consider H v when v R8 . We have 0 0 0 0 0 0 0 0 1 1 0 0 0 0 2 2 Hv= 0 0 0 0 1 1 0 0 2 2 1 0 0 0 0 0 0 2 1 2

T UESDAY, 2 J UNE , 2009 (L ECTURE 4)

C ODING THE HWT

C ODING THE H AAR T RANSFORM

C ODING THE H AAR T RANSFORM

If we rewrite this, we have v1 + v2 1 v3 + v4 Hv= 2 v5 + v6 v7 + v8

T UESDAY, 2 J UNE , 2009 (L ECTURE 4)

C ODING THE HWT

C ODING THE H AAR T RANSFORM

C ODING THE H AAR T RANSFORM

In a similar way we see that 1 1 0 0 0 0 0 0 2 2 0 0 1 1 0 0 0 0 2 2 Gv = 1 0 0 0 0 2 1 0 0 2 1 0 0 0 0 0 0 2 1 2 v1 v2 v3 v4 v5 v6 v7 v8 v1 + v2 1 v3 + v4 = 2 v5 + v6 v7 + v8

T UESDAY, 2 J UNE , 2009 (L ECTURE 4)

C ODING THE HWT

C ODING THE H AAR T RANSFORM

C ODING THE H AAR T RANSFORM

T UESDAY, 2 J UNE , 2009 (L ECTURE 4)

C ODING THE HWT

C ODING THE H AAR T RANSFORM

C ODING THE H AAR T RANSFORM

Here is some Matlab code to do it:

function y=MyHWT1D1(v) V=reshape(v,2,length(v)/2); lp=V*[1/2,1/2]; hp=V*[-1/2,1/2]; y=[lp;hp];

T UESDAY, 2 J UNE , 2009 (L ECTURE 4)

C ODING THE HWT

C ODING THE H AAR T RANSFORM

C ODING THE H AAR T RANSFORM

And some Mathematica code as well:

MyHWT1D1[v_]:=Module[{V,lp,hp,y}, V=Partition[v,2]; lp=V.{1/2,1/2}; hp=V.{-1/2,1/2}; y=Join[lp,hp]; Return[y]; ];

T UESDAY, 2 J UNE , 2009 (L ECTURE 4)

C ODING THE HWT

C ODING THE H AAR T RANSFORM

C ODING THE H AAR T RANSFORM

Writing the code for the inverse transform is a bit trickier.

T UESDAY, 2 J UNE , 2009 (L ECTURE 4)

C ODING THE HWT

C ODING THE H AAR T RANSFORM

C ODING THE H AAR T RANSFORM

T UESDAY, 2 J UNE , 2009 (L ECTURE 4)

C ODING THE HWT

C ODING THE H AAR T RANSFORM

function y=MyHWT1D1(v) V=reshape(v,2,length(v)/2); lp=V[1/2,1/2]; hp=V[-1/2,1/2]; y=[lp;hp];

Answer (Matlab): reshape([Vg Vh],1,length(v));