Lec5 Wavelets and Multiresolution Analysis

Wavelets and Multi-resolution
Processing
Background
Image Pyramids
Total number of elements in a P+1 level pyramid for P>0 is
1 1 1 4
N 2 (1   2  ...  P )  N 2
4 4 4 3
Subband Coding
An image is decomposed into a set of band-limited
components, called subbands, which can be
reassembled to reconstruct the original image without
error.
Z-Transform
The Z-transform of sequence x(n) for n=0,1,2
is: 
n
X ( z)   x(n ) z
n  
Down-sampling by a factor of 2:
x (n)  x(2n)  X ( z )  X ( z )  X (  z )
1 1/ 2 1/ 2
down down
2
Up-sampling by a factor of 2:
 x(n / 2), n  0,2,4...
x (n)  
up
 X up ( z )  X ( z 2 )
0 otherwise
Z-Transform (cont’d)
If the sequence x(n) is down-sampled
and then up-sampled to yield x^(n),
then:
X ( z )  X ( z )  X (  z )
ˆ 1
2
From Figure 7.4(a), we have:
Xˆ ( z )  G0 ( z )H 0 ( z ) X ( z )  H 0 (  z ) X (  z ) Xˆ ( z )  H 0 ( z )G0 ( z )  H1 ( z )G1 ( z )X ( z )

1 1
2 2
 G1 ( z )H1 ( z ) X ( z )  H1 (  z ) X (  z )
1
 H 0 (  z )G0 ( z )  H1 (  z )G1 ( z )X (  z )
1
2 2
Error-Free Reconstruction
H 0 (  z )G0 ( z )  H1 (  z )G1 ( z )  0
H 0 ( z )G0 ( z )  H1 ( z )G1 ( z )  2
• Matrix expression
[G0 ( z ) G1 ( z )]H m ( z )  [2 0]
• Analysis modulation matrix Hm(z):

 H 0 ( z ) H 0 (  z )
Hm ( z)   
 1
H ( z ) H 1 (  z ) 
G0 ( z ) 2  H1 (  z ) 

 G ( z )  det(H ( z ))  H (  z )
 1  m  0 
FIR Filters
• For finite impulse response (FIR) filters, the
determinate of Hm is a pure delay, i.e.,
det( H m ( z ))  az ( 2k 1)
• Let a=2 g0 (n)  ( 1)n h1 (n)
g1 (n)  ( 1)n 1 h0 (n)
• Let a=-2
g0 (n)  ( 1)n 1 h1 (n)
g1 (n)  ( 1)n h0 (n)
Bi-orthogonality
Let P(z) be defined as:
2
P( z )  G0 ( z ) H 0 ( z )  H 0 ( z ) H1 (  z )
det(Hm ( z ))
2
G1 ( z ) H1 ( z )  H 0 (  z ) H1 ( z )  P (  z )
det(Hm ( z ))
Thus, G0 ( z ) H 0 ( z )  G0 (  z ) H 0 (  z )  2
Taking inverse z-transform:
 g (k )h (n  k )  (1)  g (k )h (n  k )  2 (n)
k
0 0
n
k
0 0
Or,  g ( k ) h ( 2n  k ) 
k
0 0 g0 (k ), h0 (2n  k )   (n)
Bi-orthogonality (Cont’d)
It can be shown that:
g1 (k ), h1 (2n  k )   (n )
g0 (k ), h1 (2n  k )  0
g1 (k ), h0 (2n  k )  0
Or, hi (2n  k ), g j (k )   (i  j ) (n), i, j  {0,1}

Examples: Table 7.1
Table 7.1
2-D Case
Daubechies Orthonormal Filters
Example 7.2
The Haar Transform
Oldest and simplest known orthonormal
wavelets.
T=HFH where
F: NXN image matrix,
H: NxN transformation matrix.
Haar basis functions hk(z) are defined over
the continuous, closed interval [0,1] for
k=0,1,..N-1 where N=2n.
Haar Basis Functions
k  2 p  q  1 where 0  p  n  1,
q  0 or 1 for p  0,1  q  2 p for p  0
1
h0 ( z )  h00 ( z )  , z  [0,1]
N
2 p / 2 ( q  1) / 2 p  z  ( q  0.5) / 2 p
1  p/2
hk ( z )  h pq ( z )   2 ( q  0.5) / 2 p  z  q / 2 p
N 
0 otherwise, z  [0,1]
Example
Multiresolution Expansions
Multiresolution analysis (MRA)
A scaling function is used to create a
series of approximations of a function
or image, each differing by a factor of 2.
Additional functions, called wavelets,
are used to encode the difference in
information between adjacent
approximations.
Series Expansions
A signal f(x) can be expressed as a linear
combination of expansion functions:
f ( x)  a  ( x )
k
k k
Case 1: orthonormal basis:  j ( x),k ( x)   jk

