Download presentation
Presentation is loading. Please wait.
1
Comparative survey on non linear filtering methods : the quantization and the particle filtering approaches Afef SELLAMI Chang Young Kim
2
Overview Introduction Bayes filters Quantization based filters Zero order scheme First order schemes Particle filters Sequential importance sampling (SIS) filter Sampling-Importance Resampling(SIR) filter Comparison of two approaches Summary
3
Non linear filter estimators Quantization based filters Zero order scheme First order schemes Particle filtering algorithms: Sequential importance sampling (SIS) filter Sampling-Importance Resampling(SIR) filter
4
Overview Introduction Bayes filters Quantization based filters Zero order scheme First order schemes Particle filters Sequential importance sampling (SIS) filter Sampling-Importance Resampling(SIR) filter Comparison of two approaches Summary
5
Bayesian approach: We attempt to construct the π n f of the state given all measurements. Prediction Correction Bayes Filter
6
One step transition bayes filter equation By introducint the operaters, sequential definition of the unnormalized filter π n Forward Expression Bayes Filter
7
Overview Introduction Bayes filters Quantization based filters Zero order scheme First order schemes Particle filters Sequential importance sampling (SIS) filter Sampling-Importance Resampling(SIR) filter Comparison of two approaches Summary
8
Quantization based filters Zero order scheme First order schemes One step recursive first order scheme Two step recursive first order scheme
9
Zero order scheme Quantization Sequential definition of the unnormalized filter π n Forward Expression
10
Zero order scheme
11
Recalling Taylor Series Let's call our point x 0 and let's define a new variable that simply measures how far we are from x 0 ; call the variable h = x –x 0. Taylor Series formula First Order Approximation:
12
Introduce first order schemes to improve the convergence rate of the zero order schemes. Rewriting the sequential definition by mimicking some first order Taylor expansion: Two schemes based on the different approximation by One step recursive scheme based on a recursive definition of the differential term estimator. Two step recursive scheme based on an integration by part transformation of conditional expectation derivative. First order schemes
13
One step recursive scheme The recursive definition of the differential term estimator Forward Expression
15
Two step recursive scheme An integration by part formula where
17
Comparisons of convergence rate Zero order scheme First order schemes One step recursive first order scheme Two step recursive first order scheme
18
Overview Introduction Bayes filters Quantization based filters Zero order scheme First order schemes Particle filters Sequential importance sampling (SIS) filter Sampling-Importance Resampling(SIR) filter Comparison of two approaches Summary
19
Particle filtering Consists of two basic elements: Monte Carlo integration Importance sampling
20
Importance sampling Proposal distribution: easy to sample from Original distribution: hard to sample from, easy to evaluate Importance weights wlwl = p ( x ` ) q ( x ` )
21
we want samples from and make the following importance sampling identifications Sequential importance sampling (SIS) filter Proposal distribution Distribution from which we want to sample
22
draw x i t 1 from Bel (x t 1 ) draw x i t from p ( x t | x i t 1 ) Importance factor for x i t : SIS Filter Algorithm
23
Sampling-Importance Resampling(SIR) Problems of SIS: Weight Degeneration Solution RESAMPLING Resampling eliminates samples with low importance weights and multiply samples with high importance weights Replicate particles when the effective number of particles is below a threshold
24
Sampling-Importance Resampling(SIR) x Sensor model Update Resampling Prediction
25
Overview Introduction Bayes filters Quantization based filters Zero order scheme First order schemes Particle filters Sequential importance sampling (SIS) filter Sampling-Importance Resampling(SIR) filter Comparison of two approaches Summary
26
Elements for a comparison Complexity Numerical performances in three state models: Kalman filter (KF) Canonical stochastic volatility model (SVM) Explicit non linear filter
27
Complexity comparison Zero order scheme C0N2C0N2 One step recursive first order scheme C1N2d3C1N2d3 Two step recursive first order scheme C2N2dC2N2d SIS particle filter C3NC3N SIR particle filter C4NC4N
28
Numerical performances Three models chosen to make up the benchmark. Kalman filter (KF) Canonical stochastic volatility model (SVM) Explicit non linear filter
29
Kalman filter (KF) Both signal and observation equations are linear with Gaussian independent noises. Gaussian process which parameters (the two first moments) can be computed sequentially by a deterministic algorithm (KF)
30
Canonical stochastic volatility model (SVM) The time discretization of a continuous diffusion model. State Model
31
Explicit non linear filter A non linear non Gaussian state equation Serial Gaussian distributions SG() State Model
32
Numerical performance Results Convergence tests three test functions: Kalman filter: d=1
33
Numerical performance Results : Convergence rate improvement Kalman filter: d=3
34
Numerical performance Results Stochastic volatility model
35
Numerical performance Results Non linear explicit filter
36
Conclusions Particle methods do not suffer from dimension dependency when considering their theoretical convergence rate, whereas quantization based methods do depend on the dimension of the state space. Considering the theoretical convergence results, quantization methods are still competitive till dimension 2 for zero order schemes and till dimension 4 for first order ones. Quantization methods need smaller grid sizes than Monte Carlo methods to attain convergence regions
Similar presentations
© 2024 SlidePlayer.com Inc.
All rights reserved.