FT makes the New Yorker, October 4, 2010 page 71

Slides:



Advertisements
Similar presentations
Signal Processing in the Discrete Time Domain Microprocessor Applications (MEE4033) Sogang University Department of Mechanical Engineering.
Advertisements

Lecture 7 Linear time invariant systems
Aristotle University of Thessaloniki – Department of Geodesy and Surveying A. DermanisSignals and Spectral Methods in Geoinformatics A. Dermanis Signals.
Statistical properties of Random time series (“noise”)
ELEC 303 – Random Signals Lecture 20 – Random processes
Lecture 17 spectral analysis and power spectra. Part 1 What does a filter do to the spectrum of a time series?
The Empirical FT continued. What is the large sample distribution of the EFT?
For s.e. of flux multiply cv by mean flux over time period Damage: penetration depends on size.
Point processes on the line. Nerve firing.. Stochastic point process. Building blocks Process on R {N(t)}, t in R, with consistent set of distributions.
Los Angeles polution mortality study Shumway at al (1988) Environ. Res. 45, Los Angeles County: average daily cardiovascular mortality particulate.
Autumn Analog and Digital Communications Autumn
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.
Stat Oct 2008 D. R. Brillinger Chapter 6 - Stationary Processes in the Frequency Domain One model Another R: amplitude α: decay rate ω: frequency,
Point processes rates are a point process concern.
Signals and Systems Jamshid Shanbehzadeh.
Outline  Fourier transforms (FT)  Forward and inverse  Discrete (DFT)  Fourier series  Properties of FT:  Symmetry and reciprocity  Scaling in time.
1 Part 5 Response of Linear Systems 6.Linear Filtering of a Random Signals 7.Power Spectrum Analysis 8.Linear Estimation and Prediction Filters 9.Mean-Square.
Chapter 4: Image Enhancement in the Frequency Domain Chapter 4: Image Enhancement in the Frequency Domain.
Fourier’s Theorem Beats????. Fourier Series – Periodic Functions.
Chapter 4 Fourier transform Prepared by Dr. Taha MAhdy.
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.
Inverse DFT. Frequency to time domain Sometimes calculations are easier in the frequency domain then later convert the results back to the time domain.
Signals and Systems Prof. H. Sameti Chapter 4: The Continuous Time Fourier Transform Derivation of the CT Fourier Transform pair Examples of Fourier Transforms.
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.
revision Transfer function. Frequency Response
Fourier Transform.
Discrete-time Random Signals
Lecture 5 – 6 Z - Transform By Dileep Kumar.
Geology 5600/6600 Signal Analysis 14 Sep 2015 © A.R. Lowry 2015 Last time: A stationary process has statistical properties that are time-invariant; a wide-sense.
The Chinese University of Hong Kong
Coherence spectrum (coherency squared)  = 0.1, 0.05, 0.01 X is the Fourier Transform Cross-spectral power density Confidence level: = running mean or.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
Statistics Lecture 19.
Dynamic spectrum.
Lecture on Continuous and Discrete Fourier Transforms
SIGNALS PROCESSING AND ANALYSIS
Spectral Analysis.
PRODUCT MOMENTS OF BIVARIATE RANDOM VARIABLES
The Chinese University of Hong Kong
Time series power spectral density.
Laboratory in Oceanography: Data and Methods
Filtering/smoothing. Use of A(,). bandpass filtering
Operations/systems. Processes so far considered:
Rotating solid Euler predicted free nutation of the rotating Earth in 1755 Discovered by Chandler in 1891 Data from International Latitude Observatories.
Segue from time series to point processes.
Chapter 2. Fourier Representation of Signals and Systems
ENG4BF3 Medical Image Processing
The Empirical FT. What is the large sample distribution of the EFT?
Mixing. Stationary case unless otherwise indicated
Power spectral density. frequency-side, , vs. time-side, t
The sampling of continuous-time signals is an important topic
Cross-spectral Analysis
Stochastic models - time series.
Image Restoration and Denoising
Point processes rates are a point process concern.
Digital Image Processing
The Empirical FT. What is the large sample distribution of the EFT?
Modeling in the Time Domain
Stochastic models - time series.
Second order stationary p.p.
Lecture 17 DFT: Discrete Fourier Transform
Coherence spectrum (coherency squared)
Correlation, Energy Spectral Density and Power Spectral Density
The Empirical FT. What is the large sample distribution of the EFT?
Point processes on the line. Nerve firing.
Networks. partial spectra - trivariate (M,N,O)
Signals and Systems Lecture 15
Laplace Transforms Important analytical method for solving linear ordinary differential equations. - Application to nonlinear ODEs? Must linearize first.
Laplace Transforms Important analytical method for solving linear ordinary differential equations. - Application to nonlinear ODEs? Must linearize first.
Presentation transcript:

FT makes the New Yorker, October 4, 2010 page 71

2   1 The Fourier transform.  regularity conditions Functions, A(), - <  <   |A()|d finite FT. a(t) =  exp{it)A()d - <  <  Inverse A() =(2)-1  exp{-it} a(t) dt unique C()=  A() +  B() c(t) =  c(t) +  b(t) 2   1

