The Fourier Transform

Similar documents
The Fourier Transform

IMGS-261 Solutions to Homework #9

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

Fourier Transform. Additive noise. Fourier Tansform. I = S + N. Noise doesn t depend on signal. We ll consider:

Digital Signal Processing

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

Nice plotting of proteins II

Solution Set #1

Frequency-Domain Analysis of Transmission Line Circuits (Part 1)

CIVL 8/7117 Chapter 10 - Isoparametric Formulation 42/56

Report on Image warping

Chapter 4: Root Finding

Section 8.3 Polar Form of Complex Numbers

Georgia Tech PHYS 6124 Mathematical Methods of Physics I

The Concept of Beamforming

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

Statistical analysis using matlab. HY 439 Presented by: George Fortetsanakis

APPENDIX A Some Linear Algebra

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Correlation and Regression. Correlation 9.1. Correlation. Chapter 9

NUMERICAL DIFFERENTIATION

Numerical Methods. ME Mechanical Lab I. Mechanical Engineering ME Lab I

Complex Numbers, Signals, and Circuits

Solutions to Problem Set 6

AS-Level Maths: Statistics 1 for Edexcel

ECE 472/572 - Digital Image Processing. Roadmap. Questions. Lecture 6 Geometric and Radiometric Transformation 09/27/11

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Solutions to Homework 7, Mathematics 1. 1 x. (arccos x) (arccos x) 1

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Notes prepared by Prof Mrs) M.J. Gholba Class M.Sc Part(I) Information Technology

Why Monte Carlo Integration? Introduction to Monte Carlo Method. Continuous Probability. Continuous Probability

Least squares cubic splines without B-splines S.K. Lucas

Quadratic speedup for unstructured search - Grover s Al-

9. Complex Numbers. 1. Numbers revisited. 2. Imaginary number i: General form of complex numbers. 3. Manipulation of complex numbers

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

NON-LINEAR CONVOLUTION: A NEW APPROACH FOR THE AURALIZATION OF DISTORTING SYSTEMS

Grover s Algorithm + Quantum Zeno Effect + Vaidman

THE HARTLEY TRANSFORM IN A FINITE FIELD

What would be a reasonable choice of the quantization step Δ?

Digital Modems. Lecture 2

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

CS 3710: Visual Recognition Classification and Detection. Adriana Kovashka Department of Computer Science January 13, 2015

χ x B E (c) Figure 2.1.1: (a) a material particle in a body, (b) a place in space, (c) a configuration of the body

Complex Numbers Alpha, Round 1 Test #123

Error Bars in both X and Y

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

(δr i ) 2. V i. r i 2,

Modeling curves. Graphs: y = ax+b, y = sin(x) Implicit ax + by + c = 0, x 2 +y 2 =r 2 Parametric:

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1

1 Matrix representations of canonical matrices

Module 2. Random Processes. Version 2 ECE IIT, Kharagpur

Linear Classification, SVMs and Nearest Neighbors

= z 20 z n. (k 20) + 4 z k = 4

Orthogonal Functions and Fourier Series. University of Texas at Austin CS384G - Computer Graphics Spring 2010 Don Fussell

Chapter 7 Channel Capacity and Coding

