2D Image Fourier Spectrum.

Slides:



Advertisements
Similar presentations
CSCE 643 Computer Vision: Template Matching, Image Pyramids and Denoising Jinxiang Chai.
Advertisements

Spatial Filtering (Chapter 3)
Motion illusion, rotating snakes. Slide credit Fei Fei Li.
© by Yu Hen Hu 1 ECE533 Digital Image Processing Image Enhancement in Frequency Domain.
Slides from Alexei Efros
CS 691 Computational Photography
Pyramids and Texture. Scaled representations Big bars and little bars are both interesting Spots and hands vs. stripes and hairs Inefficient to detect.
Digital Image Processing In The Name Of God Digital Image Processing Lecture3: Image enhancement M. Ghelich Oghli By: M. Ghelich Oghli
Filtering CSE P 576 Larry Zitnick
Convolution. Spatial Filtering Operations g(x,y) = 1/M  f(n,m) (n,m) in  S Example 3 x 3 5 x 5.
Reminder Fourier Basis: t  [0,1] nZnZ Fourier Series: Fourier Coefficient:
Chapter 4 Image Enhancement in the Frequency Domain.
Introduction to Computer and Human Vision Shimon Ullman, Ronen Basri, Michal Irani Assistants: Lena Gorelick Denis Simakov.
Chap 4-2. Frequency domain processing Jen-Chang Liu, 2006.
Convolution, Edge Detection, Sampling : Computational Photography Alexei Efros, CMU, Fall 2006 Some slides from Steve Seitz.
The Fourier Transform Jean Baptiste Joseph Fourier.
Sampling and Pyramids : Rendering and Image Processing Alexei Efros …with lots of slides from Steve Seitz.
Edges and Scale Today’s reading Cipolla & Gee on edge detection (available online)Cipolla & Gee on edge detection Szeliski – From Sandlot ScienceSandlot.
Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.
Introduction to Computer and Human Vision Shimon Ullman, Ronen Basri, Michal Irani Assistants: Tal Hassner Eli Shechtman.
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.
Immagini e filtri lineari. Image Filtering Modifying the pixels in an image based on some function of a local neighborhood of the pixels
Digital Image Processing Chapter 4: Image Enhancement in the Frequency Domain.
Convolution. Convolution Properties Commutative: f*g = g*f Associative: (f*g)*h = f*(g*h) Homogeneous : f*( g)= f*g Additive (Distributive): f*(g+h)=
Convolution and Edge Detection : Computational Photography Alexei Efros, CMU, Fall 2005 Some slides from Steve Seitz.
Chapter 4 Image Enhancement in the Frequency Domain.
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
Fourier Transform 2D Discrete Fourier Transform - 2D
Basic Image Processing January 26, 30 and February 1.
Image Representation Gaussian pyramids Laplacian Pyramids
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5409 T-R 10:30am – 11:50am.
Introduction to Image Processing Grass Sky Tree ? ? Review.
Applications of Image Filters Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 02/04/10.
CSC589 Introduction to Computer Vision Lecture 8
Image Resampling CS4670: Computer Vision Noah Snavely.
University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Image processing.
Image Processing Xuejin Chen Ref:
Image Processing Edge detection Filtering: Noise suppresion.
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.
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.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm.
Templates, Image Pyramids, and Filter Banks
2D Image Fourier Spectrum.
Fourier Transform.
Image hole-filling. Agenda Project 2: Will be up tomorrow Due in 2 weeks Fourier – finish up Hole-filling (texture synthesis) Image blending.
Lecture 5: Fourier and Pyramids
CSE 185 Introduction to Computer Vision Image Filtering: Spatial Domain.
Digital Image Processing Lecture 8: Image Enhancement in Frequency Domain II Naveed Ejaz.
Spatial Filtering (Chapter 3) CS474/674 - Prof. Bebis.
Convolution.
Jean Baptiste Joseph Fourier
Linear Filters and Edges Chapters 7 and 8
- photometric aspects of image formation gray level images
… Sampling … … Filtering … … Reconstruction …
Image Pre-Processing in the Spatial and Frequent Domain
The Fourier Transform Jean Baptiste Joseph Fourier.
(C) 2002 University of Wisconsin, CS 559
Convolution.
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.
Introduction to Computer and Human Vision
Fourier Transform.
Digital Image Processing
Convolution.
Convolution.
Nov. 25 – Israeli Computer Vision Day
Lecture 4 Image Enhancement in Frequency Domain
Convolution.
Review and Importance CS 111.
Convolution.
Presentation transcript:

2D Image Fourier Spectrum

Fourier Transform -- Examples Image Fourier spectrum

Phase and Magnitude Curious fact Demonstration All natural images have very similar magnitude transform. So why do they look different…? Demonstration Take two pictures, swap the phase transforms, compute the inverse - what does the result look like?  Phase in images matters a lot (more than magnitude)

Slide: Freeman & Durand

Slide: Freeman & Durand

Reconstruction with zebra phase, cheetah magnitude Slide: Freeman & Durand

Reconstruction with cheetah phase, zebra magnitude Slide: Freeman & Durand

Convolution

Spatial Filtering Operations Example 3 x 3 h(x,y) = 1/9 S f(n,m) (n,m) in the 3x3 neighborhood of (x,y)

Noise Cleaning Salt & Pepper Noise 3 X 3 Average 5 X 5 Average Median

Noise Cleaning Salt & Pepper Noise 3 X 3 Average 5 X 5 Average Median

Gradient magnitude x derivative y derivative

Vertical edges Horizontal edges Edge Detection Image

Convolution Properties Commutative: f*g = g*f Associative: (f*g)*h = f*(g*h) Homogeneous: f*(g)=  f*g Additive (Distributive): f*(g+h)= f*g+f*h Shift-Invariant f*g(x-x0,y-yo)= (f*g) (x-x0,y-yo)

The Convolution Theorem and similarly:

Going back to the Noise Cleaning example… 3 X 3 Average Salt & Pepper Noise Convolution with a rect  Multiplication with a sinc in the Fourier domain = LPF (Low-Pass Filter) 7 X 7 Average 5 X 5 Average Wider rect  Narrower sinc = Stronger LPF

Examples What is the Fourier Transform of ? *

Image Domain Frequency Domain

(developed on the board) Nyquist frequency, Aliasing, etc… The Sampling Theorem (developed on the board) Nyquist frequency, Aliasing, etc…

Multi-Scale Image Representation Gaussian pyramids Laplacian Pyramids Wavelet Pyramids Good for: - pattern matching - motion analysis - image compression - other applications

Image Pyramid High resolution Low resolution

Fast Pattern Matching search search search search

The Gaussian Pyramid Low resolution down-sample blur down-sample blur High resolution

- = - = - = The Laplacian Pyramid Gaussian Pyramid Laplacian Pyramid expand - = expand - = expand - =

Laplacian ~ Difference of Gaussians - = DOG = Difference of Gaussians More details on Gaussian and Laplacian pyramids can be found in the paper by Burt and Adelson (link will appear on the website).

Computerized Tomography (CT) f(x,y) u v F(u,v)

Computerized Tomography Original (simulated) 2D image 8 projections- Frequency Domain 120 projections- Frequency Domain Reconstruction from 8 projections Reconstruction from 120 projections

End of Lesson... Exercise#1 -- will be posted on the website. (Theoretical exercise: To be done and submitted individually)