Introduction to the Fourier transform. Computer Vision & Digital Image Processing. The Fourier transform (continued) The Fourier transform (continued)

Size: px
Start display at page:

Download "Introduction to the Fourier transform. Computer Vision & Digital Image Processing. The Fourier transform (continued) The Fourier transform (continued)"

Transcription

1 Introduction to the Fourier transform Computer Vision & Digital Image Processing Fourier Transform Let f(x) be a continuous function of a real variable x The Fourier transform of f(x), denoted by I {f(x)} is given by: + I{ f ( x)} f ( x) exp[ jπux dx where j Given, f(x) can be obtained by using the inverse Fourier transform: I { } f ( x) exp[ jπux du. + Dr. D. J. Jackson Lecture 8- Dr. D. J. Jackson Lecture 8- The Fourier transform (continued) These two equations, called the Fourier transform pair, exist if f(x) is continuous and integrable and is integrable. These conditions are almost always satisfied in practice. We are concerned with functions f(x) which are real, however the Fourier transform of a real function is, generally, complex. So, F ( R( + ji ( where R( and I( denote the real and imaginary components of respectively. The Fourier transform (continued) Expressed in exponential form, is: where and ϕ( tan e F ( R ( + I ( I( R( jϕ ( The magnitude function is called the Fourier spectrum of f(x) and ϕ( is the phase angle. Dr. D. J. Jackson Lecture 8-3 Dr. D. J. Jackson Lecture 8-

2 The Fourier transform (continued) The square of the spectrum, P( R ( + I ( is commonly called the power spectrum (or the spectral densit of f(x). The variable u is often called the frequency variable. This name arises from the expression of the exponential term exp[-jπux in terms of sines and cosines (from Euler s formula): The Fourier transform (continued) Interpreting the integral in the Fourier transform equation as a limit summation of discrete terms make it obvious that: is composed of an infinite sum of sine and cosine terms. Each value of u determines the frequency of its corresponding sine-cosine pair. exp[ jπux cos(πux) j sin(πux) Dr. D. J. Jackson Lecture 8-5 Dr. D. J. Jackson Lecture 8-6 Fourier transform example Consider the following simple function. The Fourier transform is: f(x) X x + X f ( x)exp[ jπux dx exp[ jπux dx [ e jπu [ e jπu jπux X jπux e sin( πux ) e πu [ e jπu jπux jπux e jπux j πux Fourier transform example (continued) This is a complex function. The Fourier spectrum is: sin( πux) e πu sin( πux) X ( πux) jπux plot of looks like the following: Dr. D. J. Jackson Lecture 8-7 Dr. D. J. Jackson Lecture 8-8

3 The -D Fourier transform The Fourier transform can be extended to dimensions: + I{ } and the inverse transform I { } jπ ( ux + v dxdy. + exp[ jπ ( ux + v dudv. The -D Fourier transform (continued) The -D Fourier spectrum is: F ( R ( + I ( The phase angle is: ϕ( tan The power spectrum is: I( R( P( R ( + I ( Dr. D. J. Jackson Lecture 8-9 Dr. D. J. Jackson Lecture 8- Sample -D function and its Fourier spectrum Example -D Fourier transform + X jπ ( ux + v dxdy exp[ jπux dx exp[ jπvy dy j πux jπvy e X e Y [ [ jπu jπv [ e jπu jπux sin( πux ) e XY[ ( πux ) Y [ e jπy jπux jπvy sin( πvy ) e [ ( πvy) sin( πux ) sin( πvy) The spectrum is XY[ [ ( πux ) ( πvy) jπvy Dr. D. J. Jackson Lecture 8- Dr. D. J. Jackson Lecture 8-

4 Example -D functions and their spectra The discrete Fourier transform Suppose a continuous function, f(x), is discretized into a sequence {f(x ), f(x +Δx), f(x +Δx),.., f(x +[-Δx)} by taking samples Δx units apart Let x refer to either a continuous or discrete value by saying f ( x) f ( x + xδx) where x assumes the discrete values,,, - and {f(),f(),,f(-)} denotes any uniformly spaced samples from a corresponding continuous function Dr. D. J. Jackson Lecture 8-3 Dr. D. J. Jackson Lecture 8- Sampling a continuous function The discrete Fourier transform pair The discrete Fourier transform is given by: f ( x)exp[ jπux / x for u,,,- The discrete inverse Fourier transform is given by: f ( x) exp[ jπux / u for x,,,- The values of u,,,-in the discrete case correspond to samples of the continuous transform at, Δ Δ, (- )Δu Δu and Δx are related by Δu/( Δx) Dr. D. J. Jackson Lecture 8-5 Dr. D. J. Jackson Lecture 8-6

5 The -D discrete Fourier transform In the -D case: M M x y for u M- and v - M u v jπ ( ux / M + vy / ) exp[ jπ ( ux / M + vy / ) for x M- and y - The discrete function f(x, represents samples of the continuous function at f(x +xδx, y +yδ Δu/(MΔx) and Δv/(Δ The -D discrete Fourier transform (continued) For the case when M (such as in a square image) and x y u v jπ ( ux + v / exp[ jπ ( ux + v / ote each expression in this case has a / term. The grouping of these constant multiplier terms in the Fourier transform pair is arbitrary. Dr. D. J. Jackson Lecture 8-7 Dr. D. J. Jackson Lecture 8-8 Discrete Fourier transform example Discrete Fourier transform example (continued) The four corresponding Fourier transform terms are 3 ) f ( x)exp[ x [ f () + f () + f () + f (3) [ ) f ( x)exp[ jπ / x jπ / jπ [e + 3e + e + e [ + j j3π / Consider sampling at x.5, x.75, x., and x 3.5 Here Δx.5 and x ranges from 3 F ( ) [ + j F ( 3) [ + j Dr. D. J. Jackson Lecture 8-9 Dr. D. J. Jackson Lecture 8-

6 Discrete Fourier transform example (continued) The Fourier spectrum is then ) [( / ) ) [(/ ) 3) [( / ) ) (/ ) + ( / ) + (/ ) / / / 5 5 Properties of the -D Fourier transform The dynamic range of the Fourier spectra is generally higher than can be displayed common technique is to display the function [ ) D ( c log + v where c is a scaling factor and the logarithm function performs a compression of the data c is usually chosen to scale the data into the range of the display device, [-55 typically ([-56 for 56 gray-level MTLB image) Dr. D. J. Jackson Lecture 8- Dr. D. J. Jackson Lecture 8- Separability Separability (continued) The discrete transform pair can be written in separable forms x for v,,,- exp[ jπux / u for x,y,,,- So, or f(x, can be obtained in steps by successive applications of the -D Fourier transform or its inverse. exp[ jπux / y v jπvy / exp[ jπvy / The -D transform can be expressed as where x x, y x, exp[ jπux / jπvy / Graphically, the process is as follows f(x,,,-,,-,,- Row transforms Multiply by x, Column transforms -, -, -, Dr. D. J. Jackson Lecture 8-3 Dr. D. J. Jackson Lecture 8-

7 Translation The translation properties of the Fourier transform pair are and jπ ( ux + v / u v f ( x x, y exp[ jπ ( ux + v / where the double arrow indicates a correspondence between a function and its Fourier transform (or vice versa) Multiplying f(x, by the exponential and taking the transform results in a shift of the origin of the frequency plane to the point (u,v ). Translation (continued) For our purposes, u v /. Therefore, and exp[ jπ ( u x + v / e jπ ( x+ ( ) x+ y x+ y ( ) u /, v / ) So, the origin of the Fourier transform of f(x, can be moved to the center of the corresponding x simply by multiplying f(x, by (-) x+y before taking the transform ote: This does not affect the magnitude of the Fourier transform Dr. D. J. Jackson Lecture 8-5 Dr. D. J. Jackson Lecture 8-6 Matlab example Matlab example (continued) %Create data for the test fzeros(8); for x:6 for y:6 f(x,8; end end % Perform a translation shift on f(x, for x:8 for y:8 f(x,f(x,*((-)^(x+); end end % Compute the -D discrete Fourier transform Ffft(f); % Compute the Fourier spectrum Fspectsqrt(real(F).^+imag(F).^); % Construct a scaling factor based on % the dynamic range of the spectrum FspectMXmax(max(Fspect)); % Compute D, the scaled data D(56/(log(+FspectMX)))*log(+Fspect); figure(); % Plot, as an image, a subset of D image(d(56:7,56:7));colormap(gray(56)); Dr. D. J. Jackson Lecture 8-7 Dr. D. J. Jackson Lecture 8-8

8 Example image and complete, scaled Fourier spectrum plot Example image and partial, scaled Fourier spectrum plot (with shifted f(x,) Dr. D. J. Jackson Lecture 8-9 Dr. D. J. Jackson Lecture 8-3

Introduction to the Fourier transform. Computer Vision & Digital Image Processing. The Fourier transform (continued) The Fourier transform (continued)

Introduction to the Fourier transform. Computer Vision & Digital Image Processing. The Fourier transform (continued) The Fourier transform (continued) Introduction to th Fourir transform Computr Vision & Digital Imag Procssing Fourir Transform Lt f(x) b a continuous function of a ral variabl x Th Fourir transform of f(x), dnotd by I {f(x)} is givn by:

More information

G52IVG, School of Computer Science, University of Nottingham

G52IVG, School of Computer Science, University of Nottingham Image Transforms Fourier Transform Basic idea 1 Image Transforms Fourier transform theory Let f(x) be a continuous function of a real variable x. The Fourier transform of f(x) is F ( u) f ( x)exp[ j2πux]

More information

Introduction to Fourier Analysis Part 2. CS 510 Lecture #7 January 31, 2018

Introduction to Fourier Analysis Part 2. CS 510 Lecture #7 January 31, 2018 Introduction to Fourier Analysis Part 2 CS 510 Lecture #7 January 31, 2018 OpenCV on CS Dept. Machines 2/4/18 CSU CS 510, Ross Beveridge & Bruce Draper 2 In the extreme, a square wave Graphic from http://www.mechatronics.colostate.edu/figures/4-4.jpg

More information

Contents. Signals as functions (1D, 2D)

Contents. Signals as functions (1D, 2D) Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component

More information

Contents. Signals as functions (1D, 2D)

Contents. Signals as functions (1D, 2D) Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component

More information

Contents. Signals as functions (1D, 2D)

Contents. Signals as functions (1D, 2D) Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component

More information

Key Intuition: invertibility

Key Intuition: invertibility Introduction to Fourier Analysis CS 510 Lecture #6 January 30, 2017 In the extreme, a square wave Graphic from http://www.mechatronics.colostate.edu/figures/4-4.jpg 2 Fourier Transform Formally, the Fourier

More information

Computer Vision & Digital Image Processing. Periodicity of the Fourier transform

Computer Vision & Digital Image Processing. Periodicity of the Fourier transform Computer Vision & Digital Image Processing Fourier Transform Properties, the Laplacian, Convolution and Correlation Dr. D. J. Jackson Lecture 9- Periodicity of the Fourier transform The discrete Fourier

More information

Fourier series: Any periodic signals can be viewed as weighted sum. different frequencies. view frequency as an

Fourier series: Any periodic signals can be viewed as weighted sum. different frequencies. view frequency as an Image Enhancement in the Frequency Domain Fourier series: Any periodic signals can be viewed as weighted sum of sinusoidal signals with different frequencies Frequency Domain: view frequency as an independent

More information

Digital Image Processing

Digital Image Processing Digital Image Processing Image Transforms Unitary Transforms and the 2D Discrete Fourier Transform DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON What is this

More information

FILTERING IN THE FREQUENCY DOMAIN

FILTERING IN THE FREQUENCY DOMAIN 1 FILTERING IN THE FREQUENCY DOMAIN Lecture 4 Spatial Vs Frequency domain 2 Spatial Domain (I) Normal image space Changes in pixel positions correspond to changes in the scene Distances in I correspond

More information

Introduction to Fourier Analysis. CS 510 Lecture #5 February 2 nd 2015

Introduction to Fourier Analysis. CS 510 Lecture #5 February 2 nd 2015 Introduction to Fourier Analysis CS 510 Lecture 5 February 2 nd 2015 Why? Get used to changing representa6ons! (and this par6cular transforma6on is ubiquitous and important) 2/9/15 CSU CS 510, Ross Beveridge

More information

Chapter 4 Image Enhancement in the Frequency Domain

Chapter 4 Image Enhancement in the Frequency Domain Chapter 4 Image Enhancement in the Frequency Domain 3. Fourier transorm -D Let be a unction o real variable,the ourier transorm o is F { } F u ep jπu d j F { F u } F u ep[ jπ u ] du F u R u + ji u or F

More information

Fourier Matching. CS 510 Lecture #7 February 8 th, 2013

Fourier Matching. CS 510 Lecture #7 February 8 th, 2013 Fourier Matching CS 510 Lecture #7 February 8 th, 2013 Details are on the assignments page you have un4l Monday Programming Assignment #1 Source (Target) Images Templates Le4 Eye Right Eye Le4 Ear Nose

More information

2. Image Transforms. f (x)exp[ 2 jπ ux]dx (1) F(u)exp[2 jπ ux]du (2)

2. Image Transforms. f (x)exp[ 2 jπ ux]dx (1) F(u)exp[2 jπ ux]du (2) 2. Image Transforms Transform theory plays a key role in image processing and will be applied during image enhancement, restoration etc. as described later in the course. Many image processing algorithms

More information

MIT 2.71/2.710 Optics 10/31/05 wk9-a-1. The spatial frequency domain

MIT 2.71/2.710 Optics 10/31/05 wk9-a-1. The spatial frequency domain 10/31/05 wk9-a-1 The spatial frequency domain Recall: plane wave propagation x path delay increases linearly with x λ z=0 θ E 0 x exp i2π sinθ + λ z i2π cosθ λ z plane of observation 10/31/05 wk9-a-2 Spatial

More information

Reference Text: The evolution of Applied harmonics analysis by Elena Prestini

Reference Text: The evolution of Applied harmonics analysis by Elena Prestini Notes for July 14. Filtering in Frequency domain. Reference Text: The evolution of Applied harmonics analysis by Elena Prestini It all started with: Jean Baptist Joseph Fourier (1768-1830) Mathematician,

More information

Lecture # 06. Image Processing in Frequency Domain

Lecture # 06. Image Processing in Frequency Domain Digital Image Processing CP-7008 Lecture # 06 Image Processing in Frequency Domain Fall 2011 Outline Fourier Transform Relationship with Image Processing CP-7008: Digital Image Processing Lecture # 6 2

More information

Image Processing 2. Hakan Bilen University of Edinburgh. Computer Graphics Fall 2017

Image Processing 2. Hakan Bilen University of Edinburgh. Computer Graphics Fall 2017 Image Processing 2 Hakan Bilen University of Edinburgh Computer Graphics Fall 2017 This week What is an image? What is image processing? Point processing Linear (Spatial) filters Frequency domain Deep

More information

Overview. Signals as functions (1D, 2D) 1D Fourier Transform. 2D Fourier Transforms. Discrete Fourier Transform (DFT) Discrete Cosine Transform (DCT)

Overview. Signals as functions (1D, 2D) 1D Fourier Transform. 2D Fourier Transforms. Discrete Fourier Transform (DFT) Discrete Cosine Transform (DCT) Fourier Transform Overview Signals as functions (1D, 2D) Tools 1D Fourier Transform Summary of definition and properties in the different cases CTFT, CTFS, DTFS, DTFT DFT 2D Fourier Transforms Generalities

More information

Lecture 4 Filtering in the Frequency Domain. Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2016

Lecture 4 Filtering in the Frequency Domain. Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2016 Lecture 4 Filtering in the Frequency Domain Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2016 Outline Background From Fourier series to Fourier transform Properties of the Fourier

More information

3 rd class Mech. Eng. Dept. hamdiahmed.weebly.com Fourier Series

3 rd class Mech. Eng. Dept. hamdiahmed.weebly.com Fourier Series Definition 1 Fourier Series A function f is said to be piecewise continuous on [a, b] if there exists finitely many points a = x 1 < x 2

More information

Mathematics 324 Riemann Zeta Function August 5, 2005

Mathematics 324 Riemann Zeta Function August 5, 2005 Mathematics 324 Riemann Zeta Function August 5, 25 In this note we give an introduction to the Riemann zeta function, which connects the ideas of real analysis with the arithmetic of the integers. Define

More information

GBS765 Electron microscopy

GBS765 Electron microscopy GBS765 Electron microscopy Lecture 1 Waves and Fourier transforms 10/14/14 9:05 AM Some fundamental concepts: Periodicity! If there is some a, for a function f(x), such that f(x) = f(x + na) then function

More information

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis SEISMIC WAVE PROPAGATION Lecture 2: Fourier Analysis Fourier Series & Fourier Transforms Fourier Series Review of trigonometric identities Analysing the square wave Fourier Transform Transforms of some

More information

ECE 425. Image Science and Engineering

ECE 425. Image Science and Engineering ECE 425 Image Science and Engineering Spring Semester 2000 Course Notes Robert A. Schowengerdt schowengerdt@ece.arizona.edu (520) 62-2706 (voice), (520) 62-8076 (fa) ECE402 DEFINITIONS 2 Image science

More information

MATLAB Laboratory 10/14/10 Lecture. Taylor Polynomials

MATLAB Laboratory 10/14/10 Lecture. Taylor Polynomials MATLAB Laboratory 10/14/10 Lecture Taylor Polynomials Lisa A. Oberbroeckling Loyola University Maryland loberbroeckling@loyola.edu L. Oberbroeckling (Loyola University) MATLAB 10/14/10 Lecture 1 / 7 Taylor/Maclaurin

More information

3. Lecture. Fourier Transformation Sampling

3. Lecture. Fourier Transformation Sampling 3. Lecture Fourier Transformation Sampling Some slides taken from Digital Image Processing: An Algorithmic Introduction using Java, Wilhelm Burger and Mark James Burge Separability ² The 2D DFT can be

More information

1 Separation of Variables

1 Separation of Variables Jim ambers ENERGY 281 Spring Quarter 27-8 ecture 2 Notes 1 Separation of Variables In the previous lecture, we learned how to derive a PDE that describes fluid flow. Now, we will learn a number of analytical

More information

Candidates are expected to have available a calculator. Only division by (x + a) or (x a) will be required.

Candidates are expected to have available a calculator. Only division by (x + a) or (x a) will be required. Revision Checklist Unit C2: Core Mathematics 2 Unit description Algebra and functions; coordinate geometry in the (x, y) plane; sequences and series; trigonometry; exponentials and logarithms; differentiation;

More information

MA 242 Review Exponential and Log Functions Notes for today s class can be found at

MA 242 Review Exponential and Log Functions Notes for today s class can be found at MA 242 Review Exponential and Log Functions Notes for today s class can be found at www.xecu.net/jacobs/index242.htm Example: If y = x n If y = x 2 then then dy dx = nxn 1 dy dx = 2x1 = 2x Power Function

More information

AMS 147 Computational Methods and Applications Lecture 13 Copyright by Hongyun Wang, UCSC

AMS 147 Computational Methods and Applications Lecture 13 Copyright by Hongyun Wang, UCSC Lecture 13 Copyright y Hongyun Wang, UCSC Recap: Fitting to exact data *) Data: ( x j, y j ), j = 1,,, N y j = f x j *) Polynomial fitting Gis phenomenon *) Cuic spline Convergence of cuic spline *) Application

More information

ECG782: Multidimensional Digital Signal Processing

ECG782: Multidimensional Digital Signal Processing Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Spring 2014 TTh 14:30-15:45 CBC C313 Lecture 05 Image Processing Basics 13/02/04 http://www.ee.unlv.edu/~b1morris/ecg782/

More information

Digital Image Processing. Image Enhancement: Filtering in the Frequency Domain

Digital Image Processing. Image Enhancement: Filtering in the Frequency Domain Digital Image Processing Image Enhancement: Filtering in the Frequency Domain 2 Contents In this lecture we will look at image enhancement in the frequency domain Jean Baptiste Joseph Fourier The Fourier

More information

Frequency2: Sampling and Aliasing

Frequency2: Sampling and Aliasing CS 4495 Computer Vision Frequency2: Sampling and Aliasing Aaron Bobick School of Interactive Computing Administrivia Project 1 is due tonight. Submit what you have at the deadline. Next problem set stereo

More information

1-D MATH REVIEW CONTINUOUS 1-D FUNCTIONS. Kronecker delta function and its relatives. x 0 = 0

1-D MATH REVIEW CONTINUOUS 1-D FUNCTIONS. Kronecker delta function and its relatives. x 0 = 0 -D MATH REVIEW CONTINUOUS -D FUNCTIONS Kronecker delta function and its relatives delta function δ ( 0 ) 0 = 0 NOTE: The delta function s amplitude is infinite and its area is. The amplitude is shown as

More information

Pre-calculus 12 Curriculum Outcomes Framework (110 hours)

Pre-calculus 12 Curriculum Outcomes Framework (110 hours) Curriculum Outcomes Framework (110 hours) Trigonometry (T) (35 40 hours) General Curriculum Outcome: Students will be expected to develop trigonometric reasoning. T01 Students will be expected to T01.01

More information

Mathematical Methods: Fourier Series. Fourier Series: The Basics

Mathematical Methods: Fourier Series. Fourier Series: The Basics 1 Mathematical Methods: Fourier Series Fourier Series: The Basics Fourier series are a method of representing periodic functions. It is a very useful and powerful tool in many situations. It is sufficiently

More information

AMS 212A Applied Mathematical Methods I Lecture 14 Copyright by Hongyun Wang, UCSC. with initial condition

AMS 212A Applied Mathematical Methods I Lecture 14 Copyright by Hongyun Wang, UCSC. with initial condition Lecture 14 Copyright by Hongyun Wang, UCSC Recap of Lecture 13 Semi-linear PDE a( x, t) u t + b( x, t)u = c ( x, t, u ) x Characteristics: dt d = a x, t dx d = b x, t with initial condition t ( 0)= t 0

More information

ECG782: Multidimensional Digital Signal Processing

ECG782: Multidimensional Digital Signal Processing Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Filtering in the Frequency Domain http://www.ee.unlv.edu/~b1morris/ecg782/ 2 Outline Background

More information

Campus Academic Resource Program Chain Rule

Campus Academic Resource Program Chain Rule This handout will: Provide a strategy to identify composite functions Provide a strategy to find chain rule by using a substitution method. Identifying Composite Functions This section will provide a strategy

More information

DISCRETE FOURIER TRANSFORM

DISCRETE FOURIER TRANSFORM DD2423 Image Processing and Computer Vision DISCRETE FOURIER TRANSFORM Mårten Björkman Computer Vision and Active Perception School of Computer Science and Communication November 1, 2012 1 Terminology:

More information

Higher-order ordinary differential equations

Higher-order ordinary differential equations Higher-order ordinary differential equations 1 A linear ODE of general order n has the form a n (x) dn y dx n +a n 1(x) dn 1 y dx n 1 + +a 1(x) dy dx +a 0(x)y = f(x). If f(x) = 0 then the equation is called

More information

The Discrete Fourier Transform

The Discrete Fourier Transform In [ ]: cd matlab pwd The Discrete Fourier Transform Scope and Background Reading This session introduces the z-transform which is used in the analysis of discrete time systems. As for the Fourier and

More information

Waves, the Wave Equation, and Phase Velocity. We ll start with optics. The one-dimensional wave equation. What is a wave? Optional optics texts: f(x)

Waves, the Wave Equation, and Phase Velocity. We ll start with optics. The one-dimensional wave equation. What is a wave? Optional optics texts: f(x) We ll start with optics Optional optics texts: Waves, the Wave Equation, and Phase Velocity What is a wave? f(x) f(x-) f(x-) f(x-3) Eugene Hecht, Optics, 4th ed. J.F. James, A Student's Guide to Fourier

More information

2D Discrete Fourier Transform (DFT)

2D Discrete Fourier Transform (DFT) 2D Discrete Fourier Transform (DFT) Outline Circular and linear convolutions 2D DFT 2D DCT Properties Other formulations Examples 2 2D Discrete Fourier Transform Fourier transform of a 2D signal defined

More information

CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation

CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University January 23, 2006 1 Exponentials The exponential is

More information

F(u) = f e(t)cos2πutdt + = f e(t)cos2πutdt i f o(t)sin2πutdt = F e(u) + if o(u).

F(u) = f e(t)cos2πutdt + = f e(t)cos2πutdt i f o(t)sin2πutdt = F e(u) + if o(u). The (Continuous) Fourier Transform Matrix Computations and Virtual Spaces Applications in Signal/Image Processing Niclas Börlin niclas.borlin@cs.umu.se Department of Computing Science, Umeå University,

More information

Name (print): Lab (circle): W8 Th8 Th11 Th2 F8. θ (radians) θ (degrees) cos θ sin θ π/ /2 1/2 π/4 45 2/2 2/2 π/3 60 1/2 3/2 π/

Name (print): Lab (circle): W8 Th8 Th11 Th2 F8. θ (radians) θ (degrees) cos θ sin θ π/ /2 1/2 π/4 45 2/2 2/2 π/3 60 1/2 3/2 π/ Name (print): Lab (circle): W8 Th8 Th11 Th2 F8 Trigonometric Identities ( cos(θ) = cos(θ) sin(θ) = sin(θ) sin(θ) = cos θ π ) 2 Cosines and Sines of common angles Euler s Formula θ (radians) θ (degrees)

More information

Advanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis. 26 October - 20 November, 2009

Advanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis. 26 October - 20 November, 2009 2065-33 Advanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis 26 October - 20 November, 2009 Introduction to two-dimensional digital signal processing Fabio Mammano University

More information

Review of Integration Techniques

Review of Integration Techniques A P P E N D I X D Brief Review of Integration Techniques u-substitution The basic idea underlying u-substitution is to perform a simple substitution that converts the intergral into a recognizable form

More information

Discrete Fourier Transform

Discrete Fourier Transform Discrete Fourier Transform DD2423 Image Analysis and Computer Vision Mårten Björkman Computational Vision and Active Perception School of Computer Science and Communication November 13, 2013 Mårten Björkman

More information

Convolution Spatial Aliasing Frequency domain filtering fundamentals Applications Image smoothing Image sharpening

Convolution Spatial Aliasing Frequency domain filtering fundamentals Applications Image smoothing Image sharpening Frequency Domain Filtering Correspondence between Spatial and Frequency Filtering Fourier Transform Brief Introduction Sampling Theory 2 D Discrete Fourier Transform Convolution Spatial Aliasing Frequency

More information

Physics 342 Lecture 2. Linear Algebra I. Lecture 2. Physics 342 Quantum Mechanics I

Physics 342 Lecture 2. Linear Algebra I. Lecture 2. Physics 342 Quantum Mechanics I Physics 342 Lecture 2 Linear Algebra I Lecture 2 Physics 342 Quantum Mechanics I Wednesday, January 27th, 21 From separation of variables, we move to linear algebra Roughly speaking, this is the study

More information

CEG4311 Digital Image Processing Dec. 21, Professor: Eric Dubois

CEG4311 Digital Image Processing Dec. 21, Professor: Eric Dubois This exam has 23 pages 1 CEG4311 Digital Image Processing Dec. 21, 2004 Final exam Duration: 3 hours Professor: Eric Dubois Closed-book exam: you may not use any books, notes or calculator. Answer all

More information

Chapter 4 Image Enhancement in the Frequency Domain

Chapter 4 Image Enhancement in the Frequency Domain Chapter 4 Image Enhancement in the Frequency Domain Yinghua He School of Computer Science and Technology Tianjin University Background Introduction to the Fourier Transform and the Frequency Domain Smoothing

More information

Chapter 3a Topics in differentiation. Problems in differentiation. Problems in differentiation. LC Abueg: mathematical economics

Chapter 3a Topics in differentiation. Problems in differentiation. Problems in differentiation. LC Abueg: mathematical economics Chapter 3a Topics in differentiation Lectures in Mathematical Economics L Cagandahan Abueg De La Salle University School of Economics Problems in differentiation Problems in differentiation Problem 1.

More information

Mathematics for Chemists 2 Lecture 14: Fourier analysis. Fourier series, Fourier transform, DFT/FFT

Mathematics for Chemists 2 Lecture 14: Fourier analysis. Fourier series, Fourier transform, DFT/FFT Mathematics for Chemists 2 Lecture 14: Fourier analysis Fourier series, Fourier transform, DFT/FFT Johannes Kepler University Summer semester 2012 Lecturer: David Sevilla Fourier analysis 1/25 Remembering

More information

Linear Operators and Fourier Transform

Linear Operators and Fourier Transform Linear Operators and Fourier Transform DD2423 Image Analysis and Computer Vision Mårten Björkman Computational Vision and Active Perception School of Computer Science and Communication November 13, 2013

More information

0J2 - Mechanics Lecture Notes 2

0J2 - Mechanics Lecture Notes 2 0J2 - Mechanics Lecture Notes 2 Work, Power, Energy Work If a force is applied to a body, which then moves, we say the force does work. In 1D, if the force is constant with magnitude F, and the body moves

More information

Ch3. Generating Random Variates with Non-Uniform Distributions

Ch3. Generating Random Variates with Non-Uniform Distributions ST4231, Semester I, 2003-2004 Ch3. Generating Random Variates with Non-Uniform Distributions This chapter mainly focuses on methods for generating non-uniform random numbers based on the built-in standard

More information

Probability Density Under Transformation

Probability Density Under Transformation Probability Density Under Transformation Pramook Khungurn September 5, 5 Introduction In creating an algorithm that samples points from some domain, a problem that always comes up is the following: Let

More information

Fourier Transform. sin(n# x)), where! = 2" / L and

Fourier Transform. sin(n# x)), where! = 2 / L and Fourier Transform Henning Stahlberg Introduction The tools provided by the Fourier transform are helpful for the analysis of 1D signals (time and frequency (or Fourier) domains), as well as 2D/3D signals

More information

42. Change of Variables: The Jacobian

42. Change of Variables: The Jacobian . Change of Variables: The Jacobian It is common to change the variable(s) of integration, the main goal being to rewrite a complicated integrand into a simpler equivalent form. However, in doing so, the

More information

Fourier Series Example

Fourier Series Example Fourier Series Example Let us compute the Fourier series for the function on the interval [ π,π]. f(x) = x f is an odd function, so the a n are zero, and thus the Fourier series will be of the form f(x)

More information

Math Practice Exam 3 - solutions

Math Practice Exam 3 - solutions Math 181 - Practice Exam 3 - solutions Problem 1 Consider the function h(x) = (9x 2 33x 25)e 3x+1. a) Find h (x). b) Find all values of x where h (x) is zero ( critical values ). c) Using the sign pattern

More information

2.6 Logarithmic Functions. Inverse Functions. Question: What is the relationship between f(x) = x 2 and g(x) = x?

2.6 Logarithmic Functions. Inverse Functions. Question: What is the relationship between f(x) = x 2 and g(x) = x? Inverse Functions Question: What is the relationship between f(x) = x 3 and g(x) = 3 x? Question: What is the relationship between f(x) = x 2 and g(x) = x? Definition (One-to-One Function) A function f

More information

Circuits and Systems I

Circuits and Systems I Circuits and Systems I LECTURE #2 Phasor Addition lions@epfl Prof. Dr. Volkan Cevher LIONS/Laboratory for Information and Inference Systems License Info for SPFirst Slides This work released under a Creative

More information

Overview of Complex Numbers

Overview of Complex Numbers Overview of Complex Numbers Definition 1 The complex number z is defined as: z = a+bi, where a, b are real numbers and i = 1. General notes about z = a + bi Engineers typically use j instead of i. Examples

More information

I. Signals & Sinusoids

I. Signals & Sinusoids I. Signals & Sinusoids [p. 3] Signal definition Sinusoidal signal Plotting a sinusoid [p. 12] Signal operations Time shifting Time scaling Time reversal Combining time shifting & scaling [p. 17] Trigonometric

More information

Lecture 24. Scott Pauls 5/21/07

Lecture 24. Scott Pauls 5/21/07 Lecture 24 Department of Mathematics Dartmouth College 5/21/07 Material from last class The heat equation α 2 u xx = u t with conditions u(x, 0) = f (x), u(0, t) = u(l, t) = 0. 1. Separate variables to

More information

The Fourier spectral method (Amath Bretherton)

The Fourier spectral method (Amath Bretherton) The Fourier spectral method (Amath 585 - Bretherton) 1 Introduction The Fourier spectral method (or more precisely, pseudospectral method) is a very accurate way to solve BVPs with smooth solutions on

More information

( ) a (graphical) transformation of y = f ( x )? x 0,2π. f ( 1 b) = a if and only if f ( a ) = b. f 1 1 f

( ) a (graphical) transformation of y = f ( x )? x 0,2π. f ( 1 b) = a if and only if f ( a ) = b. f 1 1 f Warm-Up: Solve sinx = 2 for x 0,2π 5 (a) graphically (approximate to three decimal places) y (b) algebraically BY HAND EXACTLY (do NOT approximate except to verify your solutions) x x 0,2π, xscl = π 6,y,,

More information

Physics 342 Lecture 2. Linear Algebra I. Lecture 2. Physics 342 Quantum Mechanics I

Physics 342 Lecture 2. Linear Algebra I. Lecture 2. Physics 342 Quantum Mechanics I Physics 342 Lecture 2 Linear Algebra I Lecture 2 Physics 342 Quantum Mechanics I Wednesday, January 3th, 28 From separation of variables, we move to linear algebra Roughly speaking, this is the study of

More information

Music 270a: Complex Exponentials and Spectrum Representation

Music 270a: Complex Exponentials and Spectrum Representation Music 270a: Complex Exponentials and Spectrum Representation Tamara Smyth, trsmyth@ucsd.edu Department of Music, University of California, San Diego (UCSD) October 24, 2016 1 Exponentials The exponential

More information

Fourier transforms. c n e inπx. f (x) = Write same thing in an equivalent form, using n = 1, f (x) = l π

Fourier transforms. c n e inπx. f (x) = Write same thing in an equivalent form, using n = 1, f (x) = l π Fourier transforms We can imagine our periodic function having periodicity taken to the limits ± In this case, the function f (x) is not necessarily periodic, but we can still use Fourier transforms (related

More information

G: Uniform Convergence of Fourier Series

G: Uniform Convergence of Fourier Series G: Uniform Convergence of Fourier Series From previous work on the prototypical problem (and other problems) u t = Du xx 0 < x < l, t > 0 u(0, t) = 0 = u(l, t) t > 0 u(x, 0) = f(x) 0 < x < l () we developed

More information

Equidistant curve coordinate system. Morio Kikuchi

Equidistant curve coordinate system. Morio Kikuchi Equidistant curve coordinate system Morio Kiuchi Abstract: An isometry is realized between Poincaré dis of which radius is not limited to 1 and upper half-plane. Poincaré metrics are the same in both regions

More information

Mathematical Review for Signal and Systems

Mathematical Review for Signal and Systems Mathematical Review for Signal and Systems 1 Trigonometric Identities It will be useful to memorize sin θ, cos θ, tan θ values for θ = 0, π/3, π/4, π/ and π ±θ, π θ for the above values of θ. The following

More information

Image Enhancement in the frequency domain. Inel 5046 Prof. Vidya Manian

Image Enhancement in the frequency domain. Inel 5046 Prof. Vidya Manian Image Enhancement in the frequency domain Inel 5046 Prof. Vidya Manian Introduction 2D Fourier transform Basics of filtering in frequency domain Ideal low pass filter Gaussian low pass filter Ideal high

More information

VII. Bandwidth Limited Time Series

VII. Bandwidth Limited Time Series VII. Bandwidth Limited Time Series To summarize the discussion up to this point: (1) In the general case of the aperiodic time series, which is infinite in time and frequency, both the time series and

More information

PreCalculus Honors Curriculum Pacing Guide First Half of Semester

PreCalculus Honors Curriculum Pacing Guide First Half of Semester Unit 1 Introduction to Trigonometry (9 days) First Half of PC.FT.1 PC.FT.2 PC.FT.2a PC.FT.2b PC.FT.3 PC.FT.4 PC.FT.8 PC.GCI.5 Understand that the radian measure of an angle is the length of the arc on

More information

Math 1272 Solutions for Fall 2005 Final Exam

Math 1272 Solutions for Fall 2005 Final Exam Math 7 Solutions for Fall 5 Final Exam ) This fraction appears in Problem 5 of the undated-? exam; a solution can be found in that solution set. (E) ) This integral appears in Problem 6 of the Fall 4 exam;

More information

Conditional Distributions

Conditional Distributions Conditional Distributions The goal is to provide a general definition of the conditional distribution of Y given X, when (X, Y ) are jointly distributed. Let F be a distribution function on R. Let G(,

More information

Milford Public Schools Curriculum. Department: Mathematics Course Name: Precalculus Level 1

Milford Public Schools Curriculum. Department: Mathematics Course Name: Precalculus Level 1 Milford Public Schools Curriculum Department: Mathematics Course Name: Precalculus Level 1 UNIT 1 Unit Description: Students will construct polynomial graphs with zeros and end behavior, and apply limit

More information

Indefinite Integration

Indefinite Integration Indefinite Integration 1 An antiderivative of a function y = f(x) defined on some interval (a, b) is called any function F(x) whose derivative at any point of this interval is equal to f(x): F'(x) = f(x)

More information

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 = Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values

More information

1 Wyner PreCalculus Fall 2013

1 Wyner PreCalculus Fall 2013 1 Wyner PreCalculus Fall 2013 CHAPTER ONE: FUNCTIONS AND THEIR GRAPHS Summary, Terms, and Objectives Most of calculus and precalculus is based on functions. A function is a process that takes one or more

More information

Math Precalculus Blueprint Assessed Quarter 1

Math Precalculus Blueprint Assessed Quarter 1 PO 11. Find approximate solutions for polynomial equations with or without graphing technology. MCWR-S3C2-06 Graphing polynomial functions. MCWR-S3C2-12 Theorems of polynomial functions. MCWR-S3C3-08 Polynomial

More information

Algebra 2. Chapter 4 Exponential and Logarithmic Functions. Chapter 1 Foundations for Functions. Chapter 3 Polynomial Functions

Algebra 2. Chapter 4 Exponential and Logarithmic Functions. Chapter 1 Foundations for Functions. Chapter 3 Polynomial Functions Algebra 2 Chapter 1 Foundations for Chapter 2 Quadratic Chapter 3 Polynomial Chapter 4 Exponential and Logarithmic Chapter 5 Rational and Radical Chapter 6 Properties and Attributes of Chapter 7 Probability

More information

Convolution/Modulation Theorem. 2D Convolution/Multiplication. Application of Convolution Thm. Bioengineering 280A Principles of Biomedical Imaging

Convolution/Modulation Theorem. 2D Convolution/Multiplication. Application of Convolution Thm. Bioengineering 280A Principles of Biomedical Imaging Bioengineering 8A Principles of Biomedical Imaging Fall Quarter 15 CT/Fourier Lecture 4 Convolution/Modulation Theorem [ ] e j πx F{ g(x h(x } = g(u h(x udu = g(u h(x u e j πx = g(uh( e j πu du = H( dxdu

More information

Information and Communications Security: Encryption and Information Hiding

Information and Communications Security: Encryption and Information Hiding Short Course on Information and Communications Security: Encryption and Information Hiding Tuesday, 10 March Friday, 13 March, 2015 Lecture 5: Signal Analysis Contents The complex exponential The complex

More information

Gradient, Divergence and Curl in Curvilinear Coordinates

Gradient, Divergence and Curl in Curvilinear Coordinates Gradient, Divergence and Curl in Curvilinear Coordinates Although cartesian orthogonal coordinates are very intuitive and easy to use, it is often found more convenient to work with other coordinate systems.

More information

LECTURE 19: SEPARATION OF VARIABLES, HEAT CONDUCTION IN A ROD

LECTURE 19: SEPARATION OF VARIABLES, HEAT CONDUCTION IN A ROD ECTURE 19: SEPARATION OF VARIABES, HEAT CONDUCTION IN A ROD The idea of separation of variables is simple: in order to solve a partial differential equation in u(x, t), we ask, is it possible to find a

More information

Math 265 (Butler) Practice Midterm III B (Solutions)

Math 265 (Butler) Practice Midterm III B (Solutions) Math 265 (Butler) Practice Midterm III B (Solutions). Set up (but do not evaluate) an integral for the surface area of the surface f(x, y) x 2 y y over the region x, y 4. We have that the surface are is

More information

Logarithmic, Exponential, and Other Transcendental Functions

Logarithmic, Exponential, and Other Transcendental Functions 5 Logarithmic, Exponential, and Other Transcendental Functions Copyright Cengage Learning. All rights reserved. 1 5.3 Inverse Functions Copyright Cengage Learning. All rights reserved. 2 Objectives Verify

More information

Math 10C - Fall Final Exam

Math 10C - Fall Final Exam Math 1C - Fall 217 - Final Exam Problem 1. Consider the function f(x, y) = 1 x 2 (y 1) 2. (i) Draw the level curve through the point P (1, 2). Find the gradient of f at the point P and draw the gradient

More information

3. On the grid below, sketch and label graphs of the following functions: y = sin x, y = cos x, and y = sin(x π/2). π/2 π 3π/2 2π 5π/2

3. On the grid below, sketch and label graphs of the following functions: y = sin x, y = cos x, and y = sin(x π/2). π/2 π 3π/2 2π 5π/2 AP Physics C Calculus C.1 Name Trigonometric Functions 1. Consider the right triangle to the right. In terms of a, b, and c, write the expressions for the following: c a sin θ = cos θ = tan θ =. Using

More information

BOOK CORRECTIONS, CLARIFICATIONS, AND CORRECTIONS TO PROBLEM SOLUTIONS

BOOK CORRECTIONS, CLARIFICATIONS, AND CORRECTIONS TO PROBLEM SOLUTIONS Digital Image Processing, nd Ed. Gonzalez and Woods Prentice Hall 00 BOOK CORRECTIONS, CLARIFICATIONS, AND CORRECTIONS TO PROBLEM SOLUTIONS NOTE: Depending on the country in which you purchase the book,

More information

We know that f(x, y) and F (u, v) form a Fourier Transform pair, i.e. f(ax, by)e j2π(ux+vy) dx dy. x x. a 0 J = y y. = 0 b

We know that f(x, y) and F (u, v) form a Fourier Transform pair, i.e. f(ax, by)e j2π(ux+vy) dx dy. x x. a 0 J = y y. = 0 b 2 2 Problem 2:[10 pts] We know that f(x, y) and F (u, v) form a Fourier Transform pair, i.e. F (u, v) = Now, consider the integral G(u, v) = We make a change of variables [ x x ỹ x f(x, y)e j2π(ux+vy)

More information