Image Processing Basics. What are images? An image is a 2-d rectilinear array of pixels.

Slides:



Advertisements
Similar presentations
Sampling, Aliasing.
Advertisements

Sampling and Reconstruction
MIT EECS 6.837, Durand and Cutler Sampling, Aliasing, & Mipmaps.
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.
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 3: Sampling and Reconstruction Ravi Ramamoorthi Some slides.
Sampling, Aliasing, & Mipmaps
CS248 Midterm Review. CS248 Midterm Mon, November 4, 7-9 pm, Terman Aud Mostly “short answer” questions – Keep your answers short and sweet! Covers lectures.
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.
CS248 Midterm Review Szymon Rusinkiewicz. CS248 Midterm Monday, November 1, 7-9 pm Gates B01 and B03 Designed to be 1-hour exam Mostly “short answer”
Sampling (Section 4.3) CS474/674 – Prof. Bebis. Sampling How many samples should we obtain to minimize information loss during sampling? Hint: take enough.
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
CS248 Midterm Review. CS248 Midterm Mon, November 3, 7-9 pm, Gates B01 Mostly “short answer” questions – Keep your answers short and sweet! Covers lectures.
CSCE 641 Computer Graphics: Fourier Transform Jinxiang Chai.
CS5520 Image-Based Rendering © Chun-Fa Chang, Spring 2003 Sampling Theorem & Antialiasing April 15, 2003.
University of British Columbia CPSC 414 Computer Graphics © Tamara Munzner 1 Sampling Week 7, Fri 17 Oct 2003 p1 demos sampling.
University of British Columbia CPSC 414 Computer Graphics © Tamara Munzner 1 Scan Conversion Week 6, Fri 10 Oct 2003 sampling.
Sampling and Aliasing Kurt Akeley CS248 Lecture 3 2 October 2007
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.
CS248 Midterm Review. CS248 Midterm Mon, November 5, 7-9 pm, Terman Aud Mon, November 5, 3-5 pm, Gates 392 Mostly “short answer” questions Covers through.
Leo Lam © Signals and Systems EE235. Transformers Leo Lam ©
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.
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 3 Ravi Ramamoorthi
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5409 T-R 10:30am – 11:50am.
… Representation of a CT Signal Using Impulse Functions
G52IIP, School of Computer Science, University of Nottingham 1 Image Transforms Fourier Transform Basic idea.
© Chun-Fa Chang Sampling Theorem & Antialiasing. © Chun-Fa Chang Motivations “ My ray traced images have a lot more pixels than the TV screen. Why do.
Image Processing 고려대학교 컴퓨터 그래픽스 연구실 cgvr.korea.ac.kr.
Antialiasing CptS 548 Advanced Computer Graphics John C. Hart.
Antialiasing CAP4730: Computational Structures in Computer Graphics.
Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain.
Image Processing and Sampling
Lecture 3: Edge detection CS4670/5670: Computer Vision Kavita Bala From Sandlot ScienceSandlot Science.
09/19/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Dithering.
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.
CS559: Computer Graphics Lecture 4: Compositing and Resampling Li Zhang Spring 2008.
MIT EECS Sampling, Aliasing, & Mipmaps. MIT EECS Last Time? Global illumination “physically accurate light transport” The rendering equation.
Gholamreza Anbarjafari, PhD Video Lecturers on Digital Image Processing Digital Image Processing Spatial Aliasing and Image Enhancement.
7- 1 Chapter 7: Fourier Analysis Fourier analysis = Series + Transform ◎ Fourier Series -- A periodic (T) function f(x) can be written as the sum of sines.
02/05/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Mach Banding –Humans exaggerate sharp boundaries, but not fuzzy ones.
Image 2013, Fall. Image Processing Quantization  Uniform Quantization  Halftoning & Dithering Pixel Operation  Add random noise  Add luminance  Add.
Sampling Theorem & Antialiasing
Lecture 5: Fourier and Pyramids
Computer Graphics & Image Processing Chapter # 4 Image Enhancement in Frequency Domain 2/26/20161.
Last Lecture photomatix.com. Today Image Processing: from basic concepts to latest techniques Filtering Edge detection Re-sampling and aliasing Image.
University of Texas at Austin CS384G - Computer Graphics Fall 2008 Don Fussell Sampling and Reconstruction.
Antialiasing. What is alias? Alias - A false signal in telecommunication links from beats between signal frequency and sampling frequency (from dictionary.com)
Sampling Week 7, Fri 17 Oct 2003 p1 demos sampling.
Advanced Computer Graphics
… Sampling … … Filtering … … Reconstruction …
Image Processing and Sampling
Sampling Theorem & Antialiasing
(C) 2002 University of Wisconsin, CS 559
Sampling and Antialiasing
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.
Joshua Barczak CMSC435 UMBC
CSCE 643 Computer Vision: Image Sampling and Filtering
CSCE 643 Computer Vision: Thinking in Frequency
Sampling and Reconstruction
Image Processing 고려대학교 컴퓨터 그래픽스 연구실 kucg.korea.ac.kr.
Image Processing 고려대학교 컴퓨터 그래픽스 연구실 kucg.korea.ac.kr.
Presentation transcript:

