Applications in Signal and Image Processing

Slides:



Advertisements
Similar presentations
Wavelet Transform A Presentation
Advertisements

Window Fourier and wavelet transforms. Properties and applications of the wavelets. A.S. Yakovlev.
Learning Wavelet Transform by MATLAB Toolbox Professor : R.J. Chang Student : Chung-Hsien Chao Date : 2011/12/02.
Introduction to the Curvelet Transform
University of Ioannina - Department of Computer Science Wavelets and Multiresolution Processing (Background) Christophoros Nikou Digital.
Transform Techniques Mark Stamp Transform Techniques.
DFT/FFT and Wavelets ● Additive Synthesis demonstration (wave addition) ● Standard Definitions ● Computing the DFT and FFT ● Sine and cosine wave multiplication.
Time and Frequency Representations Accompanying presentation Kenan Gençol presented in the course Signal Transformations instructed by Prof.Dr. Ömer Nezih.
Lecture05 Transform Coding.
Lecture 17 spectral analysis and power spectra. Part 1 What does a filter do to the spectrum of a time series?
Time-Frequency and Time-Scale Analysis of Doppler Ultrasound Signals
Biomedical signal processing: Wavelets Yevhen Hlushchuk, 11 November 2004.
With Applications in Image Processing
Wavelet Transform 國立交通大學電子工程學系 陳奕安 Outline Comparison of Transformations Multiresolution Analysis Discrete Wavelet Transform Fast Wavelet Transform.
Undecimated wavelet transform (Stationary Wavelet Transform)
Short Time Fourier Transform (STFT)
Lecture 19 The Wavelet Transform. Some signals obviously have spectral characteristics that vary with time Motivation.
Wavelet Transform A very brief look.
Wavelet Transform. What Are Wavelets? In general, a family of representations using: hierarchical (nested) basis functions finite (“compact”) support.
Basic Concepts and Definitions Vector and Function Space. A finite or an infinite dimensional linear vector/function space described with set of non-unique.
Multi-Resolution Analysis (MRA)
Introduction to Wavelets
Wavelet-based Coding And its application in JPEG2000 Monia Ghobadi CSC561 project
Introduction to Wavelets -part 2
ECE 501 Introduction to BME ECE 501 Dr. Hang. Part V Biomedical Signal Processing Introduction to Wavelet Transform ECE 501 Dr. Hang.
Multiscale transforms : wavelets, ridgelets, curvelets, etc.
Fourier Transforms Revisited
ENG4BF3 Medical Image Processing
Image Representation Gaussian pyramids Laplacian Pyramids
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
Wavelets: theory and applications
The Wavelet Tutorial: Part3 The Discrete Wavelet Transform
Details, details… Intro to Discrete Wavelet Transform The Story of Wavelets Theory and Engineering Applications.
WAVELET TUTORIALS.
1 Orthonormal Wavelets with Simple Closed-Form Expressions G. G. Walter and J. Zhang IEEE Trans. Signal Processing, vol. 46, No. 8, August 王隆仁.
The Story of Wavelets.
The Wavelet Tutorial Dr. Charturong Tantibundhit.
Lecture 13 Wavelet transformation II. Fourier Transform (FT) Forward FT: Inverse FT: Examples: Slide from Alexander Kolesnikov ’s lecture notes.
README Lecture notes will be animated by clicks. Each click will indicate pause for audience to observe slide. On further click, the lecturer will explain.
Lifting Part 1: Introduction Ref: SIGGRAPH96. Outline Introduction to wavelets and lifting scheme Basic Ideas –Split, Predict, Update –In-place computation.
Wavelet-based Coding And its application in JPEG2000 Monia Ghobadi CSC561 final project
Wavelet transform Wavelet transform is a relatively new concept (about 10 more years old) First of all, why do we need a transform, or what is a transform.
Basics Course Outline, Discussion about the course material, reference books, papers, assignments, course projects, software packages, etc.
ECE472/572 - Lecture 13 Wavelets and Multiresolution Processing 11/15/11 Reference: Wavelet Tutorial
1 Using Wavelets for Recognition of Cognitive Pattern Primitives Dasu Aravind Feature Group PRISM/ASU 3DK – 3DK – September 21, 2000.
“Digital stand for training undergraduate and graduate students for processing of statistical time-series, based on fractal analysis and wavelet analysis.
Wavelets and Multiresolution Processing (Wavelet Transforms)
The Discrete Wavelet Transform
Time frequency localization M-bank filters are used to partition a signal into different frequency channels, with which energy compact regions in the frequency.
The Wavelet Tutorial: Part2 Dr. Charturong Tantibundhit.
Wavelet Transform Yuan F. Zheng Dept. of Electrical Engineering The Ohio State University DAGSI Lecture Note.
The Story of Wavelets Theory and Engineering Applications
By Dr. Rajeev Srivastava CSE, IIT(BHU)
Computer Graphics & Image Processing Chapter # 4 Image Enhancement in Frequency Domain 2/26/20161.
Wavelets Introduction.
Short Time Fourier Transform (STFT) CS474/674 – Prof. Bebis.
Wavelets (Chapter 7) CS474/674 – Prof. Bebis. STFT - revisited Time - Frequency localization depends on window size. –Wide window  good frequency localization,
Wavelet Transform Advanced Digital Signal Processing Lecture 12
Wavelets Transform & Multiresolution Analysis
k is the frequency index
Multiresolution Analysis (Chapter 7)
Multi-resolution image processing & Wavelet
Wavelets : Introduction and Examples
Multi-resolution analysis
Fourier Transform.
Wavelet transform Wavelet transform is a relatively new concept (about 10 more years old) First of all, why do we need a transform, or what is a transform.
k is the frequency index
فصل هفتم: موجک و پردازش چند رزلوشنی
Chapter 15: Wavelets (i) Fourier spectrum provides all the frequencies
Wavelet Analysis Objectives: To Review Fourier Transform and Analysis
Presentation transcript:

