2-D Wavelets - Lecture Slides - Digital Image Processing | ECE 6258, Study notes of Digital Signal Processing

Material Type: Notes; Class: Digital Image Processing; Subject: Electrical & Computer Engr; University: Georgia Institute of Technology-Main Campus; Term: Fall 2003;

Typology: Study notes

Pre 2010

Uploaded on 08/05/2009

koofers-user-2u8
koofers-user-2u8 🇺🇸

10 documents

1 / 8

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1
10/20/2003 ECE 6258 Russell M. Mersereau 1
ECE6258 Lecture 25
2-D Wavelets
10/20/2003 ECE 6258 Russell M. Mersereau 2
Announcement
Problem Set #5 has been posted.
Images “mandrill.gif”, “peppers.gif”, and “boats.gif”
for PS #5 have also been posted.
10/20/2003 ECE 6258 Russell M. Mersereau 3
Two-dimensional wavelet transforms
The wavelet concept can be easily extended separably to two
dimensions.
In the separable case, a 2-D scaling function and three 2-D wavelets
are required.
The function can be expanded in terms of the scaling function and
wavelets.
][][],[ nmnm
ϕϕϕ
=
][][],[ nmnm
H
ϕψ
ψ
=
][][],[ nmnm
V
ϕψ
ψ
=
][][],[ nmnm
D
ψψ
ψ
=
10/20/2003 ECE 6258 Russell M. Mersereau 4
2-D discrete wavelet expansions
Any 2-D sequence can be expanded in any family of 2-D scaling
and wavelet functions.
∑∑
=
=
=
1
0
1
0
2/2/ ]2,2[],[
1
],,[
M
m
N
n
jj
olnkmnmx
MN
lkjW
ϕ
ϕ
∑∑
=
=
=
1
0
1
0
2/2/ ]2,2[],[
1
],,[
M
m
N
n
jji
o
ilnkmnmx
MN
lkjW
ψ
ψ
},,{ DVHi
=
]2,2[2],,[
1
],[ 2/
0lnkmlkjW
MN
nmx jjj
mn
= ∑∑
ϕ
ϕ
]2,2[2],,[
12/
0
,, 0
lnkmlkjW
MN
jjij
mn
i
jjDVHi
+ ∑∑
==
ψ
ϕ
pf3
pf4
pf5
pf8

Partial preview of the text

Download 2-D Wavelets - Lecture Slides - Digital Image Processing | ECE 6258 and more Study notes Digital Signal Processing in PDF only on Docsity!

10/20/

ECE 6258 Russell M. Mersereau

1

ECE6258 Lecture 25

2-D Wavelets

10/20/

ECE 6258 Russell M. Mersereau

2

Announcement „

Problem Set #5 has been posted.

Images “mandrill.gif”, “peppers.gif”, and “boats.gif”for PS #5 have also been posted.

10/20/

ECE 6258 Russell M. Mersereau

3

Two-dimensional wavelet transforms „

The wavelet concept can be easily extended separably to twodimensions.

„

In the separable case, a 2-D scaling function and three 2-D waveletsare required.

„

The function can be expanded in terms of the scaling function andwavelets.

] [ ] [ ] , [ n

m

n

m

=

] [ ] [ ] , [ n

m

n

m H

=

] [ ] [ ] , [ n

m

n

m V

=

] [ ] [ ] , [

n

m

n

m

D

10/20/

ECE 6258 Russell M. Mersereau

4

2-D discrete wavelet expansions^ „

Any 2-D sequence can be expanded in any family of 2-D scalingand wavelet functions.

− =

− =

1 0

(^10)

(^2) /

(^2) /

]

[ ] , [ 1 ]

[

M m

N n

j

j

o^

l n k m n m x

MN

l k j

W

ϕ

− =

− =

1 0

1 0

(^2) /

(^2) /

]

2 [

]

[

]

[

M m

N n

j

j i

o i^

l n k m n m

x

MN

l k j

W

ψ

} , ,

{

D

V

H

i^

=

]

2 [

]

, , [ 1 ] , [

(^2) /

0

l n k m l k j W

MN

n m x

j

j

j

m

n

ϕ

]

[

2 ]

[

(^2) /

0

, ,^

0

l n k m l k j W

MN

j

j i

j

m

n

i

j j D V H i

∞ =

=

ϕ

10/20/

ECE 6258 Russell M. Mersereau

5

Fast wavelet analysis (one stage)

10/20/

ECE 6258 Russell M. Mersereau

Fast wavelet synthesis (one stage)

10/20/

ECE 6258 Russell M. Mersereau

7

Frequency decomposition

input

after first stage

after second stage

10/20/

ECE 6258 Russell M. Mersereau

Example: (computer generated image)

Source: Gonzalez and Woods

10/20/

ECE 6258 Russell M. Mersereau

13

Wavelet-based noise removal 1.

Choose a wavelet and number of levels,

P

. Compute the

FWT of the noisy image.

Threshold the detail coefficients from scales

J

-1 to

J-P

using

either a hard or soft threshold.

Perform a wavelet reconstruction based on the originalapproximation coefficients at level

J-P

and the modified

detail coefficients for levels

J

-1 to

J-P

.

10/20/

ECE 6258 Russell M. Mersereau

Denoising example

Noisy original

Denoising with

P=2, hard global threshold

10/20/

ECE 6258 Russell M. Mersereau

15

Denoising example (cont’d)

Result with highestresolution detail coefficientszeroed

Difference image

10/20/

ECE 6258 Russell M. Mersereau

Denoising example (cont’d)

Result with all detailcoefficients zeroed

Difference image

10/20/

ECE 6258 Russell M. Mersereau

17

Wavelet Packets--Motivation „

The FWT decomposes a signal into a series of logarithmicallyrelated frequency bands. ‰

Constant-Q filter banks

„

To get greater control over the partitioning of the time-frequencyplane, we need a more flexible decomposition, called a

wavelet

packet

10/20/

ECE 6258 Russell M. Mersereau

Wavelet Decomposition

Filter bank^ Filter bank

Decompositionspace tree Decompositionspace tree

10/20/

ECE 6258 Russell M. Mersereau

19

Three-scale wavelet packet analysis

10/20/

ECE 6258 Russell M. Mersereau

Filter bank for full wavelet packet analysis

10/20/

ECE 6258 Russell M. Mersereau

25

Adaptive wavelet packets „

Presumably subband signals with little energy are of littleimportance in the representation.

„

Define the easy to compute metric

„

One possibility: decompose only those bands for which

E

f ) passes

a threshold. ‰

Compute the metric for the parent

E

P

and

E

A

,^

E

H

,^

E

V , and

E

D

‰

If

E

A

E

H

E

V

E

D

E

P

include the offspring, else prune them.

n m

n m f

f

E

,

| ] , [ | ) (

10/20/

ECE 6258 Russell M. Mersereau

Optimal tree: example

Note: method used by FBIFor compressing fingerprintImages.

10/20/

ECE 6258 Russell M. Mersereau

27

Associated decomposition

10/20/

ECE 6258 Russell M. Mersereau

Cohen-Daubechies-Feauveau biorthogonal wavelets

10/20/

ECE 6258 Russell M. Mersereau

Corresponding analysis and synthesis filters