THEORY

OF
WAVELETS
SUBMITTED TO

BY MILIND GOSWAMI

MS. RASHMI GUPTA

06810102811
__________________
SEM

ECE-1, 7TH

Q . WHAT IS A WAVELET?
A wavelet is a small wave-like oscillation with an amplitude that begins
at zero, increases, and then decreases back to zero.
It can typically be visualized as a "brief oscillation" .

 Generally, wavelets are purposefully crafted to have specific properties that make
them useful for signal processing.
These are small waves of varying frequency and limited duration.
Wavelets can be combined, using a technique called convolution, with portions of
a known signal to extract information from the unknown signal.

FACT
The properties of wavelets make them equivalent to a musical score for an
image, revealing not only what notes(frequencies) to play, but also when(time) to play.
Fourier transform only provided the frequency information.

Q . WHAT IS THE HISTORY OF

WAVELETS?
1909. HAAR WAVELET

The Haar sequence was proposed in 1909 by Alfred Haar. In mathematics, the Haar
wavelet is a sequence of rescaled "square-shaped" functions which together form
a wavelet family or basis.

1975. Continuous Wavelet Transform

Notable contributions to wavelet theory can be attributed to Zweig's discovery of the
continuous wavelet transform in 1975 (originally called the cochlear transform and
discovered while studying the reaction of the ear to sound), Pierre
Goupillaud, Grossmann and Morlet's formulation of what is now known as the CWT
(1982).

1983-Present
Jan-Olov Strmberg's early work on discrete wavelets (1983).
Daubechies' orthogonal wavelets with compact support (1988).
Mallat's multiresolution framework (1989).
Akansu's Binomial QMF (1990), Nathalie Delprat's time-frequency interpretation of
the CWT (1991).
Newland'sharmonic wavelet transform (1993) and many others since.

Q. CLASSIFY THE TYPES OF

WAVELETS.

CONTINUOUS WAVELETS:
In numerical analysis, continuous wavelets are functions used by the continuous
wavelet transform. These functions are defined as analytical expressions, as functions
either of time or of frequency. They are the continuous counterpart of orthogonal
wavelets.
Following are some of the continuous wavelets invented:

Beta wavelet

Hermitian wavelet

Hermitian hat wavelet

Meyer wavelet

Mexican hat wavelet

Poisson wavelet

Shannon wavelet

DISCRETE WAVELETS
Discrete wavelets on the other hand are used by the discrete wavelet transform. Following are
some of the discrete wavelets invented:

BNC wavelets

Coiflet wavelets

Cohen-Daubechies-Feauveau wavelet

Daubechies wavelet

Haar wavelet

Mathieu wavelet

Legendre wavelet

Villasenor wavelet

Symlet

Q. DESCRIBE THE VARIOUS TYPES OF

WAVELETS.
1. Haar Wavelet:

The Haar wavelet is a sequence of rescaled "square-shaped" functions which together

form a wavelet family or basis. The Haar sequence was proposed in 1909 by Alfred
Haar. Haar used these functions to give an example of an orthonormal system for the
space of square-integrable functions on the unit interval [0, 1].
The Haar wavelet is also the simplest possible wavelet. The technical disadvantage of
the Haar wavelet is that it is not continuous, and therefore not differentiable. This
property can, however, be an advantage for the analysis of signals with sudden
transitions, such as monitoring of tool failure in machines. The Haar wavelet's mother
wavelet function

can be described as

(t ) 1
0

0 t 1/ 2,
1/ 2 t 1,
otherwise.

MATLAB Code:
[psi,xval] = wavefun('haar',10);
plot(xval,psi); axis([0 1 -1.5 1.5]);
title('Haar Wavelet');

2. Shannon Wavelet:

A Shannon wavelet may be either of real or complex type. Signal analysis by ideal bandpass
filters defines a decomposition known as Shannon wavelets (or sinc wavelets). The Haar and
sinc systems are Fourier duals of each other.

While the Haar Wavelet uses a scaling function which has limited support in time, the Sinc
wavelet uses a scaling function which has limited support in frequency, hence is band limited.
As the name already suggests, this is the Sinc function.

t
3 t
(Sha) (t ) sinc cos

2
2

In the case of complex continuous wavelet, the Shannon wavelet is defined by

(CSha ) (t ) sinc(t ).e j 2 t

MATLAB Code:
% Set bandwidth and center frequency parameters.
fb = 1; fc = 1.5;
% Set effective support and grid parameters.
lb = -20; ub = 20; n = 1000;
% Compute complex Shannon wavelet shan1.5-1.
[psi,x] = shanwavf(lb,ub,n,fb,fc);
% Plot complex Shannon wavelet.
subplot(2,1,1)