Applications in Signal and Image Processing Wavelets Applications in Signal and Image Processing

Motivation! The Fourier Transform Time domain -> frequency domain Inner product of x(t) to a sin and cos function at frequency f If X(f) is large for a given f the x(t) matches well and contains a lot of the frequency f. If X(f) is small for a given f then x(t) doesn’t match well and does not contain frequency f. IMPULSE RESPONSE In time domain we know the value of the signal at any time i.e. we have time resolution In frequency domain we know exactly what frequencies exist

Problem The FT of stationary and non stationary signals with the same frequency components are equivalent. i.e. we are lacking time localization Although FT tells us what frequencies appear in the signal it does not tell us at what time they appear! Sationary waves : those where the frequency component exists at all times Non stationary: certain frequencies appear at certain time

What has caused this? e-2iπf is a function of infinite support / infinite window function inner product of function to an infinite window looks for frequency f over all time Nice as we get perfect frequency resolution in the frequency domain

Short Term Fourier Transform: STFT Multiple FT over smaller windows translated in time Compactly supported We now have a time- frequency representation YOU CAN ALL GO HOME  W windowing function of width T

NOT! Recall: In the time domain we know exactly the value of the signal at any time (time resolution) In the frequency domain we know exactly the frequencies in the signal (frequency resolution) In STFT the kernel is compact … thus we can only see a band of frequencies based on the size of the kernel We get perfect frequency resolution in the FT because the kernel is infinite and thus can represent all frequencies

Increasing window width Consequence Window size is application specific Narrow window -> good time resolution, poor frequency resolution Wide window -> good frequency resolution, poor time resolution Increasing window width

Wavelets to the rescue We would like to develop a method independent of the windowing function that gives us Good time resolution and poor frequency resolution at high frequencies Good frequency resolution but poor time resolution at low frequencies Low frequency => Signal information High frequency => Excess detail or noise in the signal I have used FT and frequency analysis to motivate the use of WT however this isnt the only reason to use them there are many many other

Continuous Wavelet Transform: CWT Ψ is the mother wavelet, the shape or choice of this depend on the properties of the signal we wish to analyze Haar, 1st deriv gausian, mexican hat, morlet

Time localization Inspect the signal at different time steps Introduce a translation parameter, t’, that controls the translation of the function:

Frequency Localization Inspect the signal for different frequencies Introduce a dilation parameter, s, that controls the scale of the function: Smaller s the narrower the wavelet 1/sqrt(s) is for energy normalisation

Result Changing dilation parameter: Frequency Localization Changing translation parameter: Time Localization

Result +ve response Low response -ve response 0 response

