The Hilbert Transform and Empirical Mode Decomposition: Suz Tolwinski University of Arizona Program in Applied Mathematics Spring 2007 RTG Powerful Tools.

Slides:

Advertisements

Similar presentations

Fourier Transform Periodicity of Fourier series

Advertisements

Time-Frequency Tools: a Survey Paulo Gonçalvès INRIA Rhône-Alpes, France & INSERM U572, Hôpital Lariboisière, France 2nd meeting of the European Study.

Signals and Fourier Theory

Math Review with Matlab:

On the Trend, Detrend and the Variability of Nonlinear and Nonstationary Time Series A new application of HHT.

An Introduction to HHT: Instantaneous Frequency, Trend, Degree of Nonlinearity and Non-stationarity Norden E. Huang Research Center for Adaptive Data Analysis.

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.

電信一 R 陳昱安 1.  Research area: MER   Not quite good at difficult math 2.

Nonstationary Signal Processing Hilbert-Huang Transform Joseph DePasquale 22 Mar 07.

On Empirical Mode Decomposition and its Algorithms

Properties of continuous Fourier Transforms

G O D D A R D S P A C E F L I G H T C E N T E R Upconversion Study with the Hilbert-Huang Transform Jordan Camp Kenji Numata John Cannizzo Robert Schofield.

Time-Frequency and Time-Scale Analysis of Doppler Ultrasound Signals

The Empirical Mode Decomposition Method Sifting. Goal of Data Analysis To define time scale or frequency. To define energy density. To define joint frequency-energy.

A Confidence Limit for Hilbert Spectrum Through stoppage criteria.

Paradoxes on Instantaneous Frequency a la Leon Cohen Time-Frequency Analysis, Prentice Hall, 1995 Chapter 2: Instantaneous Frequency, P. 40.

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.

Zhaohua Wu and N. E. Huang:

Signals, Fourier Series

MATH 3290 Mathematical Modeling

The Analytic Function from the Hilbert Transform and End Effects Theory and Implementation.

ENSEMBLE EMPIRICAL MODE DECOMPOSITION Noise Assisted Signal Analysis (nasa) Part II EEMD Zhaohua Wu and N. E. Huang: Ensemble Empirical Mode Decomposition:

National Chiao Tung University MVEMD vs. MDEMD + Applications in EEG & Gait Analyses John K. Zao Computer Science Dept. & Brain Research Center National.

Signals & Systems Lecture 11: Chapter 3 Spectrum Representation (Book: Signal Processing First)

1 The Fourier Series for Discrete- Time Signals Suppose that we are given a periodic sequence with period N. The Fourier series representation for x[n]

WAVELET TRANSFORM.

Sep.2008DISP Time-Frequency Analysis 時頻分析  Speaker: Wen-Fu Wang 王文阜  Advisor: Jian-Jiun Ding 丁建均教授   Graduate.

Module 2 SPECTRAL ANALYSIS OF COMMUNICATION SIGNAL.

ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Review Resources: Wiki: Superheterodyne Receivers RE: Superheterodyne.

On the relationship between C n 2 and humidity Carlos O. Font, Mark P. J. L. Chang, Erick A. Roura¹, Eun Oh and Charmaine Gilbreath² ¹Physics Department,

Fourier Series. Introduction Decompose a periodic input signal into primitive periodic components. A periodic sequence T2T3T t f(t)f(t)

E MPIRICAL M ODE D ECOMPOSITION BASED T ECHNIQUE APPLIED IN EXPERIMENTAL BIOSIGNALS Alexandros Karagiannis Mobile Radio Communications Laboratory School.

EE313 Linear Systems and Signals Fall 2010 Initial conversion of content to PowerPoint by Dr. Wade C. Schwartzkopf Prof. Brian L. Evans Dept. of Electrical.

An introduction to Empirical Mode Decomposition. The simplest model for a signal is given by circular functions of the type Such “Fourier modes” are of.

Advanced Digital Signal Processing