Image Processing Basics

What are images? An image is a 2-d rectilinear array of pixels

Pixels as samples A pixel is a sample of a continuous function

Images are Ubiquitous Input Optical photoreceptors Digital camera CCD array Rays in virtual camera (why?) Output TVs Computer monitors Printers

Properties of Images Spatial resolution Width pixels/width cm and height pixels/ height cm Intensity resolution Intensity bits/intensity range (per channel) Number of channels RGB is 3 channels, grayscale is one channel

Image errors Spatial aliasing Not enough spatial resolution Intensity quantization Not enough intensity resolution

Two issues Sampling and reconstruction Creating and displaying images while reducing spatial aliasing errors Halftoning techniques Dealing with intensity quantization

Sampling and reconstruction

Aliasing Artifacts caused by too low sampling frequency (undersampling) or improper reconstruction Undersampling rate determined by Nyquist limit (Shannon’s sampling theorem)

Aliasing in computer graphics In graphics, two major types Spatial aliasing Problems in individual images Temporal aliasing Problems in image sequences (motion)

Spatial Aliasing “Jaggies”

Spatial aliasing Ref: SIGGRAPH aliasing tutorial

Spatial aliasing Texture disintegration Ref: SIGGRAPH aliasing tutorial

Temporal aliasing Strobing Stagecoach wheels in movies Flickering Monitor refresh too slow Frame update rate too slow CRTs seen on other video screens

Antialiasing Sample at a higher rate What if the signal isn’t bandlimited? What if we can’t do this, say because the sampling device has a fixed resolution? Pre-filter to form bandlimited signal Low pass filter Trades aliasing for blurring Non-uniform sampling Not always possible, done by your visual system, suitable for ray tracing Trades aliasing for noise

Sampling Theory Two issues What sampling rate suffices to allow a given continuous signal to be reconstructed from a discrete sample without loss of information? What signals can be reconstructed without loss for a given sampling rate?

Spectral Analysis Spatial (time) domain:Frequency domain: Any (spatial, time) domain signal (function) can be written as a sum of periodic functions (Fourier)

Fourier Transform

Fourier transform: Inverse Fourier transform:

Sampling theorem A signal can be reconstructed from its samples if the signal contains no frequencies above ½ the sampling frequency. -Claude Shannon The minimum sampling rate for a bandlimited signal is called the Nyquist rate A signal is bandlimited if all frequencies above a given finite bound have 0 coefficients, i.e. it contains no frequencies above this bound.

Filtering and convolution Convolution of two functions (= filtering): Convolution theorem: Convolution in the frequency domain is the same as multiplication in the spatial (time) domain, and Convolution in the spatial (time) domain is the same as multiplication in the frequency domain

Filtering, sampling and image processing Many image processing operations basically involve filtering and resampling. Blurring Edge detection Scaling Rotation Warping

Resampling Consider reducing the image resolution:

Resampling The problem is to resample the image in such a way as to produce a new image, with a lower resolution, without introducing aliasing. Strategy- Low pass filter transformed image by convolution to form bandlimited signal This will blur the image, but avoid aliasing

Ideal low pass filter Frequency domain: Spatial (time) domain:

Image processing in practice Use finite, discrete filters instead of infinite continous filters Convolution is a summation of a finite number of terms rather than in integral over an infinite domain A filter can now be represented as an array of discrete terms (the kernel)

Discrete Convolution

Finite low pass filters Triangle filter

Finite low pass filters Gaussian filter

Edge Detection Convolve image with a filter that finds differences between neighboring pixels

Scaling Resample with a gaussian or triangle filter

Image processing Some other filters

Summary Images are discrete objects Pixels are samples Images have limited resolution Sampling and reconstruction Reduce visual artifacts caused by aliasing Filter to avoid undersampling Blurring (and noise) are preferable to aliasing