Filtering/smoothing. Use of A(,). bandpass filtering

Slides:



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

ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Response to a Sinusoidal Input Frequency Analysis of an RC Circuit.
Lecture 7 Linear time invariant systems
Leo Lam © Signals and Systems EE235. Transformers Leo Lam ©
Review of Frequency Domain
Lecture 17 spectral analysis and power spectra. Part 1 What does a filter do to the spectrum of a time series?
Reminder Fourier Basis: t  [0,1] nZnZ Fourier Series: Fourier Coefficient:
CSCE 641 Computer Graphics: Image Sampling and Reconstruction Jinxiang Chai.
For s.e. of flux multiply cv by mean flux over time period Damage: penetration depends on size.
CSCE 641 Computer Graphics: Image Sampling and Reconstruction Jinxiang Chai.
Cedar movie. Cedar Fire Operations/systems. Processes so far considered: Y(t), 0
Lecture 9: Fourier Transform Properties and Examples
Point processes rates are a point process concern.
Leo Lam © Signals and Systems EE235. Leo Lam © Fourier Transform Q: What did the Fourier transform of the arbitrary signal say to.
Sampling and Antialiasing CMSC 491/635. Abstract Vector Spaces Addition –C = A + B = B + A –(A + B) + C = A + (B + C) –given A, B, A + X = B for only.
Leo Lam © Signals and Systems EE235. Leo Lam © x squared equals 9 x squared plus 1 equals y Find value of y.
Echivalarea sistemelor analogice cu sisteme digitale Prof.dr.ing. Ioan NAFORNITA.
Outline  Fourier transforms (FT)  Forward and inverse  Discrete (DFT)  Fourier series  Properties of FT:  Symmetry and reciprocity  Scaling in time.
Chapter 5 Frequency Domain Analysis of Systems. Consider the following CT LTI system: absolutely integrable,Assumption: the impulse response h(t) is absolutely.
Chapter 2 Signals and Spectra (All sections, except Section 8, are covered.)
Z TRANSFORM AND DFT Z Transform
revision Transfer function. Frequency Response
Digital Signal Processing
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: FIR Filters Design of Ideal Lowpass Filters Filter Design Example.
Leo Lam © Signals and Systems EE235 Lecture 26.
Environmental Data Analysis with MatLab 2 nd Edition Lecture 22: Linear Approximations and Non Linear Least Squares.
Chapter 2. Characteristics of Signal ※ Signal : transmission of information The quality of the information depends on proper selection of a measurement.
Chapter 2 Ideal Sampling and Nyquist Theorem
Math for CS Fourier Transforms
Math for CS Fourier Transform
Locating a Shift in the Mean of a Time Series Melvin J. Hinich Applied Research Laboratories University of Texas at Austin
Lecture 1.4. Sampling. Kotelnikov-Nyquist Theorem.
Chapter 4 Discrete-Time Signals and transform
Chapter 4 Dynamical Behavior of Processes Homework 6 Construct an s-Function model of the interacting tank-in-series system and compare its simulation.
Dynamic spectrum.
Chapter 4 Dynamical Behavior of Processes Homework 6 Construct an s-Function model of the interacting tank-in-series system and compare its simulation.
Transfer Functions.
Echivalarea sistemelor analogice cu sisteme digitale
Digital Signal Processing Lecture 4 DTFT
Image Enhancement in the
Computational Data Analysis
Laplace and Z transforms
The Laplace Transform Prof. Brian L. Evans
Time series power spectral density.
Signals and Systems EE235 Lecture 26 Leo Lam ©
Chapter 5 Z Transform.
Laboratory in Oceanography: Data and Methods
Operations/systems. Processes so far considered:
Outline Linear Shift-invariant system Linear filters
Point processes rates are a point process concern.
Research Methods in Acoustics Lecture 9: Laplace Transform and z-Transform Jonas Braasch.
Advanced Digital Signal Processing
Point processes rates are a point process concern.
Z TRANSFORM AND DFT Z Transform
TIME SERIES ANALYSIS Time series – collection of observations in time: x( ti ) x( ti ) discrete time series with Δt Deterministic process: Can be predicted.
Chapter 2 Ideal Sampling and Nyquist Theorem
FT makes the New Yorker, October 4, 2010 page 71
Chapter 2 Discrete Fourier Transform (DFT)
Basic Image Processing
Point process data points along the line
6. Time and Frequency Characterization of Signals and Systems
Signals and Systems EE235 Leo Lam ©
TIME SERIES ANALYSIS Time series – collection of observations in time: x( ti ) x( ti ) discrete time series with Δt Deterministic process: Can be predicted.
4. The Continuous time Fourier Transform
Lecture 4 Image Enhancement in Frequency Domain
Sampling and Aliasing.
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.
DIGITAL CONTROL SYSTEM WEEK 3 NUMERICAL APPROXIMATION
Presentation transcript:

