Chapter 4: Image Enhancement in the Frequency Domain Chapter 4: Image Enhancement in the Frequency Domain.

Slides:



Advertisements
Similar presentations
Fourier Transform (Chapter 4)
Advertisements

1 Chapter 16 Fourier Analysis with MATLAB Fourier analysis is the process of representing a function in terms of sinusoidal components. It is widely employed.
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.
Properties of continuous Fourier Transforms
Digital Image Processing
Chapter 4 Image Enhancement in the Frequency Domain.
MSP15 The Fourier Transform (cont’) Lim, MSP16 The Fourier Series Expansion Suppose g(t) is a transient function that is zero outside the interval.
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.
Image Fourier Transform Faisal Farooq Q: How many signal processing engineers does it take to change a light bulb? A: Three. One to Fourier transform the.
Some Properties of the 2-D Fourier Transform Translation Distributivity and Scaling Rotation Periodicity and Conjugate Symmetry Separability Convolution.
Digital Image Processing Chapter 4: Image Enhancement in the Frequency Domain.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
CH#3 Fourier Series and Transform
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.
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
Motivation Music as a combination of sounds at different frequencies
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.
Fourier series. The frequency domain It is sometimes preferable to work in the frequency domain rather than time –Some mathematical operations are easier.
1 The Fourier Series for Discrete- Time Signals Suppose that we are given a periodic sequence with period N. The Fourier series representation for x[n]
: Chapter 14: The Frequency Domain 1 Montri Karnjanadecha ac.th/~montri Image Processing.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 19.
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.
Fourier Series. Introduction Decompose a periodic input signal into primitive periodic components. A periodic sequence T2T3T t f(t)f(t)
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Digital Image Processing Chapter 4 Image Enhancement in the Frequency Domain Part I.
Chapter 4 Fourier transform Prepared by Dr. Taha MAhdy.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Background Any function that periodically repeats itself.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
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.
Spatial Frequencies Spatial Frequencies. Why are Spatial Frequencies important? Efficient data representation Provides a means for modeling and removing.
CH#3 Fourier Series and Transform
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.
Fourier Transform.
DTFT continue (c.f. Shenoi, 2006)  We have introduced DTFT and showed some of its properties. We will investigate them in more detail by showing the associated.
CS 376b Introduction to Computer Vision 03 / 17 / 2008 Instructor: Michael Eckmann.
Dr. Abdul Basit Siddiqui FUIEMS. QuizTime 30 min. How the coefficents of Laplacian Filter are generated. Show your complete work. Also discuss different.
1 “Figures and images used in these lecture notes by permission, copyright 1997 by Alan V. Oppenheim and Alan S. Willsky” Signals and Systems Spring 2003.
Computer Graphics & Image Processing Chapter # 4 Image Enhancement in Frequency Domain 2/26/20161.
Frequency domain analysis and Fourier Transform
The Frequency Domain Digital Image Processing – Chapter 8.
Fourier transform.
Digital Image Processing Lecture 7: Image Enhancement in Frequency Domain-I Naveed Ejaz.
CH#3 Fourier Series and Transform 1 st semester King Saud University College of Applied studies and Community Service 1301CT By: Nour Alhariqi.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Integral Transform Method
MECH 373 Instrumentation and Measurements
Image Enhancement in the
Frequency Domain Processing
UNIT II Analysis of Continuous Time signal
ENG4BF3 Medical Image Processing
Image Processing, Leture #14
4. Image Enhancement in Frequency Domain
Chapter 8 The Discrete Fourier Transform
TIME SERIES ANALYSIS Time series – collection of observations in time: x( ti ) x( ti ) discrete time series with Δt Deterministic process: Can be predicted.
The Fourier Transform Jean Baptiste Joseph Fourier.
Chapter 8 The Discrete Fourier Transform
TIME SERIES ANALYSIS Time series – collection of observations in time: x( ti ) x( ti ) discrete time series with Δt Deterministic process: Can be predicted.
Chapter 8 The 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:

Chapter 4: Image Enhancement in the Frequency Domain Chapter 4: Image Enhancement in the Frequency Domain

Fundamentals Fourier: a periodic function can be represented by the sum of sines/cosines of different frequencies,multiplied by a different coefficient (Fourier series) Non-periodic functions can also be represented as the integral of sines/cosines multiplied by weighing function (Fourier transform)

Introduction to the Fourier Transform f(x): continuous function of a real variable x Fourier transform of f(x): where Eq. 1

Introduction to the Fourier Transform (u) is the frequency variable. The integral of Eq. 1 shows that F(u) is composed of an infinite sum of sine and cosine terms and… Each value of u determines the frequency of its corresponding sine-cosine pair.

Introduction to the Fourier Transform Given F(u), f(x) can be obtained by the inverse Fourier transform: The above two equations are the Fourier transform pair.

Introduction to the Fourier Transform Fourier transform pair for a function f(x,y) of two variables: and where u,v are the frequency variables.

Discrete Fourier Transform A continuous function f(x) is discretized into a sequence: by taking N or M samples  x units apart.

Discrete Fourier Transform Where x assumes the discrete values (0,1,2,3,…,M-1) then The sequence {f(0),f(1),f(2),…f(M-1)} denotes any M uniformly spaced samples from a corresponding continuous function.

Discrete Fourier Transform The discrete Fourier transform pair that applies to sampled functions is given by: For u=0,1,2,…,M-1 For x=0,1,2,…,M-1 and

Discrete Fourier Transform To compute F(u) we substitute u=0 in the exponential term and sum for all values of x We repeat for all M values of u It takes M*M summations and multiplications The Fourier transform and its inverse always exist! For u=0,1,2,…,M-1

Discrete Fourier Transform The values u = 0, 1, 2, …, M-1 correspond to samples of the continuous transform at values 0,  u, 2  u, …, (M-1)  u. i.e. F(u) represents F(u  u), where:

Details Each term of the FT (F(u) for every u) is composed of the sum of all values of f(x)

Introduction to the Fourier Transform The Fourier transform of a real function is generally complex and we use polar coordinates:

Introduction to the Fourier Transform |F(u)| (magnitude function) is the Fourier spectrum of f(x) and  (u) its phase angle. The square of the spectrum is referred to as the power spectrum of f(x) (spectral density).

Introduction to the Fourier Transform Fourier spectrum: Phase: Power spectrum:

Discrete Fourier Transform

In a 2-variable case, the discrete FT pair is: For u=0,1,2,…,M-1 and v=0,1,2,…,N-1 For x=0,1,2,…,M-1 and y=0,1,2,…,N-1 AND:

Discrete Fourier Transform Sampling of a continuous function is now in a 2-D grid (  x,  y divisions). The discrete function f(x,y) represents samples of the function f(x 0 +x  x,y 0 +y  y) for x=0,1,2,…,M-1 and y=0,1,2,…,N-1.

Discrete Fourier Transform When images are sampled in a square array, M=N and the FT pair becomes: For u,v=0,1,2,…,N-1 For x,y=0,1,2,…,N-1 AND: