EE 7730 2D Fourier Transform. Bahadir K. Gunturk EE 7730 - Image Analysis I 2 Summary of Lecture 2 We talked about the digital image properties, including.

Slides:



Advertisements
Similar presentations
Continuous-Time Fourier Transform
Advertisements

Signal Processing in the Discrete Time Domain Microprocessor Applications (MEE4033) Sogang University Department of Mechanical Engineering.
Computer Vision Lecture 7: The Fourier Transform
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Response to a Sinusoidal Input Frequency Analysis of an RC Circuit.
Symmetry and the DTFT If we know a few things about the symmetry properties of the DTFT, it can make life simpler. First, for a real-valued sequence x(n),
Lecture 7: Basis Functions & Fourier Series
Fourier Transform (Chapter 4)
Fourier Transform – Chapter 13. Fourier Transform – continuous function Apply the Fourier Series to complex- valued functions using Euler’s notation to.
EE D Discrete Fourier Transform (DFT). Bahadir K. Gunturk2 2D Discrete Fourier Transform 2D Fourier Transform 2D Discrete Fourier Transform (DFT)
Review of Frequency Domain
EECS 20 Chapter 10 Part 11 Fourier Transform In the last several chapters we Viewed periodic functions in terms of frequency components (Fourier series)
Sep 15, 2005CS477: Analog and Digital Communications1 Modulation and Sampling Analog and Digital Communications Autumn
Advanced Computer Graphics (Spring 2006) COMS 4162, Lecture 3: Sampling and Reconstruction Ravi Ramamoorthi
Autumn Analog and Digital Communications Autumn
Lecture 9: Fourier Transform Properties and Examples
Advanced Computer Graphics (Spring 2005) COMS 4162, Lecture 3: Sampling and Reconstruction Ravi Ramamoorthi
Leo Lam © Signals and Systems EE235. Transformers Leo Lam ©
EE D Fourier Transform.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
Systems: Definition Filter
Leo Lam © Signals and Systems EE235. Leo Lam © Fourier Transform Q: What did the Fourier transform of the arbitrary signal say to.
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 3 Ravi Ramamoorthi
Speech Signal Processing I Edmilson Morais and Prof. Greg. Dogil October, 25, 2001.
Goals For This Class Quickly review of the main results from last class Convolution and Cross-correlation Discrete Fourier Analysis: Important Considerations.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm.
… Representation of a CT Signal Using Impulse Functions
G52IIP, School of Computer Science, University of Nottingham 1 Image Transforms Fourier Transform Basic idea.
Discrete-Time and System (A Review)
EE421, Fall 1998 Michigan Technological University Timothy J. Schulz 08-Sept, 98EE421, Lecture 11 Digital Signal Processing (DSP) Systems l Digital processing.
Signals and Systems Jamshid Shanbehzadeh.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Linearity Time Shift and Time Reversal Multiplication Integration.
Image Processing © 2002 R. C. Gonzalez & R. E. Woods Lecture 4 Image Enhancement in the Frequency Domain Lecture 4 Image Enhancement.
(Lecture #08)1 Digital Signal Processing Lecture# 8 Chapter 5.
1 Chapter 5 Ideal Filters, Sampling, and Reconstruction Sections Wed. June 26, 2013.
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, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Background Any function that periodically repeats itself.
Notice  HW problems for Z-transform at available on the course website  due this Friday (9/26/2014) 
Lecture 7: Sampling Review of 2D Fourier Theory We view f(x,y) as a linear combination of complex exponentials that represent plane waves. F(u,v) describes.
Linearity Recall our expressions for the Fourier Transform and its inverse: The property of linearity: Proof: (synthesis) (analysis)
Fundamentals of Digital Signal Processing. Fourier Transform of continuous time signals with t in sec and F in Hz (1/sec). Examples:
Leo Lam © Signals and Systems EE235 Leo Lam.
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
Digital Signal Processing
Fourier Transform.
Image Enhancement (Frequency Domain)
2D Fourier Transform.
Leo Lam © Signals and Systems EE235 Lecture 26.
The Frequency Domain Digital Image Processing – Chapter 8.
Fourier transform.
The Fourier Transform.
Computer Vision – 2D Signal & System Hanyang University Jong-Il Park.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Advanced Computer Graphics
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Digital Signal Processing Lecture 4 DTFT
Image Enhancement in the
Chapter 2. Fourier Representation of Signals and Systems
Outline Linear Shift-invariant system Linear filters
EE 638: Principles of Digital Color Imaging Systems
2D Discrete Cosine Transform
Outline Linear Shift-invariant system Linear filters
2D Discrete Fourier Transform (DFT)
6. Time and Frequency Characterization of Signals and Systems
Lecture 5: Phasor Addition & Spectral Representation
Chapter 3 Sampling.
Digital Signal Processing
Discrete Fourier Transform
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Presentation transcript:

EE D Fourier Transform

Bahadir K. Gunturk EE Image Analysis I 2 Summary of Lecture 2 We talked about the digital image properties, including spatial resolution and grayscale resolution. We reviewed linear systems and related concepts, including shift invariance, causality, convolution, etc.

Bahadir K. Gunturk EE Image Analysis I 3 Fourier Transform What is ahead?  1D Fourier Transform of continuous signals  2D Fourier Transform of continuous signals  2D Fourier Transform of discrete signals  2D Discrete Fourier Transform (DFT)

Bahadir K. Gunturk EE Image Analysis I 4 Fourier Transform: Concept ■ A signal can be represented as a weighted sum of sinusoids. ■ Fourier Transform is a change of basis, where the basis functions consist of sines and cosines.

Bahadir K. Gunturk EE Image Analysis I 5 Fourier Transform Cosine/sine signals are easy to define and interpret. However, it turns out that the analysis and manipulation of sinusoidal signals is greatly simplified by dealing with related signals called complex exponential signals. A complex number: z = x + j*y A complex exponential signal: r*exp(j*a) =r*cos(a) + j*r*sin(a)

Bahadir K. Gunturk EE Image Analysis I 6 Fourier Transform: 1D Cont. Signals ■ Fourier Transform of a 1D continuous signal ■ Inverse Fourier Transform “Euler’s formula”

Bahadir K. Gunturk EE Image Analysis I 7 Fourier Transform: 2D Cont. Signals ■ Fourier Transform of a 2D continuous signal ■ Inverse Fourier Transform ■ F and f are two different representations of the same signal.

Bahadir K. Gunturk EE Image Analysis I 8 Examples Magnitude: “how much” of each component Phase: “where” the frequency component in the image

Bahadir K. Gunturk EE Image Analysis I 9 Examples

Bahadir K. Gunturk EE Image Analysis I 10 Fourier Transform: Properties ■ Linearity ■ Shifting ■ Modulation ■ Convolution ■ Multiplication ■ Separable functions

Bahadir K. Gunturk EE Image Analysis I 11 Fourier Transform: Properties ■ Separability 2D Fourier Transform can be implemented as a sequence of 1D Fourier Transform operations.

Bahadir K. Gunturk EE Image Analysis I 12 Fourier Transform: Properties ■ Energy conservation

Bahadir K. Gunturk EE Image Analysis I 13 Fourier Transform: Properties ■ Remember the impulse function (Dirac delta function) definition ■ Fourier Transform of the impulse function

Bahadir K. Gunturk EE Image Analysis I 14 Fourier Transform: Properties ■ Fourier Transform of 1 Take the inverse Fourier Transform of the impulse function

Bahadir K. Gunturk EE Image Analysis I 15 Fourier Transform: 2D Discrete Signals ■ Fourier Transform of a 2D discrete signal is defined as where ■ Inverse Fourier Transform

Bahadir K. Gunturk EE Image Analysis I 16 Fourier Transform: Properties ■ Periodicity: Fourier Transform of a discrete signal is periodic with period Arbitrary integers

Bahadir K. Gunturk EE Image Analysis I 17 Fourier Transform: Properties ■ Linearity, shifting, modulation, convolution, multiplication, separability, energy conservation properties also exist for the 2D Fourier Transform of discrete signals.

Bahadir K. Gunturk EE Image Analysis I 18 Fourier Transform: Properties ■ Linearity ■ Shifting ■ Modulation ■ Convolution ■ Multiplication ■ Separable functions ■ Energy conservation

Bahadir K. Gunturk EE Image Analysis I 19 Fourier Transform: Properties ■ Define Kronecker delta function ■ Fourier Transform of the Kronecker delta function

Bahadir K. Gunturk EE Image Analysis I 20 Fourier Transform: Properties ■ Fourier Transform of 1 To prove: Take the inverse Fourier Transform of the Dirac delta function and use the fact that the Fourier Transform has to be periodic with period 1.

Bahadir K. Gunturk EE Image Analysis I 21 Impulse Train ■ Define a comb function (impulse train) as follows where M and N are integers

Bahadir K. Gunturk EE Image Analysis I 22 Impulse Train Fourier Transform of an impulse train is also an impulse train:

Bahadir K. Gunturk EE Image Analysis I 23 Impulse Train

Bahadir K. Gunturk EE Image Analysis I 24 Impulse Train In the case of continuous signals:

Bahadir K. Gunturk EE Image Analysis I 25 Impulse Train

Bahadir K. Gunturk EE Image Analysis I 26 Sampling

Bahadir K. Gunturk EE Image Analysis I 27 Sampling No aliasing if

Bahadir K. Gunturk EE Image Analysis I 28 Sampling If there is no aliasing, the original signal can be recovered from its samples by low-pass filtering.

Bahadir K. Gunturk EE Image Analysis I 29 Sampling Aliased

Bahadir K. Gunturk EE Image Analysis I 30 Sampling Anti-aliasing filter

Bahadir K. Gunturk EE Image Analysis I 31 Sampling ■ Without anti-aliasing filter: ■ With anti-aliasing filter:

Bahadir K. Gunturk EE Image Analysis I 32 Anti-Aliasing a=imread(‘barbara.tif’);

Bahadir K. Gunturk EE Image Analysis I 33 Anti-Aliasing a=imread(‘barbara.tif’); b=imresize(a,0.25); c=imresize(b,4);

Bahadir K. Gunturk EE Image Analysis I 34 Anti-Aliasing a=imread(‘barbara.tif’); b=imresize(a,0.25); c=imresize(b,4); H=zeros(512,512); H(256-64:256+64, :256+64)=1; Da=fft2(a); Da=fftshift(Da); Dd=Da.*H; Dd=fftshift(Dd); d=real(ifft2(Dd));

Bahadir K. Gunturk EE Image Analysis I 35 Sampling

Bahadir K. Gunturk EE Image Analysis I 36 Sampling No aliasing if and

Bahadir K. Gunturk EE Image Analysis I 37 Interpolation Ideal reconstruction filter:

Bahadir K. Gunturk EE Image Analysis I 38 Ideal Reconstruction Filter