Sampling (Section 4.3) CS474/674 – Prof. Bebis. Sampling How many samples should we obtain to minimize information loss during sampling? Hint: take enough.

Slides:



Advertisements
Similar presentations
Sampling and Reconstruction
Advertisements

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),
Prof. Brian L. Evans Dept. of Electrical and Computer Engineering The University of Texas at Austin EE445S Real-Time Digital Signal Processing Lab Spring.
Medical Image Analysis Image Formation Figures come from the textbook: Medical Image Analysis, by Atam P. Dhawan, IEEE Press, 2003.
Fourier Transform – Chapter 13. Fourier Transform – continuous function Apply the Fourier Series to complex- valued functions using Euler’s notation to.
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.
Digital Image Processing
Computer Graphics Recitation 6. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
Qassim University College of Engineering Electrical Engineering Department Course: EE301: Signals and Systems Analysis The sampling Process Instructor:
Sep 15, 2005CS477: Analog and Digital Communications1 Modulation and Sampling Analog and Digital Communications Autumn
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.
1.The Concept and Representation of Periodic Sampling of a CT Signal 2.Analysis of Sampling in the Frequency Domain 3.The Sampling Theorem — the Nyquist.
University of British Columbia CPSC 414 Computer Graphics © Tamara Munzner 1 Sampling Week 7, Fri 17 Oct 2003 p1 demos sampling.
Continuous-time Signal Sampling Prof. Siripong Potisuk.
Leo Lam © Signals and Systems EE235. Transformers Leo Lam ©
Digital Signal Processing – Chapter 7
First semester King Saud University College of Applied studies and Community Service 1301CT.
The Nyquist–Shannon Sampling Theorem. Impulse Train  Impulse Train (also known as "Dirac comb") is an infinite series of delta functions with a period.
Sampling and Antialiasing CMSC 491/635. Abstract Vector Spaces Addition –C = A + B = B + A –(A + B) + C = A + (B + C) –given A, B, A + X = B for only.
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.
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Dr Martin Hendry, Dept of Physics and Astronomy University of Glasgow, UK Astronomical Data Analysis I 11 lectures, beginning autumn 2008.
EE421, Fall 1998 Michigan Technological University Timothy J. Schulz 08-Sept, 98EE421, Lecture 11 Digital Signal Processing (DSP) Systems l Digital processing.
DTFT And Fourier Transform
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
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.
ECE 4710: Lecture #6 1 Bandlimited Signals  Bandlimited waveforms have non-zero spectral components only within a finite frequency range  Waveform is.
09/19/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Dithering.
Notice  HW problems for Z-transform at available on the course website  due this Friday (9/26/2014) 
Image Processing Basics. What are images? An image is a 2-d rectilinear array of pixels.
Leo Lam © Signals and Systems EE235 Leo Lam.
ΚΕΦΑΛΑΙΟ: Sampling And reconstruction
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.
Leo Lam © Signals and Systems EE235. Leo Lam © Fourier Transform Q: What did the Fourier transform of the arbitrary signal say to.
Fourier Transform.
(c) 2002 University of Wisconsin, CS 559
Lecture 3: The Sampling Process and Aliasing 1. Introduction A digital or sampled-data control system operates on discrete- time rather than continuous-time.
The Fourier Transform.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
Lecture 1.4. Sampling. Kotelnikov-Nyquist Theorem.
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Sampling (Section 4.3) CS474/674 – Prof. Bebis.
Digital Image Processing Chapter - 4
Sampling Week 7, Fri 17 Oct 2003 p1 demos sampling.
… Sampling … … Filtering … … Reconstruction …
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
Sampling and Quantization
(C) 2002 University of Wisconsin, CS 559
Zhongguo Liu Biomedical Engineering
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.
لجنة الهندسة الكهربائية
Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.
Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.
Discrete Fourier Transform
CSCE 643 Computer Vision: Image Sampling and Filtering
CSCE 643 Computer Vision: Thinking in Frequency
Interpolation and Pulse Shaping
Chapter 2 Ideal Sampling and Nyquist Theorem
Rectangular Sampling.
Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.
Chapter 3 Sampling.
DIGITAL CONTROL SYSTEM WEEK 3 NUMERICAL APPROXIMATION
Presentation transcript:

Sampling (Section 4.3) CS474/674 – Prof. Bebis

Sampling How many samples should we obtain to minimize information loss during sampling? Hint: take enough samples to allow reconstructing the “continuous” image from its samples.

Example Sampled signal looks like a sinusoidal of a lower frequency !

Definition: “band-limited” functions A function whose spectrum is of finite duration Are all functions band-limited? max frequency NO!!

Properties of band-limited functions Band-limited functions have infinite duration in the time domain. Functions with finite duration in the time domain have infinite duration in the frequency domain.

Sampling a 1D function Multiply f(x) with s(x) sampled f(x) x Hint: use convolution theorem! Question: what is the DFT of f(x) s(x)?

Sampling a 1D function (cont’d) Suppose f(x) F(u) What is the DFT of s(x)?

Sampling a 1D function (cont’d) * = So:

Sampling a 2D function (cont’d) s(x,y) ΔyΔyΔxΔx x y 2D train of impulses

Sampling a 2D function (cont’d) DFT of 2D discrete function (i.e., image) f(x,y)s(x,y) F(u,v)*S(u,v)

Reconstructing f(x) from its samples Need to isolate a single period: –Multiply by a window G(u) x

Reconstructing f(x) from its samples (cont’d) Then, take the inverse FT:

What is the effect of Δx? Large Δx (i.e., few samples) results to overlapping periods!

Effect of Δx (cont’d) But, if the periods overlap, we cannot anymore isolate a single period  aliasing! x

What is the effect of Δx? (cont’d) Smaller Δx (i.e., more samples) alleviates aliasing!

What is the effect of Δx? (cont’d) 2D case u u v v u max v max

Example Suppose that we have an imaging system where the number of samples it can take is fixed at 96 x 96 pixels. Suppose we use this system to digitize checkerboard patterns. Such a system can resolve patterns that are up to 96 x 96 squares (i.e., 1 x 1 pixel squares). What happens when squares are less than 1 x 1 pixels?

Example square size: 16 x 16 6 x 6 square size: (same as 12 x 12 squares)

How to choose Δx? The center of the overlapped region is at

How to choose Δx? (cont’d) Choose Δx as follows: where W is the max frequency of f(x)

Practical Issues Band-limited functions have infinite duration in the time domain. But, we can only sample a function over a finite interval!

Practical Issues (cont’d) We would need to obtain a finite set of samples by multiplying with a “box” function: [s(x)f(x)]h(x) x =

Practical Issues (cont’d) This is equivalent to convolution in the frequency domain! [s(x)f(x)]h(x)  [F(u)*S(u)] * H(u)

Practical Issues (cont’d) instead of this! *

How does this affect things in practice? Even if the Nyquist criterion is satisfied, recovering a function that has been sampled in a finite region is in general impossible! Special case: periodic functions –If f(x) is periodic, then a single period can be isolated assuming that the Nyquist theorem is satisfied! –e.g., sin/cos functions

Anti-aliasing In practice, aliasing in almost inevitable! The effect of aliasing can be reduced by smoothing the input signal to attenuate its higher frequencies. This has to be done before the function is sampled. –Many commercial cameras have true anti-aliasing filtering built in the lens of the sensor itself. –Most commercial software have a feature called “anti- aliasing” which is related to blurring the image to reduced aliasing artifacts (i.e., not true anti-aliasing)

Example 50% less samples 3 x 3 blurring and 50% less samples