Particle Filters - PowerPoint PPT Presentation

About This Presentation
Title:

Particle Filters

Description:

Title: Phd Thesis Proposal Author: Haris Baltzakis Last modified by: mperkows Created Date: 6/28/2001 10:42:35 AM Document presentation format: On-screen Show (4:3) – PowerPoint PPT presentation

Number of Views:43
Avg rating:3.0/5.0
Slides: 31
Provided by: Hari98
Learn more at: http://web.cecs.pdx.edu
Category:

less

Transcript and Presenter's Notes

Title: Particle Filters


1
Particle Filters
2
(No Transcript)
3
(No Transcript)
4
(No Transcript)
5
(No Transcript)
6
(No Transcript)
7
Application Examples
  • Robot localization
  • Robot mapping
  • Visual Tracking
  • e.g. human motion (body parts)
  • Prediction of (financial) time series
  • e.g. mapping gold price to stock price
  • Target recognition from single or multiple images
  • Guidance of missiles
  • Contour grouping
  • Nice video demos
  • http//www.cs.washington.edu/ai/Mobile_Robotics/m
    cl/

8
2nd Book Advert
  • Statistical Pattern Recognition
  • Andrew Webb, DERA
  • ISBN 0340741643,
  • Paperback 1999 29.99
  • Butterworth Heinemann
  • Contents
  • Introduction to SPR, Estimation, Density
    estimation, Linear discriminant analysis,
    Nonlinear discriminant analysis - neural
    networks, Nonlinear discriminant analysis -
    statistical methods, Classification trees,
    Feature selction and extraction, Clustering,
    Additional topics, Measures of dissimilarity,
    Parameter estimation, Linear algebra, Data,
    Probability theory.

9
Homework
  • Implement all three particle filter algorithms
  • SIS Particle Filter Algorithm (p. 27)
  • Basic SIR Particle Filter algorithm (p. 39,40)
  • Generic SIR Particle Filter algorithm (p. 42)
  • and evaluate their performance on a problem of
    your choice.
  • Groups of two are allowed.
  • Submit a report and a ready to run Matlab code
    (with a script and the data).
  • Present a report to the class.

10
Particle Filters
  • Often control models are non-linear and noise is
    non-gausian.
  • We use particles to represent the distribution
  • Survival of the fittest

Motion model

Proposal distribution
Observation model (weight)
11
Particle Filters SIS-R algorithm
  • Initialize particles randomly (Uniformly or
    according to prior knowledge)
  • At each time step
  • For each particle
  • Use motion model to predict new pose (sample from
    transition priors)
  • Use observation model to assign a weight to each
    particle (posterior/proposal)

Sequential importance sampling

Motion model

Proposal distribution
Observation model (weight)
12
Particle Filters RE-SAMPLING
  • Initialize particles randomly (Uniformly or
    according to prior knowledge)
  • At each time step
  • For each particle
  • Use motion model to predict new pose (sample from
    transition priors)
  • Use observation model to assign a weight to each
    particle (posterior/proposal)
  • Create A new set of equally weighted particles by
    sampling the distribution of the weighted
    particles produced in the previous step.

Sequential importance sampling

SelectionRe-sampling
13
Example 1 of a Particle Filter
Something is known
14
Particle Filters Example 1

15
Particle Filters Example 1
Use motion model to predict new pose (move each
particle by sampling from the transition prior)

16
Particle Filters Example 1
Use measurement model to compute
weights (weightobservation probability)

17
Particle Filters Example 1

Resample
18
Example 2 of a Particle Filter
Nothing is known
19
Particle Filters Example 2

Initialize particles uniformly
20
Particle Filters Example 2

21
Particle Filters Example 2

22
Particle Filters Example 2

23
Particle Filters Example 2

24
Particle Filters Example 2

25
Discussion of Continuous State Approaches
Kalman Filters
pluses
  • Perform very accurately if the inputs are precise
    (performance is optimal with respect to any
    criterion in the linear case).
  • Computational efficiency.

minuses
  • Requirement that the initial state is known.
  • Inability to recover from catastrophic failures
  • Inability to track Multiple Hypotheses the state
    (Gaussians have only one mode)

26
Discussion of Discrete State Approaches
Particle Filters
  • Ability (to some degree) to operate even when its
    initial pose is unknown (start from uniform
    distribution).
  • Ability to deal with noisy measurements.
  • Ability to represent ambiguities (multi modal
    distributions).
  • Computational time scales heavily with the number
    of possible states (dimensionality of the grid,
    number of samples, size of the map).
  • Accuracy is limited by the size of the grid
    cells/number of particles-sampling method.
  • Required number of particles is unknown

27
(No Transcript)
28
(No Transcript)
29
Sources
  • Paul E. Rybski
  • Haris Baltzakis

30
PR Virtual Architecture with Kalman Filters
  • Sensor records samples
  • Image processing step extracts specific features
  • Target size, vertical position, horizontal
    position, target bearing, elevation, etc.
  • Kalman filters extract sensor noise
  • Results are sent to a central location to be
    displayed
Write a Comment
User Comments (0)
About PowerShow.com