Convolution (filtering). d(t) =  b(t-s) c( s)ds D() = B()C() Discrete FT. a(t) = T-1 exp{i2ts/T} A(2s/T) s, t = 0,1,...,T-1 A(2s/T) =  exp {-i2st/T) a(t) FFTs exist

Dirac delta.  g() () d = g(0)  exp {it}() d  = 1 inverse () = (2)-1  exp {-it}dt Heavyside function H() = signum () () = dH()/d

Mixing. Stationary case unless otherwise indicated cov{dN(t+u),dN(t)} small for large |u| |pNN(u) - pNpN| small for large |u| hNN(u) = pNN(u)/pN ~ pN for large |u| qNN(u) = pNN(u) - pNpN u  0  |qNN(u)|du <  cov{dN(t+u),dN(t)}= [(u)pN + qNN(u)]dtdu

Power spectral density. frequency-side, , vs. time-side, t /2 : frequency (cycles/unit time) fNN() = (2)-1 exp{-iu}cov{dN(t+u),dN(t)}/dt = (2)-1 exp{-iu}[(u)pN+qNN(u)]du = (2)-1pN + (2)-1  exp{-iu}qNN(u)]du Non-negative, symmetric Approach unifies analyses of processes of widely varying types

Examples.

Spectral representation. stationary increments - Kolmogorov

Filtering. dN(t)/dt =  a(t-v)dM(v) =  a(t-j ) =  exp{it}A()dZM() with a(t) = (2)-1  exp{it}A()d dZN() = A() dZM() fNN() = |A()|2 fMM()

Association. Measuring? Due to chance? Are two processes associated? Eg. t.s. and p.p. How strongly? Can one predict one from the other? Some characteristics of dependence: E(XY)  E(X) E(Y) E(Y|X) = g(X) X = g (), Y = h(),  r.v. f (x,y)  f (x) f(y) corr(X,Y)  0

Bivariate point process case. Two types of points (j ,k) Crossintensity. a rate Prob{dN(t)=1|dM(s)=1} =(pMN(t,s)/pM(s))dt Cross-covariance density. cov{dM(s),dN(t)} = qMN(s,t)dsdt no () often

Spectral representation approach.

Frequency domain approach. Coherency, coherence Cross-spectrum. Coherency. R MN() = f MN()/{f MM() f NN()} complex-valued, 0 if denominator 0 Coherence |R MN()|2 = |f MN()| 2 /{f MM() f NN()| |R MN()|2  1, c.p. multiple R2

Proof. Filtering. M = {j }  a(t-v)dM(v) =  a(t-j ) Consider dO(t) = dN(t) -  a(t-v)dM(v)dt, (stationary increments) where A() =  exp{-iu}a(u)du fOO () is a minimum at A() = fNM()fMM()-1 Minimum: (1 - |RMN()|2 )fNN() 0  |R MN()|2  1

Proof. Coherence, measure of the linear time invariant association of the components of a stationary bivariate process.

Regression analysis/system identification. dZN() = A() dZM() + error() A() =  exp{-iu}a(u)du

Empirical examples. sea hare

Mississippi river flow

Partial coherency. Trivariate process {M,N,O} “Removes” the linear time invariant effects of O from M and N

Time series variants. details later continuous time case Mixing. cov{Y(t+u),Y(t)} = cYY(u) small for large |u|  |cYY(u)|du < 

Power spectral density. frequency-side, , vs. time-side, t /2 : frequency (cycles/unit time) fYY() = (2)-1 exp{-iu}cov{Y(t+u),Y(t)} = (2)-1 exp{-iu}cYY(u)du -<< Non-negative, symmetric Approach unifies analyses of processes of widely varying types Things in the frequency domain look the same

Spectral representation. Y(t) = exp{it}dZY() - < t <  ZY() random, complex-valued conj{ZY()} = ZY(-) E{dZY()} = ()cNd cov{dZY(),dZY()}=(-)f NN()dd cum{dZY(1),...,dZY(K)} = ...

Filtering. Yt) =  a(t-v)X(v)dv =  exp{it}A()dZX() with a(t) = (2)-1  exp{it}A()d dZY() = A() dZX() fYY() = |A()|2 fXX()

Bivariate time series case. (X(t),Y(t)) - < t <  Cross-covariance function. general case cov{X(s),Y(t)} = cXY(s,t)

Spectral representation approach. FXY(.): cross-spectral measure

Frequency domain approach. Coherency, coherence Cross-spectrum. f XY()= (2)-1  exp{-iu)c XY(u)du -< < complex-valued Coherency. R XY() = f XY()/{f XX() f YY()} 0 if denominator 0 Coherence. |RXY()|2 = |f XY()| 2 /{fXX() fYY()| |RXY()|2  1, c.p. multiple R2

Regression analysis/system identification. dZY() = A() dZX() + error() A() =  exp{-iu}a(u)du

Partial coherency. Trivariate process {X,Y,O} “Removes” the linear time invariant effects of O from X and Y