… Sampling … … Filtering … … Reconstruction …

Slides:



Advertisements
Similar presentations
3-D Computational Vision CSc Image Processing II - Fourier Transform.
Advertisements

Fourier Transform (Chapter 4)
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.
Computer Graphics Recitation 6. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
Reminder Fourier Basis: t  [0,1] nZnZ Fourier Series: Fourier Coefficient:
Chapter 4 Image Enhancement in the Frequency Domain.
Convolution, Edge Detection, Sampling : Computational Photography Alexei Efros, CMU, Fall 2006 Some slides from Steve Seitz.
CSCE 641 Computer Graphics: Image Sampling and Reconstruction Jinxiang Chai.
Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.
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.
Immagini e filtri lineari. Image Filtering Modifying the pixels in an image based on some function of a local neighborhood of the pixels
Advanced Computer Graphics (Spring 2006) COMS 4162, Lecture 3: Sampling and Reconstruction Ravi Ramamoorthi
CSCE 641 Computer Graphics: Fourier Transform Jinxiang Chai.
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.
Leo Lam © Signals and Systems EE235. Transformers Leo Lam ©
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 3 Ravi Ramamoorthi
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm.
G52IIP, School of Computer Science, University of Nottingham 1 Image Transforms Fourier Transform Basic idea.
EE421, Fall 1998 Michigan Technological University Timothy J. Schulz 08-Sept, 98EE421, Lecture 11 Digital Signal Processing (DSP) Systems l Digital processing.
Presentation Image Filters
Effective Computation of Linear Filters The following properties are used to shorten the computation time f  g = g  f, f  (g  h) = (f  g)  h, f 
Filtering Robert Lin April 29, Outline Why filter? Filtering for Graphics Sampling and Reconstruction Convolution The Fourier Transform Overview.
Part I: Image Transforms DIGITAL IMAGE PROCESSING.
09/19/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Dithering.
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.
Prof. Brian L. Evans Dept. of Electrical and Computer Engineering The University of Texas at Austin Lecture 4 EE 345S Real-Time.
Image Processing Basics. What are images? An image is a 2-d rectilinear array of pixels.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm.
CMSC 635 Sampling and Antialiasing. Aliasing in images.
Leo Lam © Signals and Systems EE235 Leo Lam.
Image as a linear combination of basis images
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.
2D Fourier Transform.
The Frequency Domain Digital Image Processing – Chapter 8.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
University of Texas at Austin CS384G - Computer Graphics Fall 2008 Don Fussell Sampling and Reconstruction.
Sampling (Section 4.3) CS474/674 – Prof. Bebis.
Miguel Tavares Coimbra
Sampling Week 7, Fri 17 Oct 2003 p1 demos sampling.
Jean Baptiste Joseph Fourier
Advanced Computer Graphics
Linear Filters and Edges Chapters 7 and 8
- photometric aspects of image formation gray level images
Linear Filters and Edges Chapters 7 and 8
Digital Signal Processing Lecture 4 DTFT
Chapter 3 Sampling.
(C) 2002 University of Wisconsin, CS 559
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.
Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.
Outline Linear Shift-invariant system Linear filters
Joshua Barczak CMSC435 UMBC
Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.
2D Fourier transform is separable
Outline Linear Shift-invariant system Linear filters
CSCE 643 Computer Vision: Image Sampling and Filtering
CSCE 643 Computer Vision: Thinking in Frequency
Sampling and Reconstruction
Digital Image Processing
Interpolation and Pulse Shaping
Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.
Digital Image Procesing Unitary Transforms Discrete Fourier Trasform (DFT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
Chapter 3 Sampling.
Review and Importance CS 111.
Presentation transcript:

… Sampling … … Filtering … … Reconstruction … Leonid I. Dimitrov & Miloš Šrámek Commission for Scientific Visualization Austrian Academy of Sciences

Motivation example (1)

Motivation example (2)

Motivation example (3)

Motivation example (4) Nice picture Poor picture

Overview Sampling of continuous signals Filtering of discrete signals Reconstruction of continuous signals Sampling aspects of volume rendering Voxelization of geometric objects

Why Sampling and Reconstruction? Real-world signals are continuous 3D object Digitalization and quantization 3D reconstruction and sampling 2D reconstruction and sampling 3D scene 2D image Measurement Visualization Display Computer representations are discrete

Signal and Spectrum Spectrum Signal s  Fourier transformation Spectrum Signal s  Frequency/spectral domain Spatial / time domain FT: decomposition of a signal into a sum of sinusoids, determined by frequency, amplitude and phase f(x) - representation in the spatial domain F() - representation in the frequency domain

Fourier Transform Direct FT: Inverse FT: ω=2π𝑓

Examples sin(x)+sin(2x) Spectrum of sin(x)+sin(2x) Spectrum music Spectrum white noise

Typically Drawn Spectrum Symmetric F is complex, we draw |F| Falling towards high frequencies Band limited: has maximum frequency max |F| f

Convolution (1) A weighted sum of f with weight function h placed at s Applications: Smoothing, noise removal, edge detection, ... Other names: filter (e.g. lowpass)

Convolution (2) Continuous case: Discrete case: f: signal, h: convolution kernel

Convolution Theorem Convolution in spatial (frequency) domain corresponds to multiplication in frequency (spatial) domain

Dirac's δ-function Can be used to describe the sampling process Properties: x x0 δ 𝑥− 𝑥 0 −∞ ∞ δ 𝑥 =1 𝑓 𝑥 δ 𝑥− 𝑥 0 =𝑓 𝑥 0 δ 𝑥− 𝑥 0 −∞ ∞ 𝑓 𝑥 δ 𝑥− 𝑥 0 =𝑓 𝑥 0

Sampling Input signal: Ideal sampling function: Sampled signal:

Sampling in the Frequency Domain Spectrum of the sampled signal: S (spectrum of the sampling function): and

Sampling in the Frequency Domain Sampling a signal causes replication of its spectrum in the frequency domain Nyquist criterion:

Sampling of a Signal In the spatial domain In the frequency domain

Real-world Sampling Process The sampling function has a volume Can be approximated by a Gaussian: A Gaussian is a low-pass filter, i.e. it causes blurred image, blunt edges

Reconstruction Direct reconstruction of a continuous signal from discrete samples: The spectrum replicas have to be suppressed by a reconstruction filter The ideal reconstruction filter is the box function:

Reconstruction

Ideal Reconstruction Filter

Ideal Reconstruction Filter Bounded support in the frequency domain, but unbounded in the spatial domain Can’t be realized practically It has to be approximated (bounded): The approximations have unbounded support in the frequency domain

Problems with the Reconstruction (aliasing) If the Nyquist criterion is not fulfilled If the reconstruction filter is too big or too small

Prealiasing Wrong frequencies appear if the Nyquist criterion is not fulfilled:

Postaliasing Wrong frequencies appear also if the reconstruction filter support is too broad

Classification of 3D reconstruction filters Separable: Sequential application along the axes Computational complexity: 3n Spherically symmetrical: Computational complexity: n3

Separable Filters Order 0: nearest neighbor Order 1: linear interpolation Order 3: cubic filters: Cubic B-spline Catmull-Rom spline

Nearest Neighbor Filter Spectrum

Nearest Neighbor Filtering

Nearest Neighbor Filtering

Linear Interpolation Filter Spectrum

Linear Filtering

Linear Filtering

Trilinear Reconstruction Filter

Truncated sinc Filter Filter Spektrum

Truncated sinc Filtering

Truncated sinc Filtering

Catmull-Rom Spline Piecewise cubic, C1-smooth

Catmul-Rom Spline Filter Spectrum

Catmull-Rom Spline Filtering

Catmull-Rom Spline Filtering

Other Separable Filters Gaussian filter Windowed sinc filter

An Example FN = 10, sampling 40 x 40 x 40

Reconstruction by the Trilinear Filter

Reconstruction by the Cubic B-spline Filter

Reconstruction by the Catmull-Rom Spline Filter

Reconstruction by the Windowed sinc Filter