On the Trend, Detrend and the Variability of Nonlinear and Nonstationary Time Series Norden E. Huang Research Center for Adaptive Data Analysis National.

Fourier Series Kamen and Heck.

Chapter 2. Signals and Linear Systems

Part 4 Chapter 16 Fourier Analysis PowerPoints organized by Prof. Steve Chapra, University All images copyright © The McGraw-Hill Companies, Inc. Permission.

Fourier Analysis of Signals and Systems

Signals and Systems 1 Lecture 3 Dr. Ali. A. Jalali August 23, 2002.

ES97H Biomedical Signal Processing

Fourier series, Discrete Time Fourier Transform and Characteristic functions.

15. Fourier analysis techniques

SIGNALS AND SIGNAL SPACE

Ensemble Empirical Mode Decomposition Zhaohua Wu Center for Ocean-Land-Atmosphere Studies And Norden E Huang National Central University.

Detection of Intermittent Turbulence In Stable Boundary Layer Using Empirical Mode Decomposition Xiaoning Gilliam, Christina Ho, and Sukanta Basu Texas.

An Introduction to Time-Frequency Analysis Speaker: Po-Hong Wu Advisor: Jian-Jung Ding Digital Image and Signal Processing Lab GICE, National Taiwan University.

1 Roadmap SignalSystem Input Signal Output Signal characteristics Given input and system information, solve for the response Solving differential equation.

The Spectrum n Jean Baptiste Fourier ( ) discovered a fundamental tenet of wave theory.

Environmental and Exploration Geophysics II tom.h.wilson

The Empirical Mode Decomposition Method Sifting. Goal of Data Analysis To define time scale or frequency. To define energy density. To define joint frequency-energy.

بسم الله الرحمن الرحيم University of Khartoum Department of Electrical and Electronic Engineering Third Year – 2015 Dr. Iman AbuelMaaly Abdelrahman

ENSEMBLE EMPIRICAL MODE DECOMPOSITION Noise Assisted Signal Analysis (nasa) Part II EEMD Zhaohua Wu and N. E. Huang: Ensemble Empirical Mode Decomposition:

Complex Form of Fourier Series For a real periodic function f(t) with period T, fundamental frequency where is the “complex amplitude spectrum”.

Convergence of Fourier series It is known that a periodic signal x(t) has a Fourier series representation if it satisfies the following Dirichlet conditions:

FOURIER ANALYSIS TECHNIQUES Fourier series permit the extension of steady state analysis to general periodic signal. FOURIER SERIES LEARNING GOALS FOURIER.

Paradoxes on Instantaneous Frequency

Lecture 16: Hilbert-Huang Transform Background:

A Conjecture & a Theorem

k is the frequency index

Continuous-Time Signal Analysis

Engineering Analysis – Fall 2009

Decomposition nonstationary turbulence velocity in open channel flow

Chapter 2. Fourier Representation of Signals and Systems

UNIT II Analysis of Continuous Time signal

k is the frequency index

Signals and Systems EE235 Leo Lam ©

Signals and Systems EE235 Lecture 23 Leo Lam ©

C H A P T E R 21 Fourier Series.

Presentation transcript:

The Hilbert Transform and Empirical Mode Decomposition: Suz Tolwinski University of Arizona Program in Applied Mathematics Spring 2007 RTG Powerful Tools for Data Analysis

Deriving the Hilbert Transform For f(z) = u(x,y) + iv(x,y) analytic on the upper half-plane, and decays at infinity: Cauchy’s Integral Formula + Decay of function + Clever rearrangement of terms : R Relationship between u(x,y) and v(x,y) on R Define the Hilbert transform in similar spirit:

Another View of the Hilbert Transform. Looks like minus the convolution of f(t) with 1/πt. Apply Convolution Theorem for something more manageable in frequency space? Take away message: The Hilbert transform rotates a signal counter-clockwise by π/2 at every point in its positive frequency spectrum, and clockwise at all its negative frequencies.

