Data smoothing Raymond Cuijpers. Index The moving average Convolution The difference operator Fourier transforms Gaussian smoothing Butterworth filters.

Slides:



Advertisements
Similar presentations
Ter Haar Romeny, EMBS Berder 2004 Gaussian derivative kernels The algebraic expressions for the first 4 orders:
Advertisements

Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean Hall 5409 T-R 10:30am – 11:50am.
HILBERT TRANSFORM Fourier, Laplace, and z-transforms change from the time-domain representation of a signal to the frequency-domain representation of the.
Fourier Transform (Chapter 4)
Chap 4 Image Enhancement in the Frequency Domain.
Linear Filtering – Part II Selim Aksoy Department of Computer Engineering Bilkent University
Digital Image Processing
CS CS 175 – Week 4 Triangle Mesh Smoothing Signal Processing, Diffusion, Curvature Flow.
Chapter 4 Image Enhancement in the Frequency Domain.
1 Image filtering Hybrid Images, Oliva et al.,
Edge detection. Edge Detection in Images Finding the contour of objects in a scene.
Chap 4-2. Frequency domain processing Jen-Chang Liu, 2006.
CSCE 641 Computer Graphics: Image Sampling and Reconstruction Jinxiang Chai.
CSCE 641 Computer Graphics: Image Sampling and Reconstruction Jinxiang Chai.
Digital Image Processing Chapter 4: Image Enhancement in the Frequency Domain.
CSCE 641 Computer Graphics: Fourier Transform Jinxiang Chai.
CPSC 641 Computer Graphics: Fourier Transform Jinxiang Chai.
Lecture 9: Fourier Transform Properties and Examples
Computational Photography: Fourier Transform Jinxiang Chai.
Chapter 4 Image Enhancement in the Frequency Domain.
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
Types of systems in the Laplace domain. System order Most systems that we will be dealing with can be characterised as first or second order systems.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean Hall 5409 T-R 10:30am – 11:50am.
Motion of a mass at the end of a spring Differential equation for simple harmonic oscillation Amplitude, period, frequency and angular frequency Energetics.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm.
Signals and Systems Jamshid Shanbehzadeh.
Presentation Image Filters
Laplace Transform BIOE 4200.
Image Processing Fourier Transform 1D Efficient Data Representation Discrete Fourier Transform - 1D Continuous Fourier Transform - 1D Examples.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Linearity Time Shift and Time Reversal Multiplication Integration.
CSC589 Introduction to Computer Vision Lecture 7 Thinking in Frequency Bei Xiao.
Effective Computation of Linear Filters The following properties are used to shorten the computation time f  g = g  f, f  (g  h) = (f  g)  h, f 
Chapter 7: The Fourier Transform 7.1 Introduction
Lecture 3: Edge detection CS4670/5670: Computer Vision Kavita Bala From Sandlot ScienceSandlot Science.
Chapter 5: Fourier Transform.
Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos VC 14/15 – TP6 Frequency Space Miguel Tavares Coimbra.
Chapter 4 Fourier transform Prepared by Dr. Taha MAhdy.
Linearity Recall our expressions for the Fourier Transform and its inverse: The property of linearity: Proof: (synthesis) (analysis)
CMSC 635 Sampling and Antialiasing. Aliasing in images.
Image as a linear combination of basis images
Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos VC 15/16 – TP7 Spatial Filters Miguel Tavares Coimbra.
1 Methods in Image Analysis – Lecture 3 Fourier CMU Robotics Institute U. Pitt Bioengineering 2630 Spring Term, 2004 George Stetten, M.D., Ph.D.
Fourier Transform.
ABE425 Engineering Measurement Systems Fourier Transform, Sampling theorem, Convolution and Digital Filters Dr. Tony E. Grift Dept. of Agricultural.
ABE 463 Electro-hydraulic systems Laplace transform Tony Grift
Computer Graphics & Image Processing Chapter # 4 Image Enhancement in Frequency Domain 2/26/20161.
Instructor: Mircea Nicolescu Lecture 7
Frequency domain analysis and Fourier Transform
Ch # 11 Fourier Series, Integrals, and Transform 1.
Miguel Tavares Coimbra
Linear Constant-Coefficient Difference Equations
Section II Digital Signal Processing ES & BM.
Lecture 1.26 Spectral analysis of periodic and non-periodic signals.
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Miguel Tavares Coimbra
Engineering Analysis – Fall 2009
Fourier Transform.
All about convolution.
Chapter 5 Integral Transforms and Complex Variable Functions
Outline Linear Shift-invariant system Linear filters
Frequency Domain Analysis
2D Fourier transform is separable
CSCE 643 Computer Vision: Image Sampling and Filtering
CSCE 643 Computer Vision: Thinking in Frequency
B.Sc. II Year Mr. Shrimangale G.W.
Instructor: S. Narasimhan
Intensity Transformation
Discrete Fourier Transform
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Even Discrete Cosine Transform The Chinese University of Hong Kong
Presentation transcript:

Data smoothing Raymond Cuijpers

Index The moving average Convolution The difference operator Fourier transforms Gaussian smoothing Butterworth filters

The moving average Let (S i ) be a data set S i,smooth = 1/3 (S i-1 + S i + S i+1 ) =

Convolution Definition: The moving average is the same as convoluting the signal with a block function !

Convolution f * g = g * f f * (g + h) = f * g + f * h (f * g) * h = f * (g * h) f * 0 = 0 But 1 * g ≠ g

The difference operator The velocity is the derivative of the displace- ment, for discrete signals this becomes the difference operator. Discrete differentiation = convolution with difference operator Velocity estimated at i+1/2

The difference operator The difference operator amplifies noise Smoothing helps but at the cost of accuracy It becomes worse for higher order derivatives * =

Differentiation and convolution Noisy = BAD Exact = GOOD Differentiation by convolution with derivative

Fourier Transforms Definition: In the Fourier domain: convolution becomes multiplication differentiation becomes multiplication with iw

Fourier Transforms Calculating convolutions using Fourier transforms is much faster for large data sets than direct computation: There are many other transforms/expansions –Sine and Cosine transforms –Laplace transform –Legendre polynomials –Hermite polynomials (=Gaussian) –Bessel Functions –…

Gaussian smoothing Let S(t) be a signal then the blurred signal is Where is the Gaussian kernel The derivative of a noisy S(t) is ill-posed, but

Gaussian smoothing The n-th order proper derivative of scale s is So in the discrete case we get

Gaussian Smoothing Gaussian filters are the only 'natural' filters Together they form a linear Scale selective space of operators * =

Butterworth Filters Noise is usually high frequent and not the signal Butterworth filters work by throwing away high frequencies in the Fourier transform A good choice of cut-off frequency is paramount

Butterworth filters Advantage: Easy to implement in electronic circuit Disadvantage: Introduces a phase shift. Solution is to apply it twice in opposite directions 'Ringing': jumps in the signal produces oscillations Depends strongly on the nature of the noise and the choice of cut-off frequency