Fourier Transform.

Slides:



Advertisements
Similar presentations
Computer Vision Lecture 7: The Fourier Transform
Advertisements

3-D Computational Vision CSc Image Processing II - Fourier Transform.
Fourier Transform (Chapter 4)
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.
Computer Graphics Recitation 6. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
Chapter 4 Image Enhancement in the Frequency Domain.
Chap 4-2. Frequency domain processing Jen-Chang Liu, 2006.
CSCE 641 Computer Graphics: Image Sampling and Reconstruction Jinxiang Chai.
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F(  ) is the spectrum of the function.
CSCE 641 Computer Graphics: Image Sampling and Reconstruction Jinxiang Chai.
Immagini e filtri lineari. Image Filtering Modifying the pixels in an image based on some function of a local neighborhood of the pixels
Digital Image Processing Chapter 4: Image Enhancement in the Frequency Domain.
Advanced Computer Graphics (Spring 2006) COMS 4162, Lecture 3: Sampling and Reconstruction Ravi Ramamoorthi
2D Fourier Theory for Image Analysis Mani Thomas CISC 489/689.
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.
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
2D Image Fourier Spectrum.
CSC589 Introduction to Computer Vision Lecture 8
CSC589 Introduction to Computer Vision Lecture 7 Thinking in Frequency Bei Xiao.
Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain.
Transforms. 5*sin (2  4t) Amplitude = 5 Frequency = 4 Hz seconds A sine wave.
Image Processing © 2002 R. C. Gonzalez & R. E. Woods Lecture 4 Image Enhancement in the Frequency Domain Lecture 4 Image Enhancement.
(Lecture #08)1 Digital Signal Processing Lecture# 8 Chapter 5.
Filtering Robert Lin April 29, Outline Why filter? Filtering for Graphics Sampling and Reconstruction Convolution The Fourier Transform Overview.
Part I: Image Transforms DIGITAL IMAGE PROCESSING.
09/19/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Dithering.
Digital Image Processing CSC331 Image Enhancement 1.
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.
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.
Image Processing Basics. What are images? An image is a 2-d rectilinear array of pixels.
Math 3360: Mathematical Imaging Prof. Ronald Lok Ming Lui Department of Mathematics, The Chinese University of Hong Kong Lecture 9: More about Discrete.
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.
02/05/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Mach Banding –Humans exaggerate sharp boundaries, but not fuzzy ones.
2D Sampling Goal: Represent a 2D function by a finite set of points.
1 CMPB 345: IMAGE PROCESSING DISCRETE TRANSFORM 2.
Fourier Transform.
Computer Graphics & Image Processing Chapter # 4 Image Enhancement in Frequency Domain 2/26/20161.
2D Fourier Transform.
The Frequency Domain Digital Image Processing – Chapter 8.
Digital Image Processing Lecture 8: Image Enhancement in Frequency Domain II Naveed Ejaz.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Miguel Tavares Coimbra
Jean Baptiste Joseph Fourier
Advanced Computer Graphics
Linear Filters and Edges Chapters 7 and 8
- photometric aspects of image formation gray level images
… Sampling … … Filtering … … Reconstruction …
Correlation and Convolution They replace the value of an image pixel with a combination of its neighbors Basic operations in images Shift Invariant Linear.
Linear Filters and Edges Chapters 7 and 8
Image Enhancement in the
Dr. Nikos Desypris, Oct Lecture 3
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F() is the spectrum of the function.
Fundamentals Data.
All about convolution.
ENG4BF3 Medical Image Processing
Linear system Convolution Linear Filter
2D Fourier transform is separable
CSCE 643 Computer Vision: Image Sampling and Filtering
CSCE 643 Computer Vision: Thinking in Frequency
4. Image Enhancement in Frequency Domain
HKN ECE 210 Exam 3 Review Session
Digital Image Procesing Unitary Transforms Discrete Fourier Trasform (DFT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
Digital Image Procesing Unitary Transforms Discrete Fourier Trasform (DFT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
Review and Importance CS 111.
Even Discrete Cosine Transform The Chinese University of Hong Kong
Presentation transcript:

Fourier Transform

Fourier Transform Any signal can be expressed as a linear combination of a bunch of sine gratings of different frequency Amplitude Phase

𝑆𝑖𝑛(𝑥) 1 3 𝑆𝑖𝑛(3𝑥)

𝑆𝑖𝑛 𝑥 + 1 3 sin⁡(3𝑥) 𝑆𝑖𝑛 𝑥 + 1 3 sin 3𝑥 + 1 5 sin⁡(5𝑥) 𝑆𝑖𝑛 𝑥 + 1 3 sin 3𝑥 + 1 5 sin 5𝑥 + 1 7 sin⁡(7𝑥) 𝑆𝑖𝑛 𝑥 + 1 3 sin 3𝑥 + 1 5 sin 5𝑥 + 1 7 sin 7𝑥 +…

Fourier Transform Input: infinite periodic signal Output: set of sine and cosine waves which together provide the input signal

Fourier Transform Digital Signals Hardly periodic Never infinite

Fourier Transform in 1D

Representation in Both Domains Frequency Domain 2 Amplitude 1 Frequency 180 Time Domain Phase Frequency

Discrete Fourier Transform DFT decomposes x into 𝑁 2 +1 cosine and sine waves Each of a different frequency

DFT - Rectangular Representation Decomposition of the time domain signal x to the frequency domain 𝑥 𝑐 and 𝑥 𝑠

Polar Notation Sine and cosine waves are phase shifted versions of each other Amplitude Phase

Polar Representation

Polar Representation Unwrapping of phase

Properties Homogeneity Additivity

Properties Linear phase shift

Symmetric Signals Symmetric signal always has zero phase

Symmetric Signals Frequency response and circular movement

Amplitude Modulation

Periodicity of Frequency Domain Amplitude Plot 𝑀 𝑓 =𝑀[−𝑓]

Periodicity of Frequency Domain Phase Plot 𝜃 𝑓 =−𝜃 −𝑓

Aliasing

Sampling – Frequency Domain Convolution f s 2 -f s 2 - f s f s 2 f s 3 f s - f s f s 2 f s 3 f s

Reconstruction – Frequency Domain - f s f s 2 f s 3 f s -f s 2 f s 2 Multiplication -f s 2 f s 2

Reconstruction (Wider Kernel) - f s f s 2 f s 3 f s -f s 2 f s 2 PIXELIZATION: Lower frequency aliased as high frequency -f s 2 f s 2

Reconstruction (Narrower Kernel) - f s f s 2 f s 3 f s -f s 2 f s 2 BLURRING: Removal of high frequencies -f s 2 f s 2

Aliasing artifacts (Right Width)

Wider Spots (Lost high frequencies)

Narrow Width (Jaggies, insufficient sampling)

DFT extended to 2D : Axes Frequency Orientation Only positive Orientation 0 to 180 Repeats in negative frequency Just as in 1D

Example

How it repeats? Just like in 1D For amplitude Even function for amplitude Odd function for phase For amplitude Flipped on the bottom

Why all the noise? Values much bigger than 255 DC is often 1000 times more than the highest frequencies Difficult to show all in only 255 gray values

Mapping Numerical value = i Gray value = g Linear Mapping is g = ki Logarithmic mapping is g = k log (i) Compresses the range Reduces noise May still need thresholding to remove noise

Example Original DFT Magnitude In Log scale Post Thresholding

Low Pass Filter Example

Additivity + Inverse DFT =

Nuances

Rotation What is this about?

X

X

More examples: Blurring Note energy reduced at higher frequencies What is direction of blur? Horizontal Noise also added DFT more noisy

More examples: Edges Two direction edges on left image Energy concentrated in two directions in DFT Multi-direction edges Note how energy concentration synchronizes with edge direction

More examples: Letters DFTs quite different Specially at low frequencies Bright lines perpendicular to edges Circular segments have circular shapes in DFT

More examples: Collections Concentric circle Due to pallets symmetric shape DFT of one pallet Similar Coffee beans have no symmetry Why the halo? Illumination

More examples: Natural Images Why the diagonal line in Lena? Strongest edge between hair and hat Why higher energy in higher frequencies in Mandril? Hairs

More examples Repeatation makes perfect periodic signal Spatial Repeatation makes perfect periodic signal Therefore perfect result perpendicular to it Frequency

More examples Spatial Just a gray telling all frequencies Why the bright white spot in the center? Frequency

Amplitude How much details? Sharper details signify higher frequencies Will deal with this mostly

Cheetah

Magnitude

Phase

Zebra

Magnitude

Phase

Reconstruction Cheetah Magnitude Zebra Phase

Reconstruction Zebra magnitude Cheetah phase

Uses – Notch Filter

Uses

Smoothing Box Filter

Smoothing Gaussian Filter