Spatial Frequencies Spatial Frequencies. Why are Spatial Frequencies important? Efficient data representation Provides a means for modeling and removing.

Slides:



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

Time Series II.
Digital Kommunikationselektronik TNE027 Lecture 5 1 Fourier Transforms Discrete Fourier Transform (DFT) Algorithms Fast Fourier Transform (FFT) Algorithms.
Ch.4 Fourier Analysis of Discrete-Time Signals
Lecture 7: Basis Functions & Fourier Series
Fourier Series 主講者:虞台文.
Fourier Analysis. Joseph Fourier ( ) “Yesterday was my 21st birthday, and at that age, Newton and Pascal had already acquired many claims to immortality.”
Engineering Mathematics Class #15 Fourier Series, Integrals, and Transforms (Part 3) Sheng-Fang Huang.
Fourier Integrals For non-periodic applications (or a specialized Fourier series when the period of the function is infinite: L  ) L -L L  -L  - 
Techniques in Signal and Data Processing CSC 508 Frequency Domain Analysis.
Fourier Transform (Chapter 4)
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.
Math Review with Matlab:
Chap 4 Image Enhancement in the Frequency Domain.
Noise. Noise is like a weed. Just as a weed is a plant where you do not wish it to be, noise is a signal where you do not wish it to be. The noise signal.
Methods for Digital Image Processing
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.
Time and Frequency Representation
Unit 7 Fourier, DFT, and FFT 1. Time and Frequency Representation The most common representation of signals and waveforms is in the time domain Most signal.
Input image Output image Transform equation All pixels Transform equation.
Discrete Time Periodic Signals A discrete time signal x[n] is periodic with period N if and only if for all n. Definition: Meaning: a periodic signal keeps.
The Frequency Domain Sinusoidal tidal waves Copy of Katsushika Hokusai The Great Wave off Kanagawa at
Function approximation: Fourier, Chebyshev, Lagrange
G52IIP, School of Computer Science, University of Nottingham 1 Image Transforms Fourier Transform Basic idea.
Motivation Music as a combination of sounds at different frequencies
Image Processing Fourier Transform 1D Efficient Data Representation Discrete Fourier Transform - 1D Continuous Fourier Transform - 1D Examples.
The Discrete Fourier Transform. The Fourier Transform “The Fourier transform is a mathematical operation with many applications in physics and engineering.
Fourier Series Summary (From Salivahanan et al, 2002)
1 Spatial Frequency or How I learned to love the Fourier Transform Jean Baptiste Joseph Fourier.
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 4: Image Enhancement in the Frequency Domain Chapter 4: Image Enhancement in the Frequency Domain.
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.
Fourier Analysis of Discrete Time Signals
Extends Euclidean space algebra to higher dimensions
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.
H.Melikyan/12001 Inverse Trigonometric Functions.
Math Review Towards Fourier Transform
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
Fourier series, Discrete Time Fourier Transform and Characteristic functions.
Fourier Transform.
CS 376b Introduction to Computer Vision 03 / 17 / 2008 Instructor: Michael Eckmann.
 Introduction to reciprocal space
CS654: Digital Image Analysis Lecture 22: Image Restoration.
Environmental and Exploration Geophysics II tom.h.wilson
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
The Frequency Domain Digital Image Processing – Chapter 8.
Fourier transform.
The Fourier Transform.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
Convergence of Fourier series It is known that a periodic signal x(t) has a Fourier series representation if it satisfies the following Dirichlet conditions:
Fourier series. Examples Fourier Transform The Fourier transform is a generalization of the complex Fourier series in the limit complexFourier series.
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Section II Digital Signal Processing ES & BM.
Lecture 1.26 Spectral analysis of periodic and non-periodic signals.
Chapter 2. Fourier Representation of Signals and Systems
ENG4BF3 Medical Image Processing
Fourier Integrals For non-periodic applications (or a specialized Fourier series when the period of the function is infinite: L) -L L -L- L
Image Processing, Leture #14
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
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:

Spatial Frequencies Spatial Frequencies

Why are Spatial Frequencies important? Efficient data representation Provides a means for modeling and removing noise Physical processes are often best described in “frequency domain” Provides a powerful means of image analysis

What is spatial frequency? Instead of describing a function (i.e., a shape) by a series of positions It is described by a series of cosines

What is spatial frequency? A g(x) = A cos(x) 22 x g(x)

