00:00

Understanding Frequency Filtering in Digital Image Processing

Fourier Series and Fourier Transform are essential concepts in digital image processing for analyzing and filtering images based on their frequency components. This lecture covers the principles behind Fourier Series, Fourier Transform, frequency spectra, and the steps involved in frequency filtering to remove undesired frequencies from images. The transformation of images into frequency space enables the separation of low and high-frequency components, which correspond to different features within the image.

quimbita
Download Presentation

Understanding Frequency Filtering in Digital Image Processing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Lecture #6 Digital Image Processing Frequency Filtering 1stSemester 2019-2020 Dr. Abdulhussein Mohsin Abdullah Computer Science Dept., CS & IT College, Basrah Univ.

  2. Fourier Series & The Fourier Transform Fourier Series & The Fourier Transform • Fourier Series Any periodic function can be expressed as the sum of sines and /or cosines of different frequencies, each multiplied by a different coefficients • Fourier Transform Any function that is not periodic can be expressed as the integral of sines and /or cosines multiplied by a weighing function Joseph Fourier 1768-1830

  3. Periodic Functions Periodic Functions       f A function if it is defined for all real   and if there is some positive number, is periodic T such that     f         f     T f    0  T

  4. Fourier Series Fourier Series       f The function can be represented by a trigonometric series as:         n What kind of trigonometric (series) functions are we talking about?   2 be a periodic function with period         n       n     n   f a a b cos sin n n 0 1 1   2  3 cos , cos , cos and    2  3 sin , sin , sin 

  5. 0  2 0 cos  cos 2 cos 3

  6. 0  2 0 sin  sin 2 sin 3

  7. A plane wave with a single frequency

  8. Adding a second plane wave at a different frequency results in an intensity modulation as a function of time.

  9. Time and Frequency • example : g(t) = sin(2pi f t) + (1/3)sin(2pi (3f) t)

  10. Time and Frequency • example : g(t) = sin(2pi f t) + (1/3)sin(2pi (3f) t) = +

  11. Frequency Spectra • example : g(t) = sin(2pi f t) + (1/3)sin(2pi (3f) t) = +

  12. What happens when the function is not periodic? When you add a discrete amount of harmonic waves, the resulting function always repeats at the fundamental (lowest) frequency in the series: So how do you find the spectrum for the more general case of a nonperiodic function that exists from -∞ to ∞? Answer: replace the discrete sum by an integral over a continuous range of frequencies: ¥ ¥ò å f (t)=1 f (t)=1 Þ F(w)exp(iwt) dw Fm''exp(imt) p 2p -¥ m=0 Note that m is integer, while ω can have any (real) value

  13. The Fourier Transform The Fourier Transform ¥ò Fourier Transform F(w) = f (t) exp(-iwt) dt F(w w) f(x) -¥ ¥ò Inverse Fourier Transform 1 F(w w) f(x) = F(w) exp(iwt) dw f (t) 2p -¥ These transformations allow you to calculate the frequency dependence F(ω) of a time domain function f(t), and vice versa. There are different definitions of these transforms. The 2π can occur in several places, but the idea is generally the same.

  14. Frequency Filtering: Main Steps 1. Take the FT of f(x): 2. Remove undesired frequencies: 3. Convert back to a signal:

  15. Example: Example: Removing undesirable frequencies frequencies noisy signal remove high frequencies reconstructed signal

  16. 2D Fourier transform 2D Fourier transform

  17. 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

  18. 1D FT

  19. 1D FT

  20. Why do we transform images?  Images can be analyzed in different kinds of spaces  The purpose is not to complicate the information but change the way we view the information •For example, two can be represented as 1+1, 2cos(0), 2sin(pi/2), 2*1, sqrt(4)  There are various types of transformations •Discrete Cosine Transform, Fourier Transform, Discrete Wavelet transform, and etc.

  21.  The equation for a 2-D Fourier Transform is:  The Inverse Fourier Transform

  22. How to interpret Fourier Space? •The Fourier Spectra shows both low and high frequency components  Low frequencies are near the origin  High frequencies are away from the origin

  23. Centered spectra • It is useful to visualize a centered spectrum with the origin of the coordinate system (0, 0) in the middle of the spectrum. • Assume the original spectrum is divided into four quadrants. The small gray-filled squares in the corners represent positions of low frequencies. • Due to the symmetries of the spectrum the quadrant positions can be swapped diagonally and the low frequencies locations appear in the middle of the image.

  24. Filtering in frequency domain  Filtration in the frequency domain. Conversion to the ‘frequency domain’, filtration there, and the conversion back.

  25. n m Cos (18?n/256) Cos (50?n/256) Cos (18?m/256) Cos (50?m/256) u=18?n/256, v=0 u=50?n/256, v=0 u=0, v= 18?n/256 u=0, v= 50?n/256 v Cos (50?n/256)Cos (18?n/256) u u=18?n/256, v= 50?n/256

  26. |F(u, v)| |F(u, v)| −? f(m, n) 0 u 0 m n ? ?? v −? ? 0 ?? 0

More Related