Filtering/smoothing. Use of A(,). bandpass filtering Suppose X(x,y)  j,k jk exp{i(j x + k y)} Y(x,y) = A[X](x,y)  j,k A(j,k) jk exp{i(j x + k y)} e.g. If A(,) = 1, | ± 0|, |±0|   = 0 otherwise Y(x,y) contains only these terms Repeated xeroxing

Approximating an ideal low-pass filter. Transfer function A() = 1 ||   Ideal Y(t) =  a(u) X(t-u) t,u in Z A() =  a(u) exp{-i  u) - <    a(u) =  exp{iu}A()d / 2 = |lamda|<Omega exp{i u}d/2 = / u=0 = sin u/u u  0

Bank of bandpass filters

Fourier series. How close is A(n)() to A() ?

By substitution

Error

Convergence factors. Fejer (1900) Replace (*) by Fejer kernel integrates to 1 non-negative approximate Dirac delta

General class. h(u) = 0, |u|>1  h(u/n) exp{-iu} a(u) =  H(n)() A(-) d (**) with H(n)() = (2)-1  h(u/n) exp{-iu} h(.): convergence factor, taper, data window, fader (**) = A() + n-1 H()d A'() + ½n-22H()d A"() + ...

Lowpass filter.

Smoothing/smoothers. goal: retain smooth/low frequency components of signal while reducing the more irregular/high frequency ones difficulty: no universal definition of smooth curve Example. running mean avet-kst+k Y(s)

Kernel smoother. S(t) =  wb(t-s)Y(s) /  wb(t-s) wb(t) = w(t/b) b: bandwidth ksmooth()

Local polynomial. Linear case Obtain at , bt OLS intercept and slope of points {(s,Y(s)): t-k  s  t+k} S(t) = at + btt span: (2k+1)/n lowess(), loess(): WLS can be made resistant

Running median medt-kst+k Y(s) Repeat til no change Other things: parametric model, splines, ... choice of bandwidth/binwidth

Finite Fourier transforms. Considered

Empirical Fourier analysis. Uses. Estimation - parameters and periods Unification of data types Approximation of distributions System identification Speeding up computations Model assessment ...

Examples. 1. Constant. X(t)=1

Inversion. fft()

Convolution. Lemma 3.4.1. If |X(t)M, a(0) and |ua(u)| A, Y(t) =  a(t-u)X(u) then, |dYT() – A() dYT() |  4MA Application. Filtering Add S-T zeroes

Periodogram. |dT ()|2

Chandler wobble.

Interpretation of frequency.

Some other empirical FTs. 1. Point process on the line. {0j <T}, j=1,...,N N(t), 0t<T dN(t)/dt = j (t-j) Might approximate by a 0-1 time series Yt = 1 point in [0,t) = 0 otherwise j Yt exp{-it}

2. M.p.p. (sampled time series). {j , Mj } {Y(j )} j Mj exp{-ij} j Y(j ) exp{-ij}

3. Measure, processes of increments 4. Discrete state-valued process Y(t) values in N, g:NR t g(Y(t)) exp{-it} 5. Process on circle Y(), 0   <  Y() = k k exp{ik}

Other processes. process on sphere, line process, generalized process, vector-valued time, LCA group