Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.

Slides:



Advertisements
Similar presentations
Fourier Transform and its Application in Image Processing
Advertisements

Computer Vision Lecture 7: The Fourier Transform
Fourier Transform (Chapter 4)
Frequency Domain The frequency domain
Fourier Transform – Chapter 13. Image space Cameras (regardless of wave lengths) create images in the spatial domain Pixels represent features (intensity,
Chapter Four Image Enhancement in the Frequency Domain.
Chap 4 Image Enhancement in the Frequency Domain.
Computer Graphics Recitation 6. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
Reminder Fourier Basis: t  [0,1] nZnZ Fourier Series: Fourier Coefficient:
Chapter 4 Image Enhancement in the Frequency Domain.
Chap 4-2. Frequency domain processing Jen-Chang Liu, 2006.
The Fourier Transform Jean Baptiste Joseph Fourier.
Digital Image Processing Chapter 4: Image Enhancement in the Frequency Domain.
Image Enhancement in the Frequency Domain Part I Image Enhancement in the Frequency Domain Part I Dr. Samir H. Abdul-Jauwad Electrical Engineering Department.
Some Properties of the 2-D Fourier Transform Translation Distributivity and Scaling Rotation Periodicity and Conjugate Symmetry Separability Convolution.
Chapter 4 Image Enhancement in the Frequency Domain.
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
Fourier Transform 2D Discrete Fourier Transform - 2D
DREAM PLAN IDEA IMPLEMENTATION Introduction to Image Processing Dr. Kourosh Kiani
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
G52IIP, School of Computer Science, University of Nottingham 1 Image Transforms Fourier Transform Basic idea.
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Introduction to Image Processing
Fourier Series Summary (From Salivahanan et al, 2002)
Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain.
: Chapter 14: The Frequency Domain 1 Montri Karnjanadecha ac.th/~montri Image Processing.
Image Processing © 2002 R. C. Gonzalez & R. E. Woods Lecture 4 Image Enhancement in the Frequency Domain Lecture 4 Image Enhancement.
Image Enhancement in the Frequency Domain Spring 2006, Jen-Chang Liu.
1 Chapter 5 Image Transforms. 2 Image Processing for Pattern Recognition Feature Extraction Acquisition Preprocessing Classification Post Processing Scaling.
Part I: Image Transforms DIGITAL IMAGE PROCESSING.
Digital Image Processing Chapter 4 Image Enhancement in the Frequency Domain Part I.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Background Any function that periodically repeats itself.
ENG4BF3 Medical Image Processing Image Enhancement in Frequency Domain.
October 29, 2013Computer Vision Lecture 13: Fourier Transform II 1 The Fourier Transform In the previous lecture, we discussed the Hough transform. There.
7- 1 Chapter 7: Fourier Analysis Fourier analysis = Series + Transform ◎ Fourier Series -- A periodic (T) function f(x) can be written as the sum of sines.
Dr. Scott Umbaugh, SIUE Discrete Transforms.
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
Fourier Transform.
CS 376b Introduction to Computer Vision 03 / 17 / 2008 Instructor: Michael Eckmann.
 Introduction to reciprocal space
Dr. Abdul Basit Siddiqui FUIEMS. QuizTime 30 min. How the coefficents of Laplacian Filter are generated. Show your complete work. Also discuss different.
Computer Graphics & Image Processing Chapter # 4 Image Enhancement in Frequency Domain 2/26/20161.
Chapter 13 Discrete Image Transforms
Frequency domain analysis and Fourier Transform
BYST Xform-1 DIP - WS2002: Fourier Transform Digital Image Processing Bundit Thipakorn, Ph.D. Computer Engineering Department Fourier Transform and Image.
The Frequency Domain Digital Image Processing – Chapter 8.
Fourier transform.
The Fourier Transform.
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Jean Baptiste Joseph Fourier
Image Enhancement and Restoration
Image Enhancement in the
Dr. Nikos Desypris, Oct Lecture 3
Fourier Transform.
All about convolution.
Math Review CS474/674 – Prof. Bebis.
ENG4BF3 Medical Image Processing
Frequency Domain Analysis
2D Fourier transform is separable
Image Processing, Leture #14
4. Image Enhancement in Frequency Domain
Instructor: S. Narasimhan
The Fourier Transform Jean Baptiste Joseph Fourier.
Digital Image Procesing Unitary Transforms Discrete Fourier Trasform (DFT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
Fourier Transforms.
Digital Image Procesing Unitary Transforms Discrete Fourier Trasform (DFT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
Lecture 4 Image Enhancement in Frequency Domain
Discrete Fourier Transform
The Frequency Domain Any wave shape can be approximated by a sum of periodic (such as sine and cosine) functions. a--amplitude of waveform f-- frequency.
Presentation transcript:

Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis

Mathematical Background: Complex Numbers A complex number x is of the form: α: real part, b: imaginary part Addition: Multiplication:

Mathematical Background: Complex Numbers (cont’d) Magnitude-Phase (i.e., vector) representation: Magnitude: Phase: φ Magnitude-Phase notation:

Mathematical Background: Complex Numbers (cont’d) Multiplication using magnitude-phase representation Complex conjugate Properties

Mathematical Background: Complex Numbers (cont’d) Euler’s formula Properties j

Mathematical Background: Sine and Cosine Functions Periodic functions General form of sine and cosine functions: y(t)=Asin(αt+b) y(t)=Acos(αt+b)

Mathematical Background: Sine and Cosine Functions Special case: A=1, b=0, α=1 π π π/2 3π/2 period=2π

Mathematical Background: Sine and Cosine Functions (cont’d) Note: cosine is a shifted sine function: Changing the phase shift b:

Mathematical Background: Sine and Cosine Functions (cont’d) Changing the amplitude A:

Mathematical Background: Sine and Cosine Functions (cont’d) Changing the period T=2π/|α|: Asssume A=1, b=0: y=cos(αt) period 2π/4=π/2 shorter period higher frequency (i.e., oscillates faster) α =4 frequency is defined as f=1/T Alternative notation: cos(αt) or cos(2πt/T) or cos(t/T) or cos(2πft) or cos(ft)

Basis Functions Given a vector space of functions, S, then if any f(t) S can be expressed as the set of functions φ k (t) are called the expansion set of S. If the expansion is unique, the set φ k (t) is a basis.

Image Transforms Many times, image processing tasks are best performed in a domain other than the spatial domain. Key steps (1) Transform the image (2) Carry the task(s) in the transformed domain. (3) Apply inverse transform to return to the spatial domain.

Transformation Kernels Forward Transformation Inverse Transformation inverse transformation kernel forward transformation kernel

Kernel Properties A kernel is said to be separable if: A kernel is said to be symmetric if:

Fourier Series Theorem Any periodic function f(t) can be expressed as a weighted sum (infinite) of sine and cosine functions of varying frequency: is called the “fundamental frequency”

Fourier Series (cont’d) α1α1 α2α2 α3α3

Continuous Fourier Transform (FT) Transforms a signal (i.e., function) from the spatial (x) domain to the frequency (u) domain. where

Definitions F(u) is a complex function: Magnitude of FT (spectrum): Phase of FT: Magnitude-Phase representation: Power of f(x): P(u)=|F(u)| 2 =

Why is FT Useful? Easier to remove undesirable frequencies in the frequency domain. Faster to perform certain operations in the frequency domain than in the spatial domain.

Example: Removing undesirable frequencies remove high frequencies reconstructed signal frequencies noisy signal To remove certain frequencies, set their corresponding F(u) coefficients to zero!

How do frequencies show up in an image? Low frequencies correspond to slowly varying pixel intensities (e.g., continuous surface). High frequencies correspond to quickly varying pixel intensities (e.g., edges) Original Image Low-passed

Example of noise reduction using FT Input image Output image Spectrum (frequency domain) Band-reject filter

Frequency Filtering: Main Steps 1. Take the FT of f(x): 2. Remove undesired frequencies: 3. Convert back to a signal: We’ll talk more about these steps later.....

Example: rectangular pulse rect(x) functionsinc(x)=sin(x)/x magnitude

Example: impulse or “delta” function Definition of delta function: Properties:

Example: impulse or “delta” function (cont’d) FT of delta function: 1 u x

Example: spatial/frequency shifts Special Cases:

Example: sine and cosine functions FT of the cosine function cos(2πu 0 x) 1/2 F(u)

Example: sine and cosine functions (cont’d) FT of the sine function sin(2πu 0 x) jF(u)

Extending FT in 2D Forward FT Inverse FT

Example: 2D rectangle function FT of 2D rectangle function 2D sinc() top view

Discrete Fourier Transform (DFT)

Discrete Fourier Transform (DFT) (cont’d) Forward DFT Inverse DFT 1/(NΔx)

Example

Extending DFT to 2D Assume that f(x,y) is M x N. Forward DFT Inverse DFT:

Extending DFT to 2D (cont’d) Special case: f(x,y) is N x N. Forward DFT Inverse DFT u,v = 0,1,2, …, N-1 x,y = 0,1,2, …, N-1

Extending DFT to 2D (cont’d) 2D cos/sin functions Interpretation:

Visualizing DFT Typically, we visualize |F(u,v)| The dynamic range of |F(u,v)| is typically very large Apply streching: (c is const) before stretchingafter stretching original image |F(u,v)| |D(u,v)|

DFT Properties: (1) Separability The 2D DFT can be computed using 1D transforms only: Forward DFT: kernel is separable:

DFT Properties: (1) Separability (cont’d) Rewrite F(u,v) as follows: Let’s set: Then:

How can we compute F(x,v)? How can we compute F(u,v)? DFT Properties: (1) Separability (cont’d) ) N x DFT of rows of f(x,y) DFT of cols of F(x,v)

DFT Properties: (1) Separability (cont’d)

DFT Properties: (2) Periodicity The DFT and its inverse are periodic with period N

DFT Properties: (3) Symmetry

DFT Properties: (4) Translation f(x,y) F(u,v) ) N Translation in spatial domain: Translation in frequency domain:

DFT Properties: (4) Translation (cont’d) To show a full period, we need to translate the origin of the transform at u=N/2 (or at (N/2,N/2) in 2D) |F(u-N/2)| |F(u)|

DFT Properties: (4) Translation (cont’d) To move F(u,v) at (N/2, N/2), take ) N ) N

DFT Properties: (4) Translation (cont’d) no translation after translation sinc

DFT Properties: (5) Rotation Rotating f(x,y) by θ rotates F(u,v) by θ

DFT Properties: (6) Addition/Multiplication but …

DFT Properties: (7) Scale

DFT Properties: (8) Average value So: Average: F(u,v) at u=0, v=0:

Magnitude and Phase of DFT What is more important? Hint: use the inverse DFT to reconstruct the input image using only magnitude or phase information magnitude phase

Magnitude and Phase of DFT (cont’d) Reconstructed image using magnitude only (i.e., magnitude determines the strength of each component) Reconstructed image using phase only (i.e., phase determines the phase of each component)

Magnitude and Phase of DFT (cont’d) only phase only magnitudephase (woman) magnitude (rectangle) phase (rectangle) magnitude (woman)