Case 2: orthogonal basis:  j ( x),k ( x)  0 j  k
Case 3: frame: A f ( x )    ( x ), f ( x )  B f ( x )
2 2 2
k
k
Scaling Functions
Consider the set of expansion functions
composed of integer translations and
binary scaling of the real, square-integrable
function, (x),i.e.,
 j ,k ( x )  2 j / 2  ( 2 j x  k )
By choosing  wisely, {j,k(x)} can be made

to span L2(R)
Haar Scaling Function
MRA Requirements
Requirement 1: The scaling function is
orthogonal to its integer translates.
Requirement 2:The subspaces spanned by
the scaling function at low scales are nested
within those spanned at higher resolutions.
Requirement 3:The only function that is
common to all Vj is f(x)=0
Requirement 4: Any function can be
represented with arbitrary precision.
The expansion functions of subspace Vj can be
expressed as a weighted sum of the expansion functions
of subspace Vj+1
Wavelets Functions
Wavelet function ψ(x) is defined as the function, together with its
integer translates and binary scaling, spans the difference between
any two adjacent scaling subspaces, Vj and Vj+1
________________________
 j ,k ( x)  2  (2 x  k ) W j  Span{ j , k ( x)}
j /2 j
The scaling and wavelet function subspaces are related by V j 1  V j  Wj

All members of Vj are orthogonal to the members of Wj
Wavelet Functions
A wavelet function, (x), together with its
integer translates and binary scalings,
spans the difference between any two
adjacent scaling subspace, Vj and Vj+1.
 j ,k ( x )  2  ( 2 x  k )
j/2 j
 ( x)  
n
h (n ) 2 (2 x  n ) h ( n )  ( 1) n h (1  n )
Haar Wavelet Functions
Wavelets and Multiresolution Processing
Wavelet Series Expansion

f ( x)  c
k
j0 (k ) j0 ,k ( x )   d (k )
j  j0 k
j j ,k ( x)
c j0 ( k )   f ( x ) j0 ,k ( x )dx
d j (k )   f ( x) j ,k ( x )dx
Discrete Wavelet Transform

1
W ( j0 , k )  f ( x ) j0 ,k ( x)
M x

1
W ( j, k )  f ( x ) j ,k ( x)
M x
 
1 1
f ( x)  W ( j , k )
 0 j0 ,k ( x)  W ( j, k )  j ,k ( x)
M k M j  j0 k
The Continuous Wavelet Transform
 1 x 
W ( s, )  
f ( x) s , ( x)dx  s , ( x ) 
s
(
s
)
  2
 s , ( x )   (u )
f ( x) 
1
C  W ( s, )
s2
dds C   u
du
0 
Fig. 7.24 (Con’t)


Lec5 Wavelets and Multiresolution Analysis

Uploaded by

Copyright:

Available Formats

Lec5 Wavelets and Multiresolution Analysis

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Lec5 Wavelets and Multiresolution Analysis

Uploaded by

Copyright:

Available Formats

Wavelets and Multi-resolution

Xˆ ( z )  G0 ( z )H 0 ( z ) X ( z )  H 0 (  z ) X (  z ) Xˆ ( z )  H 0 ( z )G0 ( z )  H1 ( z )G1 ( z )X ( z )

• Analysis modulation matrix Hm(z):

Or, hi (2n  k ), g j (k )   (i  j ) (n), i, j  {0,1}

Case 1: orthonormal basis:  j ( x),k ( x)   jk

By choosing  wisely, {j,k(x)} can be made

The scaling and wavelet function subspaces are related by V j 1  V j  Wj

Fig. 7.24 (Con’t)

You might also like