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.

Slides:



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

Review of 1-D Fourier Theory:
3-D Computational Vision CSc Image Processing II - Fourier Transform.
Fourier Transform (Chapter 4)
Fourier Transform – Chapter 13. Image space Cameras (regardless of wave lengths) create images in the spatial domain Pixels represent features (intensity,
Chap 4 Image Enhancement in the Frequency Domain.
Linear Filtering – Part II Selim Aksoy Department of Computer Engineering Bilkent University
Chap 4-2. Frequency domain processing Jen-Chang Liu, 2006.
CSCE 641 Computer Graphics: Image Sampling and Reconstruction Jinxiang Chai.
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F(  ) is the spectrum of the function.
CSCE 641 Computer Graphics: Image Sampling and Reconstruction Jinxiang Chai.
Digital Image Processing Chapter 4: Image Enhancement in the Frequency Domain.
lecture 5, Sampling and the Nyquist Condition Sampling Outline  FT of comb function  Sampling Nyquist Condition  sinc interpolation Truncation.
Advanced Computer Graphics (Spring 2006) COMS 4162, Lecture 3: Sampling and Reconstruction Ravi Ramamoorthi
Image Enhancement in the Frequency Domain Part I Image Enhancement in the Frequency Domain Part I Dr. Samir H. Abdul-Jauwad Electrical Engineering Department.
Some Properties of the 2-D Fourier Transform Translation Distributivity and Scaling Rotation Periodicity and Conjugate Symmetry Separability Convolution.
2D Fourier Theory for Image Analysis Mani Thomas CISC 489/689.
CPSC 641 Computer Graphics: Fourier Transform Jinxiang Chai.
Advanced Computer Graphics (Spring 2005) COMS 4162, Lecture 3: Sampling and Reconstruction Ravi Ramamoorthi
Computational Photography: Fourier Transform Jinxiang Chai.
Fourier Transform 2D Discrete Fourier Transform - 2D
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
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.
Sampling of Continuous Time Signal Section
Systems: Definition Filter
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 3 Ravi Ramamoorthi
Goals For This Class Quickly review of the main results from last class Convolution and Cross-correlation Discrete Fourier Analysis: Important Considerations.
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
… Representation of a CT Signal Using Impulse Functions
G52IIP, School of Computer Science, University of Nottingham 1 Image Transforms Fourier Transform Basic idea.
Chapter 5 Frequency Domain Analysis of Systems. Consider the following CT LTI system: absolutely integrable,Assumption: the impulse response h(t) is absolutely.
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.
Image Processing © 2002 R. C. Gonzalez & R. E. Woods Lecture 4 Image Enhancement in the Frequency Domain Lecture 4 Image Enhancement.
Chapter 5 Frequency Domain Analysis of Systems. Consider the following CT LTI system: absolutely integrable,Assumption: the impulse response h(t) is absolutely.
Filtering Robert Lin April 29, Outline Why filter? Filtering for Graphics Sampling and Reconstruction Convolution The Fourier Transform Overview.
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.
Digital Image Processing DIGITIZATION. Summery of previous lecture Digital image processing techniques Application areas of the digital image processing.
October 29, 2013Computer Vision Lecture 13: Fourier Transform II 1 The Fourier Transform In the previous lecture, we discussed the Hough transform. There.
If F {f(x,y)} = F(u,v) or F( ,  ) then F( ,  ) = F { g  (R) } The Fourier Transform of a projection at angle  is a line in the Fourier transform.
Dr. Scott Umbaugh, SIUE Discrete Transforms.
2D Sampling Goal: Represent a 2D function by a finite set of points.
Fourier Transform.
Lecture 3: The Sampling Process and Aliasing 1. Introduction A digital or sampled-data control system operates on discrete- time rather than continuous-time.
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.
Computer Graphics & Image Processing Chapter # 4 Image Enhancement in Frequency Domain 2/26/20161.
2D Fourier Transform.
بسم الله الرحمن الرحيم University of Khartoum Department of Electrical and Electronic Engineering Third Year – 2015 Dr. Iman AbuelMaaly Abdelrahman
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
Fourier transform.
Digital Image Processing Lecture 7: Image Enhancement in Frequency Domain-I Naveed Ejaz.
Linear systems: University of Illinois at Chicago ECE 427, Dr. D. Erricolo University of Illinois at Chicago ECE 427, Dr. D. Erricolo Consider two complex.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Advanced Computer Graphics
Central Section Theorem
Lecture 4: Imaging Theory (2/6) – One-dimensional Fourier transforms
Image Enhancement in the
(C) 2002 University of Wisconsin, CS 559
EE Audio Signals and Systems
Dr. Nikos Desypris, Oct Lecture 3
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F() is the spectrum of the function.
CSCE 643 Computer Vision: Image Sampling and Filtering
CSCE 643 Computer Vision: Thinking in Frequency
Lesson Week 8 Fourier Transform of Time Functions (DC Signal, Periodic Signals, and Pulsed Cosine)
Chapter 3 Sampling.
Lecture 4 Image Enhancement in Frequency Domain
Presentation transcript:

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 the weighting of each wave. has a frequency and a direction The wave

Review of 2D Fourier theory, continued. F(u,v) can be plotted as real and imaginary images, or as magnitude and phase. |F(u,v)| = And Phase(F(u,v) = arctan(Im(F(u,v)/Re(F(u,v)) Just as in the 1D case, pairs of exponentials make cosines or sines. We can view F(u,v) as

Review of 2D Fourier theory, continued: properties - Similar to 1D properties Let Then 1. Linearity 2. Scaling or Magnification 3. Shift 4. Convolution also let then,

Review of 2D Fourier theory, continued: properties If g(x,y) can be expressed as g x (x)g y (y), the F {g(x,y)} =

Relation between 1-D and 2-D Fourier Transforms Rearranging the Fourier Integral, x y F(u) y Taking the integrals along x gives, Taking the integrals of along y gives F(u,v)

Sampling Model We use the comb function and scale it for the sampling interval X.

Spectrum of Sampled Signal Prior to sampling, After sampling,... Multiplication in one domain becomes convolution in the other,

Spectrum of Sampled Signal: Band limiting and Aliasing If G(u) is band limited to u c, (cutoff frequency) G(u) = 0 for |u| > u c. ucuc To avoid overlap (aliasing), ucuc Nyquist Condition: Sampling rate must be greater than twice the highest frequency component.

Spectrum of Sampled Signal: Restoration of Original Signal Can we restore g(x) from the sampled frequency-domain signal? ucuc Yes, using the Interpolation Filter

Spectrum of Sampled Signal: Restoration of Original Signal(2) From previous page, g(x) is restored from a combination of sinc functions. Each is weighted and shifted according to its corresponding sampling point.

Visualizing Sinc Interpolation Original functionSampled function Weighted and shifted sincs for 3 sample points shown by black arrows Each row shows convolution of shifted sinc with a sampled point. Sum lines along vertical direction to get output.

Original functions and output a) Continuous waveform b) Sampled waveform c) Sinc interpolation of sampled waveform ( sum of vertical lines in lower left plot from previous slide. a)b)

