Research Institute for Future Media Computing

Slides:



Advertisements
Similar presentations
DCSP-11 Jianfeng Feng
Advertisements

Fourier Transform and its Application in Image Processing
1 Chapter 16 Fourier Analysis with MATLAB Fourier analysis is the process of representing a function in terms of sinusoidal components. It is widely employed.
Computer Graphics Recitation 6. 2 Motivation – Image compression What linear combination of 8x8 basis signals produces an 8x8 block in the image?
FFT-based filtering and the Short-Time Fourier Transform (STFT) R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2003.
MSP15 The Fourier Transform (cont’) Lim, MSP16 The Fourier Series Expansion Suppose g(t) is a transient function that is zero outside the interval.
Image Fourier Transform Faisal Farooq Q: How many signal processing engineers does it take to change a light bulb? A: Three. One to Fourier transform the.
Time and Frequency Representation
Unit 7 Fourier, DFT, and FFT 1. Time and Frequency Representation The most common representation of signals and waveforms is in the time domain Most signal.
Discrete Time Periodic Signals A discrete time signal x[n] is periodic with period N if and only if for all n. Definition: Meaning: a periodic signal keeps.
The Frequency Domain Sinusoidal tidal waves Copy of Katsushika Hokusai The Great Wave off Kanagawa at
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU A New Algorithm to Compute the Discrete Cosine Transform VLSI Signal Processing 台灣大學電機系.
DSP for Dummies aka How to turn this (actual raw sonar trace) Into this.. (filtered sonar data)
Discrete-Time and System (A Review)
Numerical Analysis – Digital Signal Processing Hanyang University Jong-Il Park.
Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 19.
The Discrete Fourier Transform 主講人:虞台文. Content Introduction Representation of Periodic Sequences – DFS (Discrete Fourier Series) Properties of DFS The.
Radix-2 2 Based Low Power Reconfigurable FFT Processor Presented by Cheng-Chien Wu, Master Student of CSIE,CCU 1 Author: Gin-Der Wu and Yi-Ming Liu Department.
Chapter 4 Fourier transform Prepared by Dr. Taha MAhdy.
Fourier series: Eigenfunction Approach
Fourier Analysis of Discrete Time Signals
Fast Fourier Transform & Assignment 2
Fourier Series Fourier Transform Discrete Fourier Transform ISAT 300 Instrumentation and Measurement Spring 2000.
Inverse DFT. Frequency to time domain Sometimes calculations are easier in the frequency domain then later convert the results back to the time domain.
CH#3 Fourier Series and Transform
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.
ES97H Biomedical Signal Processing
ES97H Biomedical Signal Processing
revision Transfer function. Frequency Response
Digital Signal Processing. Discrete Fourier Transform Inverse Discrete Fourier Transform.
Fourier Transform.
Computer Graphics & Image Processing Chapter # 4 Image Enhancement in Frequency Domain 2/26/20161.
Eeng Chapter 2 Discrete Fourier Transform (DFT) Topics:  Discrete Fourier Transform. Using the DFT to Compute the Continuous Fourier Transform.
The Fourier Transform.
Husheng Li, UTK-EECS, Fall The specification of filter is usually given by the tolerance scheme.  Discrete Fourier Transform (DFT) has both discrete.
 Carrier signal is strong and stable sinusoidal signal x(t) = A cos(  c t +  )  Carrier transports information (audio, video, text, ) across.
Fourier Analysis Patrice Koehl Department of Biological Sciences National University of Singapore
Signals & systems Ch.3 Fourier Transform of Signals and LTI System
Chapter 4 Discrete-Time Signals and transform
Jean Baptiste Joseph Fourier
The content of lecture This lecture will cover: Fourier Transform
Section II Digital Signal Processing ES & BM.
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
MECH 373 Instrumentation and Measurements
3.1 Introduction Why do we need also a frequency domain analysis (also we need time domain convolution):- 1) Sinusoidal and exponential signals occur.
FFT-based filtering and the
MECH 373 Instrumentation and Measurements
Dr. Nikos Desypris, Oct Lecture 3
Chapter 5 Z Transform.
Time domain & frequency domain
Discrete Fourier Transform (DFT)
UNIT II Analysis of Continuous Time signal
2D Fourier transform is separable
Research Institute for Future Media Computing
4.1 DFT In practice the Fourier components of data are obtained by digital computation rather than by analog processing. The analog values have to be.
Discrete-Time Complex
The Fractional Fourier Transform and Its Applications
Lecture 17 DFT: Discrete Fourier Transform
LECTURE 18: FAST FOURIER TRANSFORM
Chapter 2 Discrete Fourier Transform (DFT)
1-D DISCRETE COSINE TRANSFORM DCT
Research Institute for Future Media Computing
Research Institute for Future Media Computing
 = N  N matrix multiplication N = 3 matrix N = 3 matrix N = 3 matrix
Lesson Week 8 Fourier Transform of Time Functions (DC Signal, Periodic Signals, and Pulsed Cosine)
Research Institute for Future Media Computing
C H A P T E R 21 Fourier Series.
Lec.6:Discrete Fourier Transform and Signal Spectrum
LECTURE 18: FAST FOURIER TRANSFORM
Presentation transcript:

Research Institute for Future Media Computing 未来媒体技术与计算研究所 Research Institute for Future Media Computing http://futuremedia.szu.edu.cn 4. Fourier Transform 江健民,国家千人计划特聘教授 深圳大学未来媒体技术与计算研究所所长 Office Room: 409 Email: jianmin.jiang@szu.edu.cn http://futuremedia.szu.edu.cn

4.1 Fourier Transform Theorem-1: Any function f(t) can be decomposed into harmonic terms, which contain one constant and infinite number of sinusoidal and cosinusoidal terms; Where ω=2πf is known as the fundamental angular frequency, f=1/T is the fundamental frequency, and T is the period of the corresponding harmonic element inside f(t).

Theorem-2(Fourier transform definition): Any function of time t can be transformed into frequency domain and vice versa, which is referred to as Fourier transform; Theorem-3 (discrete Fourier transform): Any discrete function, sampled at a regular time interval T, can be transformed into frequency domain via discrete Fourier transform, which is defined as:

Example: Given a sequence x(nT)={x(0), x(T), x(2T), x(3T)}={1, 0, 0, 1}, calculate its DFT and plot the signal’s strength with respect to the frequency kΩ. Solution:

3Ω 4Ω 2Ω Ω kΩ +45 -45 Plots: 3Ω 4Ω 2Ω Ω kΩ Inverse transform:

Fast Fourier Transform(FFT)

Fourier transform applications (1) System analysis: (2) Signal analysis: (3) Filtering: (4) Research: [1] Wei D. and Li Y. ‘Generalized sampling expansions with multiple sampling rates for lowass and bandpass signals in the fractional Fourier transform domain’, IEEE Transactions on Signal Processing, Vol 64, pp4861-4874, Sept. 2016; [2] Zhao Y., Yu H. and Wei G. ‘Parameter estimation of wideband underwater acoustic multipath channels based on fractional Fourier transform’, IEEE Transactions on Signal Processing, Vol 64, pp5396-5408, Oct 15, 2016; [3] Tian N., Zhang X. et al ‘Two-dimensional discrete fractional Fourier transform-based content removal algorithm’, Signal Image & Video Processing, Vol 10, pp1311-1318, 2016; [4] Akin B. et al ‘FFTs with near-optimal memory access through block data layouts algorithm architecture and design automation’, Journal of Signal Processing Systems for Signal Image & Video Technology, Vol 85, pp67-82, 2016;