Coe4Tn3 Image Processing: Wavelet and Multiresolution Wavelet and Multiresolution Processing
Coe4Tn3 Image Processing: Wavelet and Multiresolution Wavelet and Multiresolution Processing
CoE4TN3
Image Processing
2 5
3 6
1
Image pyramids Subband coding
Each iteration is composed of three sequential steps: In subband coding, an image is decomposed into a set of
bandlimited components, called subbands.
1. Compute a reduced resolution approximation of the
Since the bandwidth of the resulting subbands is smaller than
input image. This is done by filtering the input and
that of the original image, the subbands can be downsampled
downsampling (subsampling) the filtered result by a without loss of information.
factor of 2.
Filter: neighborhood averaging, Gaussian
filtering
The quality of the generated approximation is a
function of the filter selected
7 10
( )
later used to reconstruct progressively the original
x(n) = x (n) i.e. X ( z ) = X ( z )
image
8 11
H 0 ( z )G0 ( z ) + H1 ( z )G1 ( z ) = 0
If
H 0 ( z )G0 ( z ) + H1 ( z )G1 ( z ) = 2
Then
X ( z ) = X ( z )
9 12
2
Perfect Reconstruction Filter Families
13 16
14 17
h0 = { 2 2, 2 2 } {
h1 = 2 2, 2 2 }
g0 ={ 2 2, 2 2} g0 ={ 2 2, 2 2}
15 18
3
Multiresolution Expansions
Scaling functions
Integer translations and dyadic scalings of a
scaling function ( x)
j ,k ( x) = 2 j / 2 (2 j x k )
f ( x) = k j0 ,k ( x)
k
19 22
Multiresolution Expansions
Series Expansions 0 0 x < 1
( x) =
A function can be expressed as 1 otherwise
1
0, k ( x) = 1,2 k ( x)
f ( x ) = k k ( x) 2
k
1
where + 1,2
1 2 k +1 ( x )
2
k = k ( x), f ( x) = k* ( x) f ( x)dx f ( x) = 0.51,0 ( x)
+1,1 ( x) 0.251,4 ( x)
k ( x) Dual function of k ( x)
* Complex conjugate operation
20 23
4
Multiresolution Expansions Wavelet Transform: 1-D
Wavelet functions Wavelet series expansion
( x) = h (n) 2 (2 x n)
n f ( x) = c j0 j0 ,k ( x) + d j (k ) j ,k ( x)
h (n) are called wavelet function coefficients k j = j0 k
25 28
1
y ( x) = 0,0 ( x)
3
1
0,0 ( x)
4
2
1,0 ( x)
32
3 2
1,1 ( x)
32
+......
26 29
1
f ( x)
Detail
coefficients
W ( j , k ) = j ,k ( x)
M x
27 30
5
Fast Wavelet Transform: Decomposition Fast Wavelet Transform: Reconstruction
W ( j , k ) = h ( n) W ( j + 1, n) W ( j + 1, k ) = h (k ) Wup ( j , k ) + h (k ) Wup ( j , k ) k 0
n =2 k ,k 0
W ( j , k ) = h ( n) W ( j + 1, n) n = 2 k ,k 0
31 34
32 35
33 36
6
Wavelet Transform vs. Fourier Transform 2-D Wavelet Transform: Reconstruction
37 40
Scaling function:
( x, y ) = ( x) ( y )
Wavelet functions:
H ( x, y ) = ( x) ( y ) Horizontal direction
V ( x, y ) = ( x) ( y ) Vertical direction
( x, y ) = ( x) ( y )
D
Diagonal direction
38 41
39 42
7
Wavelet Transform based Denoising
Three Steps:
Fig. 7.24 (g) Decompose the image into several scales.
For each wavelet coefficient y:
y y t
Hard thresholding: y =
0 y <t
sign( y )i( y t ) y t
Soft thresholding: y =
0 y <t
Reconstruct the image with the altered
wavelet coefficients.
43 46
Three Steps:
Decompose the image into wavelet domain
Alter the wavelet coefficients, according to
your applications such as denoising
denoising,
compression, edge enhancement, etc.
Reconstruct the image with the altered
wavelet coefficients.
44 47
Assignment
45 48
8
End of the lecture
49