ASSIGNMENT NO.
Submitted By:
Shehzar Ali
Roll No:
2018-cs-13(A)
Submitted To:
Sir Talha Jahangir
Submission Date:
7-4-21
Digital Signal Processing
Q1. What is wavelet transform. Write three examples
of wavelet transform. Write 5 pros and cons of
wavelet transform. Compare Wavelet transform with
Fourier transform?
Wavelet
Oxford Dictionary:
A wavelet is a small wave.
Wikipedi:
A wavelet is a mathematical function used to
divide a given function or continuous-time
signal into different scale components.
A Wavelet Transform is the representation of a
function by wavelets.
What is Wavelet transform.
Wavelet transforms are a relatively recent development in functional
analysis that have attracted a great deal of attention from the signal
processing community (Daubechies, 1991).
The wavelet transform of a function belonging to ℒ2{ℝ}, the space of
the square integrable functions, is its decomposition in a base formed
by expansions, compressions, and translations of a single mother
function ψ(t), called a wavelet.
What is wavelet transform.
Historical Development
1. 1909 : Alfred Haar – Dissertation “On the Orthogonal Function
Systems” for his Doctoral Degree. The first wavelet related theory .
2. 1910 : Alfred Haar : Development of a set of rectangular basis
functions.
3. 1930s : - Paul Levy investigated “The Brownian Motion”. - Littlewood
and Paley worked on localizing the contributing energies of a
function.
4. 1946 : Dennis Gabor : Used Short Time Fourier Transform .
5. 1975 : George Zweig : The first Continuous Wavelet Transform CWT.
Historical Development
6. 1985 : Yves Meyer : Construction of orthogonal wavelet basis
functions with very good time and frequency localization.
7. 1986 : Stephane Mallat : Developing the Idea of Multiresolution
Analysis “MRA” for Discrete Wavelet Transform “DWT”
8. 1988 : The Modern Wavelet Theory with Daubechies and Mallat.
9. 1992 : Albert Cohen, Jean fauveaux and Daubechies constructed the
compactly supported biorthogonal wavelet.
Write three examples of wavelet transform
FBI Fingerprints Compression
Since 1924, the FBI Collected about 200 Million cards of fingerprints.
Each fingerprints card turns into about 10 MB, which makes 2,000 TB
for the whole collection. Thus, automatic fingerprints identification
takes a huge amount of time to identify individuals during criminal
investigations.
The FBI decided to adopt a wavelet-based image coding algorithm as a
national standard for digitized fingerprint records.
The WSQ (Wavelet/Scalar Quantization) developed and maintained by
the FBI, Los Alamos National Lab, and the National Institute for
Standards and Technology involves:
• 2-dimensional discrete wavelet transform DWT.
• Uniform scalar quantization.
• Huffman entropy coding
Pros of Wavelet Transform
Because data are shattered into more components, it becomes much
easier to filter in or filter out a given nonstationary waveform.
Provide a way for analysing waveforms in both frequency and duration.
Representation of functions that have discontinuities and sharp peaks.
Accurately deconstructing and reconstructing finite, non- periodic
and/or non-stationary signals.
Allow signals to be stored more efficiently than by Fourier transform.
Cons of wavelet transform
It is more difficult to interpret the results.
Greater complexity. Greater complexity translates in this case into
more resources required to perform the computation - more memory
and/or processor cycles and/or time.
The flexibility of WTs is a two-edged sword - it is sometimes very
difficult to chose which basis to use. Do you need a differentiable basis?
Then you won’t want a Haar or low order Daubechies basis.
If you don’t need to locate events in time, or if the signal is stationary in
the frequency domain, there is no advantage to DWT, and more effort
to compute the values.
The theory is more difficult to understand.
JPEG 2000
Image compression standard and coding system.
Created by Joint Photographic Experts Group committee in 2000.
Wavelet based compression method.
1:200 compression ratio Mother Wavelet used in JPEG2000
compression.
Mother wavelet used in JPEG 2000 compression
JPEG 2000
Comparision between JPEG AND JPEG 2000
Other Examples of wavelet transform
Audio compression.
Speech recognition.
Image and video compression.
Denoising Signals.
Motion Detection and tracking
Compare Wavelet transform with
Fourier transform?
Wavelet Transform Fourier Transform
The mathematical The mathematical
expression for wavelet expression for Fourier
transform is transform is
Where s is scale and Tao Where x(t) is time domain
is translation parameter x(t) signal and X( f ) is the
is original signal. frequency domain signal
Compare Wavelet transform with
Fourier transform?
Wavelet Transform Fourier Transform
Suitable for stationary and non Suitable for stationary signal.
stationary signal.
W.T. has high time resolution Fourier transform has zero
and high frequency resolution time resolution and very high
as well as time and frequency frequency resolution.
resolution can also be changed . In Fourier analysis signal is
In wavelet transform signal is converted into sine and cosine
converted into scaled and waves of different amplitudes
translated version of mother and frequencies.
wavelets
Compare Wavelet transform with
Fourier transform?
Wavelet Transform Fourier Transform
Wavelet transform is very Fourier transform is not
suitable for studying the local suitable for studying the local
behavior of the signal for behavior of signal.
example discontinuity or
spikes. In Fourier transform the input
In wavelet transform the input can be a real or complex
can be a real or complex function but its output is
function but its output may be always complex.
real or complex .