Presentation is loading. Please wait.

Presentation is loading. Please wait.

Md Shiplu Hawlader Roll: SH-224.  Fourier Series Theorem  Fourier Transform  Discrete Fourier Transform  Fast Fourier Transform.

Similar presentations


Presentation on theme: "Md Shiplu Hawlader Roll: SH-224.  Fourier Series Theorem  Fourier Transform  Discrete Fourier Transform  Fast Fourier Transform."— Presentation transcript:

1 Md Shiplu Hawlader Roll: SH-224

2  Fourier Series Theorem  Fourier Transform  Discrete Fourier Transform  Fast Fourier Transform

3 Any periodic function can be expressed as a weighted sum (infinite) of sine and cosine functions of varying frequency

4

5  Transforms a signal (i.e., function) from the spatial domain to the frequency domain. where

6

7  Forward DFT  Inverse DFT

8  Typically, we visualize |F(u,v)|  The dynamic range of |F(u,v)| is typically very large  Apply stretching: (c is const) original image before scalingafter scaling

9 magnitude phase

10 Reconstructed image using magnitude only (i.e., magnitude determines the contribution of each component!) Reconstructed image using phase only (i.e., phase determines which components are present!)

11  Easier to remove undesirable frequencies.  Faster perform certain operations in the frequency domain than in the spatial domain.

12 noisy signal frAequencies remove high frequencies reconstructed signal To remove certain frequencies, set their corresponding F(u) coefficients to zero!

13  Low frequencies correspond to slowly varying information (e.g., continuous surface).  High frequencies correspond to quickly varying information (e.g., edges) Original Image Low-passed

14

15 1. Take the FT of f(x): 2. Remove undesired frequencies: 3. Convert back to a signal:

16  The FFT is an efficient algorithm for computing the DFT  The FFT is based on the divide-and-conquer paradigm:  If n is even, we can divide a polynomial into two polynomials and we can write

17 The running time is O(n log n)

18 Fourier Transform has multitude of applications in all the field of engineering but has a tremendous contribution in image processing fields like image enhancement and restoration.

19  Image Processing, Analysis and Machine Vision, chapter Chapman and Hall, 1993  The Image Processing Handbook, chapter 4. CRC Press, 1992  Fundamentals of Electronic Image Processing, chapter 8.4. IEEE Press, 1996  rm rm

20


Download ppt "Md Shiplu Hawlader Roll: SH-224.  Fourier Series Theorem  Fourier Transform  Discrete Fourier Transform  Fast Fourier Transform."

Similar presentations


Ads by Google