plot(x,real(psi)),
title('Complex Shannon wavelet shan1.5-1')
xlabel('Real part'), grid
subplot(2,1,2)
plot(x,imag(psi))

3. Daubechies wavelet:

The Daubechies wavelets are a family of orthogonal wavelets defining a discrete wavelet
transform . With each wavelet type of this class, there is a scaling function (called the father

wavelet) which generates an orthogonal multiresolution analysis.

In general the Daubechies wavelets are chosen to have the highest number A of
vanishing moments, (this does not imply the best smoothness) for given support
width N=2A. There are two naming schemes in use, DN using the length or number of
taps, and dbA referring to the number of vanishing moments. So D4 and db2 are the
same wavelet transform.
Among the 2A1 possible solutions of the algebraic equations for the moment and
orthogonality conditions, the one is chosen whose scaling filter has extremal phase.
The wavelet transform is also easy to put into practice using the fast wavelet transform.
Daubechies wavelets are widely used in solving a broad range of problems, e.g. signal
discontinuities, etc.

MATLAB Code:

W = dbaux(16);
plot(W);

4. Poisson wavelet:

The term "Poisson wavelet" is used to denote a family of wavelets labeled by the set
of positive integers, the members of which are associated with the Poisson probability
distribution. These wavelets were first defined and studied by by Karlene A. Kosanovich, Allan
R. Moser and Michael J. Piovoso in 199596.
For each positive integer n the Poisson wavelet

is defined by

t n n 1 t
t e

n (t ) n !
0

for t 0
for t 0

Basic properties

is the backward difference of the values of the Poisson distribution:

n (t ) pn (t ) pn1 (t ).

The Fourier transform of

( )

i
.
n 1
(1 i )

is given

Poisson wavelet is not an orthogonal family of wavelets.

MATLAB Code:
phi=[];
n=1;
for t=0:0.5:100
a=t-n/factorial(n);
x=pow2(t,n-1);
e=exp(-t);
z=a*x*e;
phi=[phi z];
end
plot(phi);

5. Mexican Hat Wavelet:

In mathematics and numerical analysis, the Ricker wavelet[1]

t 2

2
t 2 2 2
(t )
1 2 e
1

3 4
is the second derivative of a Gaussian function. It is a special case of the family
of continuous wavelets (wavelets used in a continuous wavelet transform) known
as Hermitian wavelets. It is usually only referred to as the "Mexican hat" in the
Americas, due to cultural association. The Mexican Hat Wavelet is frequently employed
to model seismic data, and as a broad spectrum source term in computational
electrodynamics.
The multidimensional generalization of this wavelet is called the Laplacian of

Gaussian function. In practice, this wavelet is sometimes approximated by

thedifference of Gaussian function, because it is separable and can therefore save
considerable computation time in two or more dimensions. The scale normalised
Laplacian (in

-norm) is frequently used as a blob detector and for automatic scale

selection in computer vision applications of Gaussian and scale space. The Mexican
hat wavelet can also be approximated by derivatives of Cardinal B-Splines.

MATLAB Code:

% Set effective support and grid parameters.

lb = -5; ub = 5; n = 1000;
% Compute and plot Mexican hat wavelet.
[psi,x] = mexihat(lb,ub,n);
plot(x,psi), title('Mexican hat wavelet')

6. Coiflets Wavelets:

Coiflets are discrete wavelets designed by Ingrid Daubechies, at the request of Ronald
Coifman, to have scaling functions with vanishing moments. The wavelet is near
symmetric, their wavelet functions have
functions

vanishing moments and scaling

, and has been used in many applications usingCaldern-Zygmund

Operators.
Both the scaling function (low-pass filter) and the wavelet function (High-Pass Filter)
must be normalised by a factor

. Below are the coefficients for thescaling

functions for C6-30. The wavelet coefficients are derived by reversing the order of the
scaling function coefficients and then reversing the sign of every second one (i.e. C6
wavelet = {0.022140543057, 0.102859456942, 0.544281086116, 1.205718913884,
0.477859456942, 0.102859456942}).
Mathematically, this looks like Bk ( 1) k C N 1 k where k is the coefficient index, B is a
wavelet coefficient and C a scaling function coefficient.

MATLAB Code:
close all

% Set coiflet wavelet name.

wname = 'coif4';
% Compute the corresponding scaling filter.
f = coifwavf(wname)
plot(f)

7. Symlet Wavelets:
Daubechies proposes modifications of her wavelets that increase their symmetry can
be increased while retaining great simplicity.

The idea consists of reusing the function m0 introduced in the dbN, considering
the m0 w as a function W of
2

Then we can factor W in several different ways in the form of

