General Presentation
Discrete Wavelet Transform
Kiran .N
CGB0910003
M. Sc. (Engg.) in VLSI System Design
Academic Guide :
R. Selva Kumar
Asst.Professor, MSRSAS, Bangalore
M. S. Ramaiah School of Advanced Studies 1
Session Objectives
After completing this session, we will be able to:
• understand the advantages of wavelets.
• know which coding technique is suited for which
application.
• have a better understanding of discrete wavelet transform.
• Know how to bring about image compression using dwt.
• Know the advantages and disadvantages of DWT compared
to other image compression techniques.
M. S. Ramaiah School of Advanced Studies 2
Session Topics
• Wavelets
• Continues wavelet transform.
• Haar wavelets.
• Discrete wavelet transform.
• Filter tree used to bring about compression.
• Advantages of DWT.
• Disadvantages of DWT.
M. S. Ramaiah School of Advanced Studies 3
Wavelets
A wavelet is a wave-like oscillation with an amplitude that starts
out at zero, increases, and then decreases back to zero.
It can typically be visualized as a "brief oscillation" like one might
see recorded by a seismograph or heart monitor.
A simple wavelet.
M. S. Ramaiah School of Advanced Studies 4
Wavelets can be combined, using a "shift, multiply and sum"
technique called convolution, with portions of an unknown
signal to extract information from the unknown signal.
Generally, wavelets are purposefully crafted to have specific
properties that make them useful for signal processing.
Mathematically, the wavelet will resonate if the unknown signal
contains information of similar frequency. This concept of
resonance is at the core of many practical applications of wavelet
theory.
The main objective of using wavelets is that we will be able to
bring about space and frequency localization which is very useful
when it comes to analysis of the signal.
M. S. Ramaiah School of Advanced Studies 5
Wavelets can be used to extract information from many
different kinds of data, including - but certainly not limited to -
audio signals and images. Sets of wavelets are generally needed
to analyze data fully.
A set of "complementary" wavelets will deconstruct data
without gaps or overlap so that the deconstruction process is
mathematically reversible.
A set of complementary wavelets are useful in wavelet based
compression/decompression algorithms where it is desirable to
recover the original information with minimal loss.
M. S. Ramaiah School of Advanced Studies 6
Continuous Wavelet Transform
Fourier transform use “wave” to analyze signal.
WT use “wavelet of finite energy” to analyze signal
Signal to be analyzed is multiplied to a wavelet function, the
transform is computed for each segment.
The width changes with each spectral component
M. S. Ramaiah School of Advanced Studies 7
Mother wavelet
Mother wavelet Ψ(t):by scaling and translating the mother
wavelet, we can obtain the rest of the function for the
transformation(child wavelet, Ψa,b(t) ).
1 t b
a , b (t ) ( )
a a
Where a is the scaling factor
b is the shifting factor
M. S. Ramaiah School of Advanced Studies 8
2-point Haar Wavelet
Continuous form:
The Haar wavelet's mother wavelet function ψ(t) can be
described as
and its scaling function φ(t) can be described as
M. S. Ramaiah School of Advanced Studies 9
2-point Haar Wavelet
Discrete form:
g[n] = 1/2 for n = −1, 0 h[0] = 1/2, h[−1] =
−1/2,
g[n] = 0 otherwise
h[n] = 0 otherwise
M. S. Ramaiah School of Advanced Studies 10
Performing the inner product of the child wavelet and f(t), we can
attain the wavelet coefficient
wa ,b a ,b , f (t ) a ,b f (t )dt
We can reconstruct f(t) with the wavelet coefficient by
1 dadb
f (t )
C wa,b a,b (t ) a 2
M. S. Ramaiah School of Advanced Studies 11
Discrete Wavelet Transform
Advantage over CWT: reduce the computational
complexity(separate into H & L freq.)
Inner product of f(t)and discrete parameters a & b
m m
aa 0 , b nb a 0 0 m, n Z
If a0=2,b0=1, the set of the wavelet
m ,n (t ) a (a t - nb0 )
m/2
0
m
0 m, n Z
m ,n (t ) 2 m / 2 (2 m t - n)
M. S. Ramaiah School of Advanced Studies 12
The DWT coefficient
wm,n f (t ), m,n (t ) a0m / 2 f (t ) (a0m (t ) nb0 )dt
We can reconstruct f(t) with the wavelet coefficient by
f (t ) wm ,n m,n (t )
m n
M. S. Ramaiah School of Advanced Studies 13
1- Dimensional (analysis):
M. S. Ramaiah School of Advanced Studies 14
Filter Tree
2-Dimension(analysis):
M. S. Ramaiah School of Advanced Studies 15
Original
Image
LL HL
LH HH
M. S. Ramaiah School of Advanced Studies 16
LL2 HL2
HL
LH2 HH2
LH HH
LL3 HL3
LH3 HH3
HL2
HL
LH2 HH2
LH HH
M. S. Ramaiah School of Advanced Studies 17
Generally images are rich in low frequency content.
The richest information is present in the LL subband.
So we prefer performing iterations on the LL subband is
depicted in previous slides .
The original information contains the maximum resolution. So
as the number of iterations performed increases the resolution of
the image decreases and coarseness is introduced.
This method is also called dyadic partitioning.
M. S. Ramaiah School of Advanced Studies 18
Using the direct DWT the compression of the image can be
brought about.
Using the inverse DWT the original image can be obtained from
sub bands.
M. S. Ramaiah School of Advanced Studies 19
Wavelet compression
M. S. Ramaiah School of Advanced Studies 20
Advantages of DWT
No need to divide the input coding into non-overlapping 2-D
blocks, it has higher compression ratios avoid blocking artifacts.
Allows good localization both in time and spatial frequency
domain.
Transformation of the whole image introduces inherent scaling
Better identification of which data is relevant to human
perception higher compression ratio
M. S. Ramaiah School of Advanced Studies 21
Disadvantages of DWT
The cost of computing DWT as compared to DCT may be higher.
The use of larger DWT basis functions or wavelet filters produces
blurring and ringing noise near edge regions in images or video
frames.
Longer compression time.
Lower quality than JPEG at low compression rates.
M. S. Ramaiah School of Advanced Studies 22
References
[1] C.Gargour,M.Gabrea,V.Ramachandran,J.M.Lina, ”A short introduction to
wavelets and their applications,” Circuits and Systems Magazine, IEEE, Vol. 9,
No. 2. (05 June 2009), pp. 57-68.
[2] R. C. Gonzales and R. E. Woods, Digital Image Processing. Reading, MA,
Addison-Wesley, 1992.
[3] NancyA. Breaux and Chee-Hung Henry Chu,” Wavelet methods for
compression, rendering, and descreening in digital halftoning,” SPIE proceedings
series, vol. 3078, pp. 656-667, 1997 .
[4] M. Barlaud et al., "Image Coding Using Wavelet Transform" IEEE Trans. on
Image Processing 1, No. 2, 205-220 (April, 1992).
[5] J. M. Shapiro, “Embedded image coding using zerotrees of wavelet
coefficients,” IEEE Trans. Acous., Speech, Signal Processing, vol. 41, no. 12, pp.
3445-3462, Dec. 1993.
M. S. Ramaiah School of Advanced Studies 23
Thank you.
M. S. Ramaiah School of Advanced Studies 24
