22.058 - lecture 5, Sampling and the Nyquist Condition Sampling Outline  FT of comb function  Sampling Nyquist Condition  sinc interpolation Truncation.

Slides:



Advertisements
Similar presentations
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),
Advertisements

Fourier Transform – Chapter 13. Fourier Transform – continuous function Apply the Fourier Series to complex- valued functions using Euler’s notation to.
Lecture 5 Fourier Optics. Class Test I: Mark Distribution Mean: 40% Standard deviation: 23%
CS 551 / CS 645 Antialiasing. What is a pixel? A pixel is not… –A box –A disk –A teeny tiny little light A pixel is a point –It has no dimension –It occupies.
Sampling theorem, I  Suppose function h(t) is sampled at evenly spaced intervals in time; – 1/  : Sampling rate  For any sampling interval , there.
CSCE 641 Computer Graphics: Image Sampling and Reconstruction Jinxiang Chai.
CSCE 641 Computer Graphics: Image Sampling and Reconstruction Jinxiang Chai.
Continuous-Time Signal Analysis: The Fourier Transform
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
lecture 2, linear imaging systems Linear Imaging Systems Example: The Pinhole camera Outline  General goals, definitions  Linear Imaging Systems.
First semester King Saud University College of Applied studies and Community Service 1301CT.
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.
Chapter 4: Sampling of Continuous-Time Signals
… Representation of a CT Signal Using Impulse Functions
G52IIP, School of Computer Science, University of Nottingham 1 Image Transforms Fourier Transform Basic idea.
The sampling of continuous-time signals is an important topic It is required by many important technologies such as: Digital Communication Systems ( Wireless.
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Fourier representation for discrete-time signals And Sampling Theorem
Dr Martin Hendry, Dept of Physics and Astronomy University of Glasgow, UK Astronomical Data Analysis I 11 lectures, beginning autumn 2008.
Integral Transform Dongsup Kim Department of Biosystems, KAIST Fall, 2004.
Discrete-Time and System (A Review)
University of Ioannina - Department of Computer Science Filtering in the Frequency Domain (Fundamentals) Digital Image Processing Christophoros Nikou
Chapter 5 Frequency Domain Analysis of Systems. Consider the following CT LTI system: absolutely integrable,Assumption: the impulse response h(t) is absolutely.
ORE 654 Applications of Ocean Acoustics Lecture 6a Signal processing
DTFT And Fourier Transform
Diffraction from point scatterers Wave: cos(kx +  t)Wave: cos(kx +  t) + cos(kx’ +  t) max min.
Outline 2-D Fourier transforms The sampling theorem Sampling Aliasing
IMAGE SAMPLING AND IMAGE QUANTIZATION 1. Introduction
EE D Fourier Transform. Bahadir K. Gunturk EE Image Analysis I 2 Summary of Lecture 2 We talked about the digital image properties, including.
Image Processing © 2002 R. C. Gonzalez & R. E. Woods Lecture 4 Image Enhancement in the Frequency Domain Lecture 4 Image Enhancement.
Complex Variables & Transforms 232 Presentation No.1 Fourier Series & Transforms Group A Uzair Akbar Hamza Saeed Khan Muhammad Hammad Saad Mahmood Asim.
lecture 4, Convolution and Fourier Convolution Convolution Fourier Convolution Outline  Review linear imaging model  Instrument response function.
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.
Digital Image Processing DIGITIZATION. Summery of previous lecture Digital image processing techniques Application areas of the digital image processing.
Digital image processing Chapter 3. Image sampling and quantization IMAGE SAMPLING AND IMAGE QUANTIZATION 1. Introduction 2. Sampling in the two-dimensional.
Leo Lam © Signals and Systems EE235 Leo Lam.
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.
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
2D Sampling Goal: Represent a 2D function by a finite set of points.
Fourier Transform.
Modulation Transfer Function (MTF)
IMAGE SAMPLING AND IMAGE QUANTIZATION 1. Introduction
Lecture 3: The Sampling Process and Aliasing 1. Introduction A digital or sampled-data control system operates on discrete- time rather than continuous-time.
 Introduction to reciprocal space
2D Fourier Transform.
ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ (22Δ802) Β΄ ΕΞΑΜΗΝΟ Καθηγητής Πέτρος Π. Γρουμπός  Ώρες Γραφείου: Τετάρτη Πέμπτη Παρασκευή 11:00- 12:00 Γραφείο: 1.
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.
Central Section Theorem
… Sampling … … Filtering … … Reconstruction …
Outline 2-D Fourier transforms The sampling theorem Sampling Aliasing
EE 638: Principles of Digital Color Imaging Systems
Image Enhancement in the
Lecture Signals with limited frequency range
Dr. Nikos Desypris, Oct Lecture 3
The sampling of continuous-time signals is an important topic
EE 638: Principles of Digital Color Imaging Systems
Discrete Fourier Transform
Outline Linear Shift-invariant system Linear filters
CSCE 643 Computer Vision: Image Sampling and Filtering
IMAGE SAMPLING AND IMAGE QUANTIZATION 1. Introduction
Discrete Fourier Transform
Discrete Fourier Transform
Lesson Week 8 Fourier Transform of Time Functions (DC Signal, Periodic Signals, and Pulsed Cosine)
Chapter 3 Sampling.
DIGITAL CONTROL SYSTEM WEEK 3 NUMERICAL APPROXIMATION
Presentation transcript:

lecture 5, Sampling and the Nyquist Condition Sampling Outline  FT of comb function  Sampling Nyquist Condition  sinc interpolation Truncation Aliasing

lecture 5, Sampling and the Nyquist Condition Sampling As we saw with the CCD camera and the pinhole imager, the detector plane is not a continuous mapping, but a discrete set of sampled points. This of course limits the resolution that can be observed.

lecture 5, Sampling and the Nyquist Condition Limits of Sampling Finite # of data points Finite field of view High spatial frequency features can be missed or recorded incorrectly

lecture 5, Sampling and the Nyquist Condition Formalism of Sampling recall that

lecture 5, Sampling and the Nyquist Condition Formalism of Sampling

lecture 5, Sampling and the Nyquist Condition Formalism of Sampling f(x) Comb(x/  x) TopHat(2x/fov)

lecture 5, Sampling and the Nyquist Condition Formalism of Sampling f(x) Comb(x/  x) TopHat(2x/fov)

lecture 5, Sampling and the Nyquist Condition Formalism of Sampling {f n }

lecture 5, Sampling and the Nyquist Condition Frequency of Sampling FT x k

lecture 5, Sampling and the Nyquist Condition Frequency of Sampling FT x k every point every second point

lecture 5, Sampling and the Nyquist Condition Frequency of Sampling FT x k every point every third point

lecture 5, Sampling and the Nyquist Condition Frequency of Sampling FT x k every point every fourth point

lecture 5, Sampling and the Nyquist Condition Sampling

lecture 5, Sampling and the Nyquist Condition Sampling

lecture 5, Sampling and the Nyquist Condition Sampling

lecture 5, Sampling and the Nyquist Condition Sampling Nyquist theorem: to correctly identify a frequency you must sample twice a period. So, if  x is the sampling, then π/  x is the maximum spatial frequency.

lecture 5, Sampling and the Nyquist Condition Sampling A Simple Cosine Function Consider a simple cosine function, We know the Fourier Transform of this What happens when we sample this at a rate of

lecture 5, Sampling and the Nyquist Condition Sampling A Simple Cosine Function (cont …) So that, Note, I’ve taken a short cut and left off the integrals that are needed to sample with the delta function.

lecture 5, Sampling and the Nyquist Condition Define A New Frequency: Case 1 Define a new frequency Case 1: In this case, there is no overlap and regardless of the complexity of this spectrum (think of having a number or continuum of cosine functions), the frequency spectrum correctly portrays the time evolution of the signal. fsfs -f s 2f 0 0

lecture 5, Sampling and the Nyquist Condition Case 2 Now the frequency spectrum overlaps and look what happens to our picture, So it appears as though we are looking at a frequency of - this is an aliased signal. fsfs -f s 2f 0 0 2f’ 0 fsfs 0 -f s

lecture 5, Sampling and the Nyquist Condition Nyquist Theorem Consider what happens when there is a complex spectrum. Then the entire spectrum overlaps. Either way, the frequency spectrum does not correspond to a correct picture of the dynamics of the original time domain signal. Nyquist Theorem: In order to correctly determine the frequency spectrum of a signal, the signal must be measured at least twice per period.

lecture 5, Sampling and the Nyquist Condition Return to the sampled cosine function So Now let

lecture 5, Sampling and the Nyquist Condition (cont…) Therefore we can see that it is not the Fourier Transform that fails to correctly portray the signal, but by our own sampling process we mis- represented the signal.

lecture 5, Sampling and the Nyquist Condition A Fourier Picture of Sampling

lecture 5, Sampling and the Nyquist Condition A Fourier Picture of Sampling

lecture 5, Sampling and the Nyquist Condition Bandwidth Limited time domain

lecture 5, Sampling and the Nyquist Condition Limitations of Sampling {f n }

lecture 5, Sampling and the Nyquist Condition Limitations of Sampling perfect sampling average 3 data points

lecture 5, Sampling and the Nyquist Condition Limitations of Sampling perfect sampling average 5 data points

lecture 5, Sampling and the Nyquist Condition Limitations of Sampling perfect sampling average 7 data points

lecture 5, Sampling and the Nyquist Condition Reciprocal Space real space reciprocal space

lecture 5, Sampling and the Nyquist Condition Sampling real space under sampled

lecture 5, Sampling and the Nyquist Condition Sampling real space zero filled

lecture 5, Sampling and the Nyquist Condition Sinc interpolation

lecture 5, Sampling and the Nyquist Condition Filtering We can change the information content in the image by manipulating the information in reciprocal space. Weighting function in k-space.

lecture 5, Sampling and the Nyquist Condition Filtering We can also emphasis the high frequency components. Weighting function in k-space.

lecture 5, Sampling and the Nyquist Condition Fourier Convolution

lecture 5, Sampling and the Nyquist Condition Deconvolution Recall in an ideal world Try deconvolution with

lecture 5, Sampling and the Nyquist Condition Deconvolution (cont…) This appears to be a well-balanced function, but look what happens in a Fourier space however: Recall that the Fourier Transform is linear where PSF(k) << n(k), then noise is blown up. The inverse filter is ill-conditioned and greatly increases the noise particularly the high-frequency noise since This is avoided by employing a “Wiener” filter.

lecture 5, Sampling and the Nyquist Condition Original Nyquist Problem A black & white TV has 500 lines with 650 elements per line. These are scanned through Electron beam is scanned over the screen by deflection magnets and the intensity of the beam is modulated to give the intensity at each point. The refresh rate is 30 frames/second. By the sampling theorem, if the frequency is, independent information is available once every seconds. Deflection magnets Electron beam Need information

lecture 5, Sampling and the Nyquist Condition Fourier Transform of a Comb Function The Fourier Transform we wish to evaluate is, One trick to this is to express the comb function as a Fourier series expansion, not the transform. Normalization to keep the series unitary Limits chosen since this is a periodic function

lecture 5, Sampling and the Nyquist Condition Fourier Transform of a Comb Function Over the interval to the comb function contains only a single delta function. A series representation of the comb function is

lecture 5, Sampling and the Nyquist Condition Fourier Transform of a Comb Function Now, 00kx …1… Note: Scaling laws hold