What is spatial frequency? Period (L) Wavelength ( ) Frequency f=(1/ ) Amplitude (A) Magnitude (A) A cos(x  2  /L) g(x) = A cos(x  2  / ) A cos(x  2  f) x g(x)

What is spatial frequency? A g(x) = A cos(x  2  f) x g(x) (1/f) period

But what if cosine is shifted in phase? g(x) = A cos(x  2  f +  ) x g(x) 

What is spatial frequency? g(x) = A cos(x  2  f +  ) A=2 m f = 0.5 m -1 = 0.25  = 45  g(x) = 2 cos(x  2  (0.5)  ) 2 cos(x    ) x g(x) cos(0.25  ) = cos(0.50  ) = cos(0.75  ) = cos(1.00  ) = cos(1.25  ) = … cos(1.50  ) = cos(1.75  ) = cos(2.00  ) = cos(2.25  ) = Let us take arbitrary g(x) We substitute values of A, f and  We calculate discrete values of g(x) for various values of x

What is spatial frequency? g(x) = A cos(x  2  f +  ) x g(x) We calculate discrete values of g(x) for various values of x

What is spatial frequency? g(x) = A cos(x  2  f +  ) g i (x) = A i cos(x  2  i/N +  i ), i = 0,1,2,3,…,N/2-1

We try to approximate a periodic function with standard trivial (orthogonal, base) functions + + = Low frequency Medium frequency High frequency

We add values from component functions point by point + + =

g(x)g(x) i=1 i=2 i=3 i=4 i=5 i= x Example of periodic function created by summing standard trivial functions

g(x)g(x) i=1 i=2 i=3 i=4 i=5 i= x Example of periodic function created by summing standard trivial functions

g(x)g(x) g(x)g(x) 64 terms 10 terms Example of periodic function created by summing standard trivial functions

g(x)g(x) i=1 i=2 i=3 i=4 i=5 i= x Fourier Decomposition of a step function (64 terms) Example of periodic function created by summing standard trivial functions

g(x)g(x) i=1 i=2 i=3 i=4 i=5 i= x Fourier Decomposition of a step function (11 terms) Example of periodic function created by summing standard trivial functions

Main concept – summation of base functions Any function of x (any shape) that can be represented by g(x) can also be represented by the summation of cosine functions Observe two numbers for every i

Information is not lost when we change the domain g i (x) = 1.3, 2.1, 1.4, 5.7, …., i=0,1,2…N-1 N pieces of information N/2 amplitudes (A i, i=0,1,…,N/2-1) and N/2 phases (  i, i=0,1,…,N/2-1) and Spatial Spatial Domain Frequency Domain

What is spatial frequency? g i (x) Are equivalent They contain the same amount of information and The sequence of amplitudes squared is the SPECTRUM Information is not lost when we change the domain

EXAMPLE

A cos(x  2  i/N) frequency (f) = i/N wavelength (p) = N/I N=512 i f p 0 0 infinite 1 1/ / /2 2 Substitute values Assuming N we get this table which relates frequency and wavelength of component functions

More examples to give you some intuition ….

Fourier Transform Notation g(x) denotes an spatial domain function of real numbers –(1.2, 0.0), (2.1, 0.0), (3.1,0.0), … G() denotes the Fourier transform G() is a symmetric complex function (-3.1,0.0), (4.1, -2.1), (-3.1, 2.1), …(1.2,0.0) …, (-3.1,-2.1), (4.1, 2.1), (-3.1,0.0) G[g(x)] = G(f) is the Fourier transform of g(x) G -1 () denotes the inverse Fourier transform G -1 (G(f)) = g(x)

Power Spectrum and Phase Spectrum |G(f)| 2 = G(f)  G(f)* is the power spectrum of G(f) –(-3.1,0.0), (4.1, -2.1), (-3.1, 2.1), … (1.2,0.0),…, (-3.1,-2.1), (4.1, 2.1) –9.61, 21.22, 14.02, …, 1.44,…, 14.02, tan -1 [Im(G(f))/Re(G(f))] is the phase spectrum of G(f) –0.0, , , …, 0.0, , complex Complex conjugate

1-D DFT and IDFT 1-D DFT and IDFT Discrete Domains –Discrete Time: k = 0, 1, 2, 3, …………, N-1 –Discrete Frequency:n = 0, 1, 2, 3, …………, N-1 Discrete Fourier Transform Inverse DFT Equal time intervals Equal frequency intervals n = 0, 1, 2,….., N-1 k = 0, 1, 2,….., N-1