Short Time Fourier Transform (STFT)

Slides:



Advertisements
Similar presentations
[1] AN ANALYSIS OF DIGITAL WATERMARKING IN FREQUENCY DOMAIN.
Advertisements

Frequency analysis.
Wavelet Transform A Presentation
DCSP-13 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-11 Jianfeng Feng
Islamic university of Gaza Faculty of engineering Electrical engineering dept. Submitted to: Dr.Hatem Alaidy Submitted by: Ola Hajjaj Tahleel.
Transform Techniques Mark Stamp Transform Techniques.
Applications in Signal and Image Processing
Fourier Transform (Chapter 4)
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.
Let’s go back to this problem: We take N samples of a sinusoid (or a complex exponential) and we want to estimate its amplitude and frequency by the FFT.
Time-Frequency Analysis of Non-stationary Phenomena in Electrical Engineering Antonio Bracale, Guido Carpinelli Universita degli Studi di Napoli “Federico.
An Introduction to S-Transform for Time-Frequency Analysis S.K. Steve Chang SKC-2009.
Wavelets (Chapter 7) CS474/674 – Prof. Bebis.
Time and Frequency Representations Accompanying presentation Kenan Gençol presented in the course Signal Transformations instructed by Prof.Dr. Ömer Nezih.
Lecture 17 spectral analysis and power spectra. Part 1 What does a filter do to the spectrum of a time series?
EECS 20 Chapter 10 Part 11 Fourier Transform In the last several chapters we Viewed periodic functions in terms of frequency components (Fourier series)
Time-Frequency and Time-Scale Analysis of Doppler Ultrasound Signals
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communication Systems ECE Spring 2008 Shreekanth Mandayam ECE Department Rowan University.
With Applications in Image Processing
Presents.
Wavelet Transform. What Are Wavelets? In general, a family of representations using: hierarchical (nested) basis functions finite (“compact”) support.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2007 Shreekanth Mandayam ECE Department Rowan University.
Introduction to Wavelets
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communication Systems ECE Spring 2009 Shreekanth Mandayam ECE Department Rowan University.
Wavelet-based Coding And its application in JPEG2000 Monia Ghobadi CSC561 project
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
Fourier Transforms Revisited
Continuous Wavelet Transformation Continuous Wavelet Transformation Institute for Advanced Studies in Basic Sciences – Zanjan Mahdi Vasighi.
Goals For This Class Quickly review of the main results from last class Convolution and Cross-correlation Discrete Fourier Analysis: Important Considerations.
GCT731 Fall 2014 Topics in Music Technology - Music Information Retrieval Overview of MIR Systems Audio and Music Representations (Part 1) 1.
Wavelets: theory and applications
WAVELET TUTORIALS.
CSE &CSE Multimedia Processing Lecture 8. Wavelet Transform Spring 2009.
The Story of Wavelets.
Outline  Fourier transforms (FT)  Forward and inverse  Discrete (DFT)  Fourier series  Properties of FT:  Symmetry and reciprocity  Scaling in time.
The Wavelet Tutorial Dr. Charturong Tantibundhit.
README Lecture notes will be animated by clicks. Each click will indicate pause for audience to observe slide. On further click, the lecturer will explain.
Wavelet transform Wavelet transform is a relatively new concept (about 10 more years old) First of all, why do we need a transform, or what is a transform.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Systems (filters) Non-periodic signal has continuous spectrum Sampling in one domain implies periodicity in another domain time frequency Periodic sampled.
ECE472/572 - Lecture 13 Wavelets and Multiresolution Processing 11/15/11 Reference: Wavelet Tutorial
CHEE825 Fall 2005J. McLellan1 Spectral Analysis and Input Signal Design.
Chapter 6 Spectrum Estimation § 6.1 Time and Frequency Domain Analysis § 6.2 Fourier Transform in Discrete Form § 6.3 Spectrum Estimator § 6.4 Practical.
“Digital stand for training undergraduate and graduate students for processing of statistical time-series, based on fractal analysis and wavelet analysis.
Pre-Class Music Paul Lansky Six Fantasies on a Poem by Thomas Campion.
Part 4 Chapter 16 Fourier Analysis PowerPoints organized by Prof. Steve Chapra, University All images copyright © The McGraw-Hill Companies, Inc. Permission.
Fourier Series Fourier Transform Discrete Fourier Transform ISAT 300 Instrumentation and Measurement Spring 2000.
Time Frequency Analysis
May 2 nd 2012 Advisor: John P. Castagna.  Background---STFT, CWT and MPD  Fractional Matching Pursuit Decomposition  Computational Simulation  Results:
The Story of Wavelets Theory and Engineering Applications
By Dr. Rajeev Srivastava CSE, IIT(BHU)
Fourier Transform and Spectra
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
Short Time Fourier Transform (STFT) CS474/674 – Prof. Bebis.
Multiresolution Analysis (Section 7.1) CS474/674 – Prof. Bebis.
Wavelets (Chapter 7) CS474/674 – Prof. Bebis. STFT - revisited Time - Frequency localization depends on window size. –Wide window  good frequency localization,
DSP First, 2/e Lecture 18 DFS: Discrete Fourier Series, and Windowing.
Lecture 19 Spectrogram: Spectral Analysis via DFT & DTFT
Wavelet Transform Advanced Digital Signal Processing Lecture 12
Multiresolution Analysis (Chapter 7)
Spectrum Analysis and Processing
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
FFT-based filtering and the
Multi-resolution analysis
2D Fourier transform is separable
Homework 1 (Due: 11th Oct.) (1) Which of the following applications are the proper applications of the short -time Fourier transform? Also illustrate.
Wavelet transform Wavelet transform is a relatively new concept (about 10 more years old) First of all, why do we need a transform, or what is a transform.
Lecture 18 DFS: Discrete Fourier Series, and Windowing
فصل هفتم: موجک و پردازش چند رزلوشنی
Presentation transcript:

Short Time Fourier Transform (STFT) CS474/674 – Prof. Bebis

Fourier Analysis Fourier analysis expands a function in terms of sinusoids (or complex exponentials). It reveals all frequency components present in a function. (inverse DFT) where: (forward DFT)

Examples

Examples (cont’d) F1(u) F2(u) F3(u)

Fourier Analysis – Examples (cont’d) F4(u)

Limitations of Fourier Analysis (cont’d) 1. Cannot not provide simultaneous time and frequency localization. 2. Not useful for analyzing time-variant, non-stationary signals. 3. Not efficient for representing discontinuities or sharp corners (i.e., requires a large number of Fourier components to represent discontinuities).

Fourier Analysis – Examples (cont’d) Provides excellent localization in the frequency domain but poor localization in the time domain. F4(u)

Limitations of Fourier Analysis (cont’d) 1. Cannot not provide simultaneous time and frequency localization. 2. Not useful for analyzing time-variant, non-stationary signals. 3. Not appropriate for representing discontinuities or sharp corners (i.e., requires a large number of Fourier components to represent discontinuities).

Stationary vs non-stationary signals Stationary signals: time-invariant spectra Non-stationary signals: time-varying spectra

Stationary vs non-stationary signals (cont’d) Three frequency components, present at all times! F4(u)

Stationary vs non-stationary signals (cont’d) Perfect knowledge of what frequencies exist, but no information about where these frequencies are located in time! F5(u)

Limitations of Fourier Analysis (cont’d) 1. Cannot not provide simultaneous time and frequency localization. 2. Not useful for analyzing time-variant, non-stationary signals. 3. Not appropriate for representing discontinuities or sharp corners (i.e., requires a large number of Fourier components to represent discontinuities).

Representing discontinuities or sharp corners

Representing discontinuities or sharp corners (cont’d) FT

Representing discontinuities or sharp corners (cont’d) Original Reconstructed 1

Representing discontinuities or sharp corners (cont’d) Original Reconstructed 2

Representing discontinuities or sharp corners (cont’d) Original Reconstructed 7

Representing discontinuities or sharp corners (cont’d) Original Reconstructed 23

Representing discontinuities or sharp corners (cont’d) Original Reconstructed 39

Representing discontinuities or sharp corners (cont’d) Original Reconstructed 63

Representing discontinuities or sharp corners (cont’d) Original Reconstructed 95

Representing discontinuities or sharp corners (cont’d) Original Reconstructed 127

Short Time Fourier Transform (STFT) Need a local analysis scheme for a time-frequency representation (TFR). Windowed F.T. or Short Time F.T. (STFT) Segmenting the signal into narrow time intervals (i.e., narrow enough to be considered stationary). Take the Fourier transform of each segment.

Short Time Fourier Transform (STFT) (cont’d) Steps : (1) Choose a window function of finite length (2) Place the window on top of the signal at t=0 (3) Truncate the signal using this window (4) Compute the FT of the truncated signal, save results. (5) Incrementally slide the window to the right (6) Go to step 3, until window reaches the end of the signal

Short Time Fourier Transform (STFT) (cont’d) Each FT provides the spectral information of a separate time-slice of the signal, providing simultaneous time and frequency information

Short Time Fourier Transform (STFT) (cont’d) parameter Frequency parameter Signal to be analyzed 1D  2D STFT of f(t): computed for each window centered at t=t’ Windowing function centered at t=t’

Example f(t) [0 – 300] ms  75 Hz sinusoid

Example f(t) W(t) scaled: t/20

Choosing Window W(t) What shape should it have? How wide should it be? Rectangular, Gaussian, Elliptic…? How wide should it be? Window should be narrow enough to make sure that the portion of the signal falling within the window is stationary. Very narrow windows do not offer good localization in the frequency domain.

STFT Window Size W(t) infinitely long:  STFT turns into FT, providing excellent frequency localization, but no time information. W(t) infinitely short:  gives the time signal back, with a phase factor, providing excellent time localization but no frequency information.

STFT Window Size (cont’d) Wide window  good frequency resolution, poor time resolution. Narrow window  good time resolution, poor frequency resolution. Later this semester: wavelets use multiple window sizes to deal with this issue.

Example different size windows (four frequencies, non-stationary)

Example (cont’d) scaled: t/20

Example (cont’d) scaled: t/20

Heisenberg (or Uncertainty) Principle Time resolution: How well two spikes in time can be separated from each other in the transform domain. Frequency resolution: How well two spectral components can be separated from each other in the transform domain

Heisenberg (or Uncertainty) Principle One cannot know the exact time-frequency representation of a signal. We cannot precisely know at what time instance a frequency component is located. We can only know what interval of frequencies are present in which time intervals.