Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.

Slides:



Advertisements
Similar presentations
Fourier Transform – Chapter 13. Fourier Transform – continuous function Apply the Fourier Series to complex- valued functions using Euler’s notation to.
Advertisements

Linear Filtering – Part II Selim Aksoy Department of Computer Engineering Bilkent University
Filtering CSE P 576 Larry Zitnick
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:
Image Filtering, Part 2: Resampling Today’s readings Forsyth & Ponce, chapters Forsyth & Ponce –
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.
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.
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
Image Sampling Moire patterns
CSCE 641 Computer Graphics: Fourier Transform Jinxiang Chai.
2D Fourier Theory for Image Analysis Mani Thomas CISC 489/689.
CPSC 641 Computer Graphics: Fourier Transform Jinxiang Chai.
Announcements Send to the TA for the mailing list For problem set 1: turn in written answers to problems 2 and 3. Everything.
Computational Photography: Fourier Transform Jinxiang Chai.
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
Image Sampling Moire patterns -
CELLULAR COMMUNICATIONS DSP Intro. Signals: quantization and sampling.
Systems: Definition Filter
Image Sampling CSE 455 Ali Farhadi Many slides from Steve Seitz and Larry Zitnick.
Signals and Systems Jamshid Shanbehzadeh.
09/19/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Dithering.
Lighting affects appearance. How do we represent light? (1) Ideal distant point source: - No cast shadows - Light distant - Three parameters - Example:
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Chapter 5: Neighborhood Processing
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
1 Methods in Image Analysis – Lecture 3 Fourier CMU Robotics Institute U. Pitt Bioengineering 2630 Spring Term, 2004 George Stetten, M.D., Ph.D.
Lecture 5: Fourier and Pyramids
2D Fourier Transform.
Last Lecture photomatix.com. Today Image Processing: from basic concepts to latest techniques Filtering Edge detection Re-sampling and aliasing Image.
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Convolution.
Jean Baptiste Joseph Fourier
… Sampling … … Filtering … … Reconstruction …
Correlation and Convolution They replace the value of an image pixel with a combination of its neighbors Basic operations in images Shift Invariant Linear.
Linear Filtering – Part II
Many slides from Steve Seitz and Larry Zitnick
Image Sampling Moire patterns
(C) 2002 University of Wisconsin, CS 559
Convolution.
Frequency domain analysis and Fourier Transform
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.
All about convolution.
Outline Linear Shift-invariant system Linear filters
Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.
Image Sampling Moire patterns
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
Image Processing Today’s readings For Monday
Convolution.
Filtering Part 2: Image Sampling
Image Sampling Moire patterns
Lecture 5: Resampling, Compositing, and Filtering Li Zhang Spring 2008
Convolution.
Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.
Nov. 25 – Israeli Computer Vision Day
Resampling.
Fourier Transforms.
Chapter 3 Sampling.
Lecture 4 Image Enhancement in Frequency Domain
Convolution.
Review and Importance CS 111.
Convolution.
Presentation transcript:

Fourier Transform Analytic geometry gives a coordinate system for describing geometric objects. Fourier transform gives a coordinate system for functions.

Decomposition of the image function The image can be decomposed into a weighted sum of sinusoids and cosinuoids of different frequency. Fourier transform gives us the weights

Basis P=(x,y) means P = x(1,0)+y(0,1) Similarly:

Orthonormal Basis ||(1,0)||=||(0,1)||=1 (1,0).(0,1)=0 Similarly we use normal basis elements eg: While, eg:

2D Example

Why are we interested in a decomposition of the signal into harmonic components? Sinusoids and cosinuoids are eigenfunctions of convolution Thus we can understand what the system (e.g filter) does to the different components (frequencies) of the signal (image)

Convolution Theorem F,G are transform of f,g ,T-1 is inverse Fourier transform That is, F contains coefficients, when we write f as linear combinations of harmonic basis.

Fourier transform and phase ( ) often described by magnitude ( ) In the discrete case with values fkl of f(x,y) at points (kw,lh) for k= 1..M-1, l= 0..N-1

Remember Convolution X 11 10 10 1 9 O 2 I F 99 1 1/9 99 I O 1 F 1/9 1/9.(10x1 + 11x1 + 10x1 + 9x1 + 10x1 + 11x1 + 10x1 + 9x1 + 10x1) = 1/9.( 90) = 10

Examples Transform of box filter is sinc. Transform of Gaussian is Gaussian. (Trucco and Verri)

Implications Smoothing means removing high frequencies. This is one definition of scale. Sinc function explains artifacts. Need smoothing before subsampling to avoid aliasing.

Example: Smoothing by Averaging

Smoothing with a Gaussian

Sampling

Sampling and the Nyquist rate Aliasing can arise when you sample a continuous signal or image Demo applet http://www.cs.brown.edu/exploratories/freeSoftware/repository/edu/brown/cs/exploratories/applets/nyquist/nyquist_limit_java_plugin.html occurs when your sampling rate is not high enough to capture the amount of detail in your image formally, the image contains structure at different scales called “frequencies” in the Fourier domain the sampling rate must be high enough to capture the highest frequency in the image To avoid aliasing: sampling rate > 2 * max frequency in the image i.e., need more than two samples per period This minimum sampling rate is called the Nyquist rate