Two Dimensional Sampling

2D Sampling Goal: Represent a 2D function by a finite set of points. - particularly useful to analysis w/ computer operations. Points are sampled every X in x, every Y in y. How will the sampled function appear in the spatial frequency domain?

Two Dimensional Sampling: Sampled function in freq. domain How will the sampled function appear in the spatial frequency domain? Since The result: Replicated G(u,v), or “islands” every 1/X in u, and 1/Y in v.

Example Let g(x,y) =  (x/16  y/16) be a continuous function Here we show its continuous transform G(u,v) Now sampling the function gives the following in the space domain

v u Fourier Representation of a Sampled Image 1/X 1/Y Sampling the image in the space domain causes replication in the frequency domain

Two Dimensional Sampling: Restoration of original function will filter out unwanted islands. Let’s consider this in the image domain.

Two Dimensional Sampling: Restoration of original function(2) Each sample serves as a weighting for a 2D sinc function. Nyquist/Shannon Theory: We must sample at twice the highest frequency in x and in y to reconstruct the original signal. (No frequency components in original signal can be or)

Two Dimensional Sampling: Example 80 mm Field of View (FOV) 256 pixels Sampling interval = 80/256 =.3125 mm/pixel Sampling rate = 1/sampling interval = 3.2 cycles/mm or pixels/mm Unaliased for ± 1.6 cycles/mm or line pairs/mm