W ( z ) U ( z ).U (1/ z )
because the roots of W with modulus not equal to 1 go in pairs. If one of the roots is z1,
then

is also a root.
By selecting U such that the modulus of all its roots is strictly less than 1, we
build Daubechies wavelets dbN. The U filter is a "minimum phase filter."

By making another choice, we obtain more symmetrical filters; these are symlet

MATLAB Code:
a=wavefun('sym8');
plot(a);

Q . WHAT IS A WAVELET TRANSFORM? CLASSIFY THE TYPES

OF WAVELET TRANSFORMS.
A wavelet is a mathematical function used to divide a given function or continuous-time
signal into different scale components. Usually one can assign a frequency range to
each scale component. Each scale component can then be studied with a resolution

that matches its scale. A wavelet transform is the representation of a function by

wavelets. The wavelets are scaled and translated copies (known as "daughter
wavelets") of a finite-length or fast-decaying oscillating waveform (known as the
"mother wavelet"). Wavelet transforms have advantages over traditional Fourier
transforms for representing functions that have discontinuities and sharp peaks, and for
accurately deconstructing and reconstructing finite, non-periodic and/or nonstationary signals.
Wavelet transforms are classified into discrete wavelet transforms (DWTs)
and continuous wavelet transforms (CWTs). Note that both DWT and CWT are
continuous-time (analog) transforms. They can be used to represent continuous-time
(analog) signals. CWTs operate over every possible scale and translation whereas
DWTs use a specific subset of scale and translation values or representation grid.
There are a large number of wavelet transforms each suitable for different applications:

Continuous wavelet transform (CWT)

Discrete wavelet transform (DWT)

Fast wavelet transform (FWT)

Wavelet packet decomposition (WPD)

Stationary wavelet transform (SWT)

Fractional Fourier transform (FRFT)

Fractional wavelet transform (FRWT)

Q . WHAT IS THE IDEA BEHIND MULTIRESOLUTION

PROCESSING?
Multiresolution processing means looking the different regions at different resolutions.

All the small size and/or low contrast regions are seen at high resolution.
All the large size and/or high contrast regions are seen at low resolution.

If both small and large size images are available, then it can be advantageous to study
them at several resolutions.

LEVEL 0
LEVEL 1
LEVEL 2
LEVEL 3

Q.

WHY ARE WAVELETS USEFUL?

1. Compression applications: If we can create a suitable representation of a signal,

we can discard the "least significant" pieces of that representation and thus keep the
original signal largely intact. This requires a transformation which separates the
"important" parts of the signal from less important parts. In the simplest case, we can
decompose a signal into two parts: a low frequency part, which is some sort of average
of the original signal, and a high frequency part, which is what remains after the low

frequency part is subtracted from the original signal. If we are interested in the low
frequency part and hence discard the high frequency part, what remains is a smoother
representation of the original signal with its low frequency components intact.
Alternatively, if we are most interested in the high frequency part, we may be able to
discard the low frequency part instead. This approach, that of decomposing a signal
into two parts, is common for all wavelets. Also fundamental to wavelet analysis is a
hierarchical decomposition, in which we may apply further transforms to an already
decomposed signal.
2. Edge detection: With this application it is most important to identify the areas in
which the input image changes quickly. We can discard the smooth (low frequency)
parts. The simplest wavelet basis, the Haar basis (to be discussed later) is suitable
for this application.
3. Graphics: Two prominent uses of wavelets in graphics include
1. Curve and surface representations; and
2. Wavelet radiosity.
These two reflect two quite different uses of wavelets.

BIBLIOGRAPHY
1. Wavelet toolbox by MATLAB:
http://in.mathworks.com/help/wavelet/index.html
2. Wavelet Functions by MATLAB
http://in.mathworks.com/help/wavelet/functionlist.html

3. Article on wavelets by Wikipedia

http://en.wikipedia.org/wiki/Wavelet
4. The wavelet tutorial by IITD
http://web.iitd.ac.in/~sumeet/WaveletTutorial.pdf
5. Video on theory of Wavelets by NPTELHRD
https://www.youtube.com/watch?v=namEuXQqxF4
6. Introduction to Wavelets by Stanford University
http://cva.stanford.edu/classes/ee482a/docs/lect01_sample.
pdf
7. MATLAB Programs by Florida State University
http://people.sc.fsu.edu/~jburkardt/m_src/haar/haar_1d.m
8. Wavelet Techniques for Time Series and Poisson Data
http://stats.lse.ac.uk/fryzlewicz/phd/thesis.pdf
9. Wavelet functions by Pybytes.com
http://www.pybytes.com/pywavelets/ref/wavelets.html#pywt.
wavelist