Lecture 6: Fourier Transform

Slides:



Advertisements
Similar presentations
Continuous-Time Fourier Transform
Advertisements

Signal Processing in the Discrete Time Domain Microprocessor Applications (MEE4033) Sogang University Department of Mechanical Engineering.
Computer Vision Lecture 7: The Fourier Transform
Lecture 7: Basis Functions & Fourier Series
Fourier Transform – Chapter 13. Fourier Transform – continuous function Apply the Fourier Series to complex- valued functions using Euler’s notation to.
Properties of continuous Fourier Transforms
Reminder Fourier Basis: t  [0,1] nZnZ Fourier Series: Fourier Coefficient:
Autumn Analog and Digital Communications Autumn
Lecture 8: Fourier Series and Fourier Transform
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
CH#3 Fourier Series and Transform
Systems: Definition Filter
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm.
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Discrete-Time and System (A Review)
1 Let g(t) be periodic; period = T o. Fundamental frequency = f o = 1/ T o Hz or  o = 2  / T o rad/sec. Harmonics =n f o, n =2,3 4,... Trigonometric.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Linearity Time Shift and Time Reversal Multiplication Integration.
CISE315 SaS, L171/16 Lecture 8: Basis Functions & Fourier Series 3. Basis functions: Concept of basis function. Fourier series representation of time functions.
Signal and Systems Prof. H. Sameti Chapter 5: The Discrete Time Fourier Transform Examples of the DT Fourier Transform Properties of the DT Fourier Transform.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Husheng Li, UTK-EECS, Fall  Fourier transform is used to study the frequency spectrum of signals.  Basically, it says that a signal can be represented.
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
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.
Fourier Transform.
Fourier and Wavelet Transformations Michael J. Watts
ECE 8443 – Pattern Recognition ECE 3163 – Signals and Systems Objectives: Frequency Response Response of a Sinusoid DT MA Filter Filter Design DT WMA Filter.
Ch # 11 Fourier Series, Integrals, and Transform 1.
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
CH#3 Fourier Series and Transform 1 st semester King Saud University College of Applied studies and Community Service 1301CT By: Nour Alhariqi.
Math for CS Fourier Transforms
Computer Vision – 2D Signal & System Hanyang University Jong-Il Park.
EE104: Lecture 6 Outline Announcements: HW 1 due today, HW 2 posted Review of Last Lecture Additional comments on Fourier transforms Review of time window.
Math for CS Fourier Transform
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Lecture 7: Basis Functions & Fourier Series
Jean Baptiste Joseph Fourier
Review of DSP.
Research Institute for Future Media Computing
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Digital Signal Processing Lecture 4 DTFT
Fourier and Wavelet Transformations
EE Audio Signals and Systems
UNIT II Analysis of Continuous Time signal
Outline Linear Shift-invariant system Linear filters
2D Fourier transform is separable
EE 638: Principles of Digital Color Imaging Systems
CT-321 Digital Signal Processing
Outline Linear Shift-invariant system Linear filters
Advanced Digital Signal Processing
Notes Assignments Tutorial problems
Basic Image Processing
HKN ECE 210 Exam 3 Review Session
Fourier Transform and Spectra
Signals & Systems (CNET - 221) Chapter-4 Fourier Series
Signals & Systems (CNET - 221) Chapter-5 Fourier Transform
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Continuous-Time Fourier Transform
Signals & Systems (CNET - 221) Chapter-4
Lecture 11: Quality Assessment
LECTURE 20: FOURIER ANALYSIS OF DT SYSTEMS
Chapter 3 Sampling.
Lecture 7: Signal Processing
Lecture 13: CT Reconstruction
Biomedical Imaging Center
Review of DSP.
Biomedical Imaging Center
Matlab Tutorial #2 Kathleen Chen February 13, 2018.
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Presentation transcript:

Lecture 6: Fourier Transform 38655 BMED-2300-02 Lecture 6: Fourier Transform Ge Wang, PhD Biomedical Imaging Center CBIS/BME, RPI wangg6@rpi.edu February 2, 2018

BB Schedule for S18 Tue Topic Fri 1/16 Introduction 1/19 MatLab I (Basics) 1/23 System 1/26 Convolution 1/30 Fourier Series 2/02 Fourier Transform 2/06 Signal Processing 2/09 Discrete FT & FFT 2/13 MatLab II (Homework) 2/16 Network 2/20 No Class 2/23 Exam I 2/27 Quality & Performance 3/02 X-ray & Radiography 3/06 CT Reconstruction 3/09 CT Scanner 3/20 MatLab III (CT) 3/23 Nuclear Physics 3/27 PET & SPECT 3/30 MRI I 4/03 Exam II 4/06 MRI II 4/10 MRI III 4/13 Ultrasound I 4/17 Ultrasound II 4/20 Optical Imaging 4/24 Machine Learning 4/27 Exam III Office Hour: Ge Tue & Fri 3-4 @ CBIS 3209 | wangg6@rpi.edu Kathleen Mon 4-5 & Thurs 4-5 @ JEC 7045 | chens18@rpi.edu

As a Sum of Impulses

As Sum of Waves

Fourier Series (Real Form)

Fourier Series (Complex Form) Unit Period

When Period Isn’t Unit

Common Sense Simple versus Complex Methods Divide and Conquer Strategies

Outline

When Period Isn’t Unit

Inserting Coefficients Right Hand Side: Inner products at infinitely many discrete frequency points u=n/T, and for a sufficiently large T and all integer n the interval for u is dense on the whole number axis, and the distance between adjacent frequencies is infinitesimal Δu=1/T.

Δu=1/T u u=n/T -T/2 T/2 Inner products at many discrete points u=n/T, and for a sufficiently large T and all integer n the interval for u is dense on the whole axis, and the distance between adjacent frequencies is infinitesimal Δu=1/T.

Forward & Inverse Transforms (since u=n/T) (since du=1/T)

Rectangular/Gate Function

Periodization

As Period Gets Larger

Fourier Transform Pair

Example 1: Gate Function

Sinc Function

Example 2: Triangle Function

Sinc2

More Examples

Basic Properties

Linearity

Shift

Scaling

Example

Derivation

Paired Combs

Convolution Theorem

Why?

Why? For a shift-invariant linear system, a sinusoidal input will only generate a sinusoidal output at the same frequency. Therefore, a convolution in the t-domain must be a multiplication in the Fourier domain. The above invariability only holds for sinusoidal functions. Therefore, the convolution theorem exists only with the Fourier transform. If you are interested, you could write a paper out of these comments.

Parseval's Identity

Why?

2D Fourier Transform

Noise Suppression FT IFT

Low-/High-pass Filtering

Example: 2D Rectangle Function Rectangle of Sides X and Y, Centered at Origin

Rotation Property

Why?

Homework for BB06 Read about the uncertainty property of Fourier transform, and write no more than three sentences to explain what it is. Analytically compute the Fourier transform of exp(bt)u(-t), where b is positive, u(t) is the step function (u(t)=1 for positive t and 0 otherwise). Due date: One week from now (by midnight next Friday). Please upload your report to MLS. https://www.youtube.com/watch?v=1hX_MUh8wfk