Image Processing, Leture #14

Slides:



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

Time Series II.
Fourier Transform (Chapter 4)
Frequency Domain The frequency domain
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.
DFT/FFT and Wavelets ● Additive Synthesis demonstration (wave addition) ● Standard Definitions ● Computing the DFT and FFT ● Sine and cosine wave multiplication.
Chapter Four Image Enhancement in the Frequency Domain.
1 LES of Turbulent Flows: Lecture 4 (ME EN ) Prof. Rob Stoll Department of Mechanical Engineering University of Utah Spring 2011.
Digital Image Processing
The Fourier Transform Jean Baptiste Joseph Fourier.
Chapter 4 Image Enhancement in the Frequency Domain.
The Fourier Transform Jean Baptiste Joseph Fourier.
The Fourier Transform Jean Baptiste Joseph Fourier.
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.
Chapter 4 Image Enhancement in the Frequency Domain.
Digital Image Processing Final Project Compression Using DFT, DCT, Hadamard and SVD Transforms Zvi Devir and Assaf Eden.
The Fourier Transform Jean Baptiste Joseph Fourier.
Time and Frequency Representation
DREAM PLAN IDEA IMPLEMENTATION Introduction to Image Processing Dr. Kourosh Kiani
Input image Output image Transform equation All pixels Transform equation.
Motivation Music as a combination of sounds at different frequencies
CSC589 Introduction to Computer Vision Lecture 7 Thinking in Frequency Bei Xiao.
Fourier series. The frequency domain It is sometimes preferable to work in the frequency domain rather than time –Some mathematical operations are easier.
Chapter 4: Image Enhancement in the Frequency Domain Chapter 4: Image Enhancement in the Frequency Domain.
: Chapter 14: The Frequency Domain 1 Montri Karnjanadecha ac.th/~montri Image Processing.
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.
Seismic Reflection Data Processing and Interpretation A Workshop in Cairo 28 Oct. – 9 Nov Cairo University, Egypt Dr. Sherif Mohamed Hanafy Lecturer.
Digital Image Processing Chapter 4 Image Enhancement in the Frequency Domain Part I.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Background Any function that periodically repeats itself.
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.
Part 4 Chapter 16 Fourier Analysis PowerPoints organized by Prof. Steve Chapra, University All images copyright © The McGraw-Hill Companies, Inc. Permission.
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.
Frequency Domain Processing Lecture: 3. In image processing, linear systems are at the heart of many filtering operations, and they provide the basis.
Fourier Transform.
CS 376b Introduction to Computer Vision 03 / 17 / 2008 Instructor: Michael Eckmann.
Image hole-filling. Agenda Project 2: Will be up tomorrow Due in 2 weeks Fourier – finish up Hole-filling (texture synthesis) Image blending.
The Frequency Domain Digital Image Processing – Chapter 8.
Fourier transform.
Digital Image Processing Lecture 7: Image Enhancement in Frequency Domain-I Naveed Ejaz.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
The content of lecture This lecture will cover: Fourier Transform
The Fourier Transform Jean Baptiste Joseph Fourier.
Image Enhancement and Restoration
Section II Digital Signal Processing ES & BM.
The Fourier Transform Jean Baptiste Joseph Fourier.
The Fourier Transform Jean Baptiste Joseph Fourier.
Image Enhancement in the
Frequency Domain Processing
ENG4BF3 Medical Image Processing
Frequency Domain Analysis
2D Fourier transform is separable
4. Image Enhancement in Frequency Domain
Image De-blurring Defying logic
Digital Image Processing
Applications of Frequency Domain Processing
I. Previously on IET.
1-D DISCRETE COSINE TRANSFORM DCT
The Fourier Transform Jean Baptiste Joseph Fourier.
The Fourier Transform Jean Baptiste Joseph Fourier.
Lecture 4 Image Enhancement in Frequency Domain
Discrete Fourier Transform
ENEE222 Elements of Discrete Signal Analysis Lab 9 1.
Applications of Frequency Domain Processing
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:

240-373 Image Processing, Leture #14 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 (number of times the wave repeats itself in a given length) p--phase (position that the wave starts) Usually phase is ignored in image processing 30/11/61 240-373 Image Processing, Leture #14

240-373 Image Processing, Leture #14 30/11/61 240-373 Image Processing, Leture #14

240-373 Image Processing, Leture #14 30/11/61 240-373 Image Processing, Leture #14

240-373 Image Processing, Leture #14 The Hartley Transform Discrete Hartley Transform (DHT) The M x N image is converted into a second image (also M x N) M and N should be power of 2 (e.g. .., 128, 256, 512, etc.) The basic transform depends on calculating the following for each pixel in the new M x N array where f(x,y) is the intensity of the pixel at position (x,y) H(u,v) is the value of element in frequency domain The results are periodic The cosine+sine (CAS) term is call “the kernel of the transformation” (or ”basis function”) Fast Hartley Transform (FHT) M and N must be power of 2 Much faster than DHT Equation: 30/11/61 240-373 Image Processing, Leture #14

240-373 Image Processing, Leture #14 The Fourier Transform The Furier transform Each element has real and imaginary values Formula: f(x,y) is point (x,y) in the original image and F(u,v) is the point (u,v) in the frequency image Discrete Fourier Transform (DFT) Imaginary part Real part The actual complex result is Fi(u,v) + Fr(u,v) 30/11/61 240-373 Image Processing, Leture #14

Fourier Power Spectrum and Inverse Fourier Transform Fast Fourier Transform (FFT) Much faster than DFT M and N must be power of 2 Computation is reduced from M2N2 to MN log2 M . log2 N (~1/1000 times) 30/11/61 240-373 Image Processing, Leture #14

Power and Autocorrelation functions Power function: Autocorrelation function Inverse Fourier transform of or Hartley transform of Interpretation of the power functions 30/11/61 240-373 Image Processing, Leture #14