Orthogonality / Orthonormal i.e. 2 functions are, at no place the same or, are symmetric Orthonormal: So dilations and translations of a wavelet must be orthonormal to itself so as not to influence the construction of the coefficients These allow for perfect reconstructions of the form Orthogonality means that the information in the coefficient ψs,t’ is not repeated anywhere else. i.e removes redundancy.

Inverse Wavelet Transform: ICWT Denoise by zeroing out coefficients

Frequency to time resolution Low scales / high frequencies have good time resolution but poor frequency resolution. High scales / low frequencies have good frequency resolution but poor time resolution. STFT has constant time to frequency resolution as window size is fixed

Discrete Wavelet Transform: DWT The Discrete Wavelet Transform is a sampled version of the Continuous case with discrete dilation and translation parameters Filters or different cut of frequencies are used to analyze the signal at different scales or resolutions We will be requiring a scaling filter/function and a wavelet filter/function in this case Scaling function – low pass filter - approximation Wavelet – high pass filter - details

Discrete wavelet Ψ Recall that the CW is defined as: In a continuous transform we find the inner product over all scales S and translates t’. However now we must sample s and t’. Logarithmic sampling of s means we need to move in discrete steps on t’ proportional to the scale s.

Dyadic scaling Dyadic scaling, choose s0=2 and t0’=1 Later this will lead to a nice down sampling routine DWT to obtain detail coefficients becomes: N.b. when we compute the CWT the the ICWT is accurate only up to the resolution of the samplings of s and t’. With DWT the intergral is continuous but is only calculated on a discretized grid at m and n. thus we can reconstruct exactly the signal

Dyadic scaling

Discrete scaling function Φ In the CWT we calculated the set of coefficients ψ over all scales s and translations t’ on the continuous signal x(t) As we are sampling x(t) we cannot have these infinite coefficients. We need some way of keeping track of what the wavelet coefficients don’t express. Therefore we must define how we sample the signal based on the current dilation, m, of the wavelet. This is done via a Scaling function We can convolve the signal with the scaling function to get approximation coefficients Scaling func is derived based on the wavelet or vicaversa

Discrete scaling function Φ

Approximation and detail Approximation coefficients, ϕ, are produced by applying the scaling function to the sampled signal. They express the signal at a lower resolution as if the high frequencies had been removed Detail coefficients, ψ, are produced by applying the wavelet to the sampled signal. They express the higher frequency components in the signal. Thus a signal is represented as the sum of approximation and detail coefficients: Approx tell you what lower frequency components of the signal are yet to be analysed. Detail tels you the time-frequency representation of the current signal down to a certain band. Original signal is now the combination of its approximation at scale m0 and the detail coefficients from lower levels

Multi-Resolution Analysis, MRA

Haar example

DWT via Filtering Filter convolution : H (equivalent to wavelet) is high pass, stripping the signal of its lower band frequencies thus its coefficients represent high frequency components G (equivalent to scaling function) is a low pass, stripping the signal of its higher frequencies thus is passed on to the next scale to remove the next band of high frequency

DWT via Lifting Filters can be transformed in the time or frequency domain into distinct in-place processing steps on the signal rather than costly convolutions Expressing a wavelet in terms of lifting steps is know as a Second Generation Wavelet Here rather than low and high pass filters we perform a Prediction step and an Update step Prediction – high pass filter – we predict what the signal is Update – low pass filter – based on the prediction we update the signal

Lifting Shift even to Up odd to Predict- down sample - predict / detail coefficients – update / approximation coefficients

Haar Lifting example Take signal x(t) and split it into odd and even pairs As a prediction step take the odd away from the even: dj-1= oddj-P(evenj) As an update step take the mean value of the odd and even parts Sj-1=evenj+U(dj-1)

2D DWT Wavelets and scaling functions are orthogonal … hence separable. We can apply the transform in one direction then the other

Z-transform Fourier Series: Z-Transform: Convolution Shift Left Shift Right Down sample Up sample

Lifting to Polyphase Split: Prediction: Update:

Filters to Z-transform

Filter Results = Polyphase Lifting Lifting to Filters Filter Results = Polyphase Lifting

Further reading Boundary problems! Vanishing Moments! Wavelet packets Second generation wavelets Multiwavelets Curvelets, ridgelets …

Any Questions?