However, since P is a symmetric idempotent matrix, of P are either 0 or 1 [Eigen-values

Originated from experimental optimization where measurements are very noisy Approximation can be actually more accurate than

UNIT 3 EXPRESSIONS AND EQUATIONS Lesson 4: Fundamental Theorem of Algebra. Instruction. Guided Practice Example 1

Affine and Riemannian Connections

Digital Filter Examples

Kinematics of Fluids. Lecture 16. (Refer the text book CONTINUUM MECHANICS by GEORGE E. MASE, Schaum s Outlines) 17/02/2017

( ) [ ( k) ( k) ( x) ( ) ( ) ( ) [ ] ξ [ ] [ ] [ ] ( )( ) i ( ) ( )( ) 2! ( ) = ( ) 3 Interpolation. Polynomial Approximation.

Designing Information Devices and Systems II Spring 2018 J. Roychowdhury and M. Maharbiz Discussion 3A

Line Drawing and Clipping Week 1, Lecture 2

Section 3.6 Complex Zeros

Limited Dependent Variables

Four Bar Linkages in Two Dimensions. A link has fixed length and is joined to other links and also possibly to a fixed point.

4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA

From Biot-Savart Law to Divergence of B (1)

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.

Lossy Compression. Compromise accuracy of reconstruction for increased compression.

12. The Hamilton-Jacobi Equation Michael Fowler

Statistical Inference. 2.3 Summary Statistics Measures of Center and Spread. parameters ( population characteristics )

Section 8.1 Exercises

A New Design Approach for Recursive Diamond-Shaped Filters

Lecture 3: Shannon s Theorem

The Fundamental Theorem of Algebra. Objective To use the Fundamental Theorem of Algebra to solve polynomial equations with complex solutions

For all questions, answer choice E) NOTA" means none of the above answers is correct.

Hidden Markov Models & The Multivariate Gaussian (10/26/04)

SIMG Solution Set #5

Lecture 12: Discrete Laplacian

Numerical Heat and Mass Transfer

Chapter Newton s Method

SCALARS AND VECTORS All physical quantities in engineering mechanics are measured using either scalars or vectors.

Lesson 16: Basic Control Modes

Lecture 2 Solution of Nonlinear Equations ( Root Finding Problems )

p 1 c 2 + p 2 c 2 + p 3 c p m c 2

Support Vector Machines. Vibhav Gogate The University of Texas at dallas

1. Inference on Regression Parameters a. Finding Mean, s.d and covariance amongst estimates. 2. Confidence Intervals and Working Hotelling Bands

THEOREMS OF QUANTUM MECHANICS

CHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION

PhysicsAndMathsTutor.com

Chapter 4. Velocity analysis

Pattern Classification

IRO0140 Advanced space time-frequency signal processing

332600_08_1.qxp 4/17/08 11:29 AM Page 481

PHYS 705: Classical Mechanics. Canonical Transformation II

SGNoise and AGDas - tools for processing of superconducting and absolute gravity data Vojtech Pálinkáš and Miloš Vaľko

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.

Computational Astrophysics

Transcription:

e Processng ourer Transform D The ourer Transform Effcent Data epresentaton Dscrete ourer Transform - D Contnuous ourer Transform - D Eamples + + + Jean Baptste Joseph ourer Effcent Data epresentaton Data can be represented n many ways. There s a great advantage usng an approprate representaton. Eamples: Equalzers n Stereo systems. osy ponts along a lne Color space red/green/blue v.s. Hue/Brghtness How can we enhance such an mage? 4

Soluton: e epresentaton Transforms 5 8 7 5 + +. Bass unctons.. Method for fndng the mage gven the transform coeffcents. + + 5 +.... Method for fndng the transform coeffcents gven the mage. + + Y Coordnate Grayscale e V Coordnates Transformed e + + 7 +... X Coordnate U Coordnates 5 6 epresentaton n dfferent bases It s possble to go bac and forth between representatons: u () a v, u u ( ) u a a a v The Inner Product Dscrete vectors (real numbers): a,b T a b () b() Dscrete vectors (comple numbers): a,b H a b a The vector a H denotes the conjugate transpose of a. a * () b() u v a u Contnuous functons: f * ( ),g( ) f ( ) g( ) d v 7 8

The ourer bass functons Bass unctons are snes and cosnes Every functon equals a sum of snes and cosnes sn() cos() sn() A sn(4) + sn() B A+B The transform coeffcents determne the ampltude and phase: +.8 sn(5) C A+B+C +.4 sn(7) D A+B+C+D a sn() a sn() -a sn() 9 Sum of cosnes only Sum of snes only symmetrc functons antsymmetrc functons ourer Coeffcents f() C + C cos() + S sn() +... + C cos() + S sn() +... Terms are consdered n pars: C cos() + S sn() sn( + ) where C + S and tan S C Usng Comple umbers: { { cos(), sn() e C cos() + S sn() e e Ampltude+phase

The nverse Contnuous ourer Transform composes a sgnal f() gven (): f ( ) The D Contnues ourer Transform The Contnuous ourer Transform fnds the () gven the (cont.) sgnal f(): π ( ) f() e d B ()e π s a comple wave functon for each (contnues) gven. π ( ) e d Contnuous vs sampled Sgnals Samplng: Move from f() ( ) to f() ( Z) by samplng at equal ntervals. f( ), f( + ), f( + ),..., f( +[n-] ), Gven samples at equal ntervals, we redefne f as: 4 f() f( + ),,,..., - f() f( + ) f( + ) f( ) f( + ).5.5.75..5 4 f() f( + ) () and f() are contnues. 4 The dscrete bass functons are e π.. or each frequency the ourer coeffcent s: π π / ( e ) e π C cos + S sn ( ) e The Dscrete ourer Transform (DT) ( ) f ( ) π ( ) f, e ( ) Matlab: fft(f); e f( ) e π π,,,..., - The Inverse Dscrete ourer Transform (IDT) s defned as:,,,..., - Matlab: fft(f); emar: ormalzaton constant mght be dfferent! 5 6 4

Dscrete ourer Transform - Eample () Σ f() e 4 Σ f() -π f() [ 4 4] (f() + f() + f() + f()) (++4+4) () -π Σ f() e 4 [e +e -π/ +4e π +4e -π/ ] [-+] () -4π Σ f() e 4 [e +e -π +4e π +4e -π ] [--] - () -6π Σ f() e 4 [e +e -π/ +4e π +4e -9π/ ] [--] DT of [ 4 4] s [ (-+) - (--) ] The ourer Transform - Summary () s the ourer transform of f(): { f( ) } ( ) ~ f() s the nverse ourer transform of (): ~ { ( ) } f( ) f() and () are a ourer par. f() s a representaton of the sgnal n the Spatal Doman and () s a representaton n the requency Doman. 7 8 The ourer transform () s a functon over the comple numbers: The requency Doman f() ( ) e tells us how much of frequency s needed. tells us the shft of the Sne wave wth frequency. The sgnal f() Alternatvely: ( ) e ( ) a b + a tells us how much of cos wth frequency s needed. b tells us how much of sn wth frequency s needed. ( ) a b + Ampltude (spectrum) and Phase and nary 9 5

- s the ampltude of (). - s the phase of (). * () () - s the power spectrum of (). If a sgnal f() has a lot of fne detals wll be hgh for hgh. If the sgnal f() s "smooth" wll be low for hgh. sn() Why do we need representaton n the frequency doman? Problem n requency Space ourer Transform Orgnal Problem elatvely easy soluton Dffcult soluton Soluton n requency Space Inverse ourer Transform Soluton of Orgnal Problem + sn() +.8 sn(5) +.4 sn(7) The Delta uncton: Eamples: Let f( ) δ( ) π ( ) δ( ) e d f() lm g δ( ) ; δ( ) d ( ) δ( ( ) ) d g The Constant uncton: Let f ( ) π ( ) e d δ( ) f() ourer ourer 4 6

A Bass uncton: Let f () e π π π ( ) e e d e π( ) f() d δ( ) The Cosne wave: Let ( ) cos( π ) f δ + δ + π π π ( ) ( e + e ) e d [ ( ) ( )] f() ourer ourer - - 5 6 The Sne wave: Let ( ) sn( π ) f π π π ( ) ( e e ) e d [ δ ( + ) δ ( )] f() The Wndow uncton (rect): Let ( ) rect (.5 π e.5 f < ) otherwse ( π ) sn d π f() snc ( π ) ourer -.5.5 ourer - π/ -π/ - 7 8 7

Proof: The Gaussan: -/ / ( ) f() rect / () { f()e π d / / e π d / otherwse Let f ( ) e ( ) f() e π π [ e π ] / / π π π [ π π e e ] [ cos( π) sn( π) cos( π) sn( π) ] ourer sn( π ) SIC ( ) π snc() () 9 The Comb uncton: Let () δ( mod ) c ~ { c } δ mod C ( ) f() c () ourer / C / () End 8