Real Signals. A signal is any time-varying quantity containing information. Signals in nature are real. Real signals have even frequency spectra. This makes them difficult to analyze. We would like to know, how is the signal energy distributed in time and/or frequency space? For a signal with even frequency spectrum, -Mean frequency? -Spread of signal in frequency space? Electrocardiographic signal in time and frequency domain (Energy of s(t) =  |s(t)| 2 dt =  |S(  )| 2 d  )

Analytic Signals. Have positive frequency spectrum only, so, spread in  are meaningful quantities. Analytic signal can be represented as time-varying frequency and amplitude: f ANALYT. (t) = A(t)e i  (t) Frequency spectrum of a real signal. Frequency spectrum of the corresponding analytic signal. We can construct an analytic signal corresponding to any real signal (takes only the positive frequencies): F ANALYT. (  ) = 1/2 ( F(  )+ sgn(  )F(  ) ) Then in the time domain, the analytic signal is given by f ANALYT. (t) =1/2 ( f(t) + iH{f(t)} ) A(t) = ( 1/2f(t)) 2 +1/2 (H{f(t)}) 2 ) 1/2  (t) = tan -1 ( H{f(t)}/f(t) )

Empirical Mode Decomposition of Real Signals. (Method due to N. Huang, 1998.) Creates an adaptive decomposition of signal Result is a generalized Fourier series (Modes with time-varying amplitude and phase) Components are called Intrinsic Mode Functions (IMFs) IMFs satisfy two criteria by designs: -Have only one zero between successive extrema -Have zero “local mean” EMD separates phenomena occurring on different time scales. “Residue” shows overall trend in data.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) (“residue”-->) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) (“residue”-->) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) (“residue”-->) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Residue = s(t) I 1 (t) = Residue i = 1 k = 1 while Residue not equal zero or not monotone while I i has non-negligible local mean U(t) = spline through local maxima of I i L(t) = spline through local minima of I i Av(t) = 1/2 (U(t) + L(t)) I i (t) = I i (t) - Av(t) i = i + 1 end IMF k (t) = I i (t) Residue = Residue - IMF k k = k+1 end Huang’s “Sifting Process”.

Now that we have a set of IMFs; construct their analytic counterparts using the Hilbert transform. The Hilbert Spectrum Now we can look at f(t) in time and frequency space simultaneously. Instantaneous frequency is given by the derivative of the phase angle. The Hilbert spectrum H( ,t) gives the instantaneous amplitude (~energy) as a function of frequency. A plot of H( ,t) provides an intuitive, visual representation of the signal in time and frequency.

Example: EMD for a Test Signal with Known Components.

Hilbert Spectrum for EMD of Example Signal.

Real-World Example: Temperature Data from Amherst, MA from

IMF 8 IMF 5 Physical Interpretation of IMFs for Amherst Temperature Data.

Huang-Hilbert Spectrum for EMD of Amherst Temperature Data -Most of the signal information contained in the bottom 10% of all frequencies represented -Can we make a correspondence between what we see here and the IMFs of the decomposition? -This would help identify which modes are important in determining the character of the data.

Hilbert Spectrum for IMF 8

Hilbert Spectrum for IMF 7

Increasing Frequencies: Decreasing Information! IMF 6 IMF 5 IMF 4

Interpretation of Residue (Shows Overall Trend).

Bibliography. Langton, C. Hilbert Transform, Anayltic Signal and the Complex Envelope Signal Processing and Simulation Newsletter, Electrocardiograph signal graphic: MATLAB code used for all computations, and “sifting” graphics: Rilling, G. MATLAB code for computation of EMD and illustrative slides. lyon.fr/patrick.flandrin/emd.htmlhttp://perso.ens Temperature data from Amherst, MA: Williams, C.N., Jr., M.J. Menne, R.S. Vose, and D.R. Easterling United States Historical Climatology Network Daily Temperature, Precipitation, and Snow Data. ORNL/CDIAC-118, NDP-070. Online at [ site MA “Burning Globe” graphic: