Top Banner
Abhishek Pachisia B.Tech – I.T. 090102801 Fourier Transform of an Image
13
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: Fourier transform

Abhishek PachisiaB.Tech – I.T.090102801

Fourier Transform of an Image

Page 2: Fourier transform

Foreword – Image Processing

₤ Image╬ A representation of the external form of a person or

thing in sculpture, painting, etc.

₤ Image Processing╬ The analysis and manipulation of a digitized image, esp.

in order to improve its quality.╬ Study of any algorithm

Input OutputImage

Page 3: Fourier transform

Foreword – Frequency Domain

₤ The rate at which image intensity values are changing in the image

₤ Its domain over which values of F(u) range.u Freq. of component of Transform

₤ Steps:╬ Transform the image to its frequency representation╬ Perform image processing╬ Compute inverse transform.

Page 4: Fourier transform

Foreword – Fourier Transform

₤ Decompose an image into its sine & cosine components.

₤ Sinusoidal variations in brightness across the image.₤ Each point represents a particular frequency contained

in the spatial domain image.

Spatial Domain Freq. Domain (Input) (Output)

₤ Applications╬ Image analysis,╬ Image filtering, ╬ Image reconstruction ╬ Image compression.

Page 5: Fourier transform

Fourier Transform – 1 D

₤ Functions that are NOT periodic BUT with finite area under the curve can be expressed as the integral of sine's and/or cosines multiplied by a weight function

₤ The Fourier transform for f(x) exists iff╬ f(x) is piecewise continuous on every finite interval╬ f(x) is absolutely integrable

Page 6: Fourier transform

Discrete Fourier Transform

₤ Fourier Series is the origin.₤ The DFT is the sampled Fourier Transform₤ 2-D DFT of N*N matrix :

₤ Complexity of 1-D DFT is N2.

₤ Sufficiently accurate

Page 7: Fourier transform

Freq. Domain Procedure

₤ Multiply the input image by (-1)x+y to center the transform

₤ Compute the DFT F(u,v) of the resulting image₤ Multiply F(u,v) by a filter G(u,v)₤ Computer the inverse DFT transform h*(x,y)₤ Obtain the real part h(x,y) of 4₤ Multiply the result by (-1)x+y

Page 8: Fourier transform

Example – 1(i)₤ Sinusoidal pattern Single Fourier

term that encodes ╬ The spatial frequency, ╬ The magnitude (positive or negative),╬ The phase.

Page 9: Fourier transform

Example – 1(ii)₤ The spatial frequency,

╬ Frequency across space

₤ The magnitude (positive or negative),╬ Corresponds to its contrast╬  A negative magnitude represents a contrast-

reversal, i.e. the bright become dark, and vice-versa

₤ The phase.╬ How the wave is shifted relative to the origin

Page 10: Fourier transform

Example - 2

 Original

 Magnitude

 Phase

Plausibility

Page 11: Fourier transform

Magnitude 

Phase

Example - Reconstruct

Page 12: Fourier transform

Brightness Image

Fourier Transform

Inverse Transformed

Example - 3

Page 13: Fourier transform

ThankYou