Multi-Resolution Analysis

Slides:



Advertisements
Similar presentations
Wavelet Transform A Presentation
Advertisements

Chapter 11 Signal Processing with Wavelets. Objectives Define and illustrate the difference between a stationary and non-stationary signal. Describe the.
University of Ioannina - Department of Computer Science Wavelets and Multiresolution Processing (Background) Christophoros Nikou Digital.
Lecture05 Transform Coding.
Multirate Digital Signal Processing
Chapter 12 Fourier Transforms of Discrete Signals.
Introduction to Wavelets
Systems: Definition Filter
Speech Signal Processing I Edmilson Morais and Prof. Greg. Dogil October, 25, 2001.
Chapter 4: Sampling of Continuous-Time Signals
FT Representation of DT Signals:
Copyright © Shi Ping CUC Chapter 3 Discrete Fourier Transform Review Features in common We need a numerically computable transform, that is Discrete.
Fourier representation for discrete-time signals And Sampling Theorem
Discrete-Time and System (A Review)
DTFT And Fourier Transform
Details, details… Intro to Discrete Wavelet Transform The Story of Wavelets Theory and Engineering Applications.
Fourier Series Summary (From Salivahanan et al, 2002)
Discrete Fourier Transform Prof. Siripong Potisuk.
Signals & systems Ch.3 Fourier Transform of Signals and LTI System 5/30/2016.
Lecture 7: Sampling Review of 2D Fourier Theory We view f(x,y) as a linear combination of complex exponentials that represent plane waves. F(u,v) describes.
1 Lecture 1: February 20, 2007 Topic: 1. Discrete-Time Signals and Systems.
Wavelets and Multiresolution Processing (Wavelet Transforms)
Fourier Analysis of Discrete Time Signals
Digital Signal Processing. Discrete Fourier Transform Inverse Discrete Fourier Transform.
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
. Fix-rate Signal Processing Fix rate filters - same number of input and output samples Filter x(n) 8 samples y(n) 8 samples y(n) = h(n) * x(n) Figure.
The Discrete Wavelet Transform for Image Compression Speaker: Jing-De Huang Advisor: Jian-Jiun Ding Graduate Institute of Communication Engineering National.
By Dr. Rajeev Srivastava CSE, IIT(BHU)
Sampling Rate Conversion by a Rational Factor, I/D
Fourier transform.
Lecture 18: The Discrete Fourier Transform Instructor: Dr. Ghazi Al Sukkar Dept. of Electrical Engineering The University of Jordan
Dr. Michael Nasief Digital Signal Processing Lec 7 1.
Husheng Li, UTK-EECS, Fall The specification of filter is usually given by the tolerance scheme.  Discrete Fourier Transform (DFT) has both discrete.
بسم الله الرحمن الرحيم Lecture (12) Dr. Iman Abuel Maaly The Discrete Fourier Transform Dr. Iman Abuel Maaly University of Khartoum Department of Electrical.
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Signals & systems Ch.3 Fourier Transform of Signals and LTI System
Wavelet Transform Advanced Digital Signal Processing Lecture 12
Multi-resolution image processing & Wavelet
Applications of Multirate Signal Processing
In summary If x[n] is a finite-length sequence (n0 only when |n|
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
Linear Constant-coefficient Difference Equations
DCT – Wavelet – Filter Bank
FFT-based filtering and the
Wavelets : Introduction and Examples
The Story of Wavelets Theory and Engineering Applications
Sampling rate conversion by a rational factor
Zhongguo Liu Biomedical Engineering
EE Audio Signals and Systems
Chapter 5 Z Transform.
Generalized sampling theorem (GST) interpretation of DSR
Multi-resolution analysis
Lecture 14 Digital Filtering of Analog Signals
Image Acquisition.
Changing the Sampling Rate
4.1 DFT In practice the Fourier components of data are obtained by digital computation rather than by analog processing. The analog values have to be.
Sampling the Fourier Transform
The Story of Wavelets Theory and Engineering Applications
Lecture 18 DFS: Discrete Fourier Series, and Windowing
Lecture 15 DTFT: Discrete-Time Fourier Transform
copyright Robert J. Marks II
Tania Stathaki 811b LTI Discrete-Time Systems in Transform Domain Ideal Filters Zero Phase Transfer Functions Linear Phase Transfer.
Chapter 9 Advanced Topics in DSP
Chapter 3 Sampling.
Concept of frequency in Discrete Signals & Introduction to LTI Systems
Digital Signal Processing
Wavelet Analysis Objectives: To Review Fourier Transform and Analysis
Review and Importance CS 111.
Fourier Transforms of Discrete Signals By Dr. Varsha Shah
Presentation transcript:

Multi-Resolution Analysis

Non-stationary Property of Natural Image

Pyramidal Image Structure

Z-transform The z-transform is the discrete time version of Laplace transform. Given a sequence {x(n)}, its z-transform is: In particular,

Z-Transform and Fourier Transform Discrete time Fourier transform (DTFT): Discrete Fourier Transform:

Frequency Domain Representation Discrete time Fourier transform (DTFT) Discrete Fourier Transform (DFT) Im{z} Re{z} Z-plane

Sub-sequence of a Finite Sequence Let x(n) = x(0) x(1) x(2) x(3) x(4) x(5) x(6) … x0(n) = x(0) 0 x(2) 0 x(4) 0 x(6) … x1(n) = 0 x(1) 0 x(3) 0 x(5) 0 … Then, clearly, x0(n) + x1(n) = x(n), and x0(n) = [x(n) + (-1)nx(n)]/2, x1(n) = [x(n) - (-1)nx(n)]/2 Denote X(z) to be the Z-transform of x(n), then

Z transform of a Sub-sequence Define Let WM =exp(j2/M), then One may write

Decimation (down-sample) M-fold decimator yk(n) = x(Mn+k) = xk(Mn+k) , 0  k  M-1 Example. M = 2. y0(n) = x(2n), y1(n) = x(2n+1),

Interpolation (up-sample) L-fold Expander Example. L = 2. {zL(n)} ={x(0), 0, x(1), 0, x(2), 0, …} and

Frequency Scaling X(jw) X(jw/2) X(j2w) -4p -2p 2p 4p -4p -2p 2p 4p -4p 2p 4p X(jw/2) -4p -2p 2p 4p X(j2w) -4p -2p 2p 4p

Frequency domain Interpretation In general, M-fold down-samples will stretch the spectrum M-times followed by a weighted sum. This may cause the aliasing effect. L-fold up-sample will compress the spectrum L times For M = 2, with decimation Note that For L = 2, with interpolation,

Two-band Sub-band Filter

Filter-banks + H0(z) H1(z) 2 x(n) v0(n) v1(n) G0(z) G1(z) 2 v0(n) y0(n) y1(n) G0(z) G1(z) 2 v0(n) v1(n) u0(n) u1(n) +

Frequency Response H0(z) H1(z) z-1 2 x(n) v0(n) v1(n) y0(n) y1(n)

Frequency Domain Interpretation |X(jw)|= |X(ejw)| w -2p -p p 2p |X(jw)Ho(jw)|=|X(j(w+2p))Ho(j(w+2p))|=|Y0(jw)| -2p -p p 2p w |X(jw/2)Ho(jw/2)|=|X(j(w+p)/2)Ho(j(w+p)/2)|=|V0(jw)| -2p -p p 2p w

Frequency Domain Interpretation |X(jw)|= |X(ejw)| w -2p -p p 2p |X(jw)H1(jw)|=|X(j(w+2p))H1(j(w+2p))|=|Y1(jw)| -2p -p p 2p w |X(jw/2)H1(jw/2)|=|X(j(w+p)/2)H1(j(w+p)/2)|=|V1(jw)| -2p -p p 2p w

Perfect Reconstruction Desired PR (perfect reconstruction) condition: Implies: It can be shown that H0(z): low pass filter, H1(z): high pass filter Usually, both are chosen to be FIR filters

Perfect Reconstruction Filter Families

2D Sub-band Filter 2-D four-band filter bank for sub-band image coding

Daubechie’s Orthogonal Filters

Sub-band Decomposition Example A 4-band split of the vase in fig.7.1 using sub-band coding system of Fig. 7.5

3-stage Forward DWT