Scribd
Upload
11 views3 pages

Wavelet Transform

Uploaded by

Sher Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
11 views3 pages

Wavelet Transform

Uploaded by

Sher Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Wavelet Transform

A major disadvantage of the Fourier Transform is it


captures global frequency information, meaning
frequencies that persist over an entire signal. This kind
of signal decomposition may not serve all applications
well, for example Electrocardiography (ECG) where
signals have short intervals of characteristic
oscillation. An alternative approach is the Wavelet
Transform, which decomposes a function into a set
of wavelets.

What’s a Wavelet?

A Wavelet is a wave-like oscillation that is


localized in time, an example is given below.
Wavelets have two basic properties: scale and
location. Scale (or dilation) defines how “stretched” or
“squished” a wavelet is. This property is related to
frequency as defined for waves. Location defines
where the wavelet is positioned in time (or space).
Wavelet Principle
The fundamental idea of wavelet transforms is that the transformation should allow only changes
in time extension, but not shape. This is affected by choosing suitable basis functions that allow
for this.[how?] Changes in the time extension are expected to conform to the corresponding analysis
frequency of the basis function. Based on the uncertainty principle of signal processing,
where represents time and angular frequency (, where is temporal frequency).
The higher the required resolution in time, the lower the resolution in frequency has to be.
The larger the extension of the analysis windows is chosen, the larger is the value of [how?].

When is large,

1. Bad time resolution


2. Good frequency resolution
3. Low frequency, large scaling factor
When is small

1. Good time resolution


2. Bad frequency resolution
3. High frequency, small scaling factor
In other words, the basis function can be regarded as an impulse response of a system with
which the function has been filtered. The transformed signal provides information about the
time and the frequency. Therefore, wavelet-transformation contains information similar to
the short-time-Fourier-transformation, but with additional special properties of the wavelets,
which show up at the resolution in time at higher analysis frequencies of the basis function.
The difference in time resolution at ascending frequencies for the Fourier transform and the
wavelet transform is shown below. Note however, that the frequency resolution is decreasing
for increasing frequencies while the temporal resolution increases. This consequence of
the Fourier uncertainty principle is not correctly displayed in the Figure.
This shows that wavelet transformation is good in time resolution of high frequencies, while
for slowly varying functions, the frequency resolution is remarkable.
Another example: The analysis of three superposed sinusoidal signals with STFT and
wavelet-transformation.

Multiresolution analysis
A multiresolution analysis (MRA) or multiscale approximation (MSA) is the
design method of most of the practically relevant discrete wavelet transforms (DWT)
and the justification for the algorithm of the fast wavelet transform (FWT). It was
introduced in this context in 1988/89 by Stephane Mallat and Yves Meyer and has
predecessors in the microlocal analysis in the theory of differential
equations (the ironing method) and the pyramid methods of image processing as
introduced in 1981/83 by Peter J. Burt, Edward H. Adelson and James L. Crowley.

You might also like