CSCE643: Computer Vision Bayesian Tracking & Particle Filtering Jinxiang Chai Some slides from Stephen Roth.

Slides:



Advertisements
Similar presentations
SAMSI Discussion Session Random Sets/ Point Processes in Multi-Object Tracking: Vo Dr Daniel Clark EECE Department Heriot-Watt University UK.
Advertisements

Bayesian Belief Propagation
Data-Assimilation Research Centre
CSCE643: Computer Vision Mean-Shift Object Tracking Jinxiang Chai Many slides from Yaron Ukrainitz & Bernard Sarel & Robert Collins.
Jose-Luis Blanco, Javier González, Juan-Antonio Fernández-Madrigal University of Málaga (Spain) Dpt. of System Engineering and Automation May Pasadena,
Various Regularization Methods in Computer Vision Min-Gyu Park Computer Vision Lab. School of Information and Communications GIST.
Monte Carlo Localization for Mobile Robots Karan M. Gupta 03/10/2004
Visual Tracking CMPUT 615 Nilanjan Ray. What is Visual Tracking Following objects through image sequences or videos Sometimes we need to track a single.
Markov Localization & Bayes Filtering 1 with Kalman Filters Discrete Filters Particle Filters Slides adapted from Thrun et al., Probabilistic Robotics.
Introduction to Sampling based inference and MCMC Ata Kaban School of Computer Science The University of Birmingham.
PHD Approach for Multi-target Tracking
Probabilistic Robotics Bayes Filter Implementations Particle filters.
Tracking Objects with Dynamics Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 04/21/15 some slides from Amin Sadeghi, Lana Lazebnik,
Particle Filters Pieter Abbeel UC Berkeley EECS Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics TexPoint fonts used in EMF. Read.
Stanford CS223B Computer Vision, Winter 2007 Lecture 12 Tracking Motion Professors Sebastian Thrun and Jana Košecká CAs: Vaibhav Vaish and David Stavens.
Adaptive Rao-Blackwellized Particle Filter and It’s Evaluation for Tracking in Surveillance Xinyu Xu and Baoxin Li, Senior Member, IEEE.
Nonlinear and Non-Gaussian Estimation with A Focus on Particle Filters Prasanth Jeevan Mary Knox May 12, 2006.
Particle filters (continued…). Recall Particle filters –Track state sequence x i given the measurements ( y 0, y 1, …., y i ) –Non-linear dynamics –Non-linear.
Object Detection and Tracking Mike Knowles 11 th January 2005
Particle Filters for Mobile Robot Localization 11/24/2006 Aliakbar Gorji Roborics Instructor: Dr. Shiri Amirkabir University of Technology.
Today Introduction to MCMC Particle filters and MCMC
Probabilistic Robotics Bayes Filter Implementations Particle filters.
Particle Filtering for Non- Linear/Non-Gaussian System Bohyung Han
Novel approach to nonlinear/non- Gaussian Bayesian state estimation N.J Gordon, D.J. Salmond and A.F.M. Smith Presenter: Tri Tran
Bayesian Filtering for Location Estimation D. Fox, J. Hightower, L. Liao, D. Schulz, and G. Borriello Presented by: Honggang Zhang.
Particle Filtering. Sensors and Uncertainty Real world sensors are noisy and suffer from missing data (e.g., occlusions, GPS blackouts) Use sensor models.
Bayesian Filtering for Robot Localization
Particle Filtering in Network Tomography
Markov Localization & Bayes Filtering
BraMBLe: The Bayesian Multiple-BLob Tracker By Michael Isard and John MacCormick Presented by Kristin Branson CSE 252C, Fall 2003.
Object Tracking using Particle Filter
Human-Computer Interaction Human-Computer Interaction Tracking Hanyang University Jong-Il Park.
Computer vision: models, learning and inference Chapter 19 Temporal models.
From Bayesian Filtering to Particle Filters Dieter Fox University of Washington Joint work with W. Burgard, F. Dellaert, C. Kwok, S. Thrun.
A General Framework for Tracking Multiple People from a Moving Camera
SIS Sequential Importance Sampling Advanced Methods In Simulation Winter 2009 Presented by: Chen Bukay, Ella Pemov, Amit Dvash.
Computer vision: models, learning and inference Chapter 19 Temporal models.
Visual Tracking Conventional approach Build a model before tracking starts Use contours, color, or appearance to represent an object Optical flow Incorporate.
Jamal Saboune - CRV10 Tutorial Day 1 Bayesian state estimation and application to tracking Jamal Saboune VIVA Lab - SITE - University.
Probabilistic Robotics Bayes Filter Implementations.
Overview Particle filtering is a sequential Monte Carlo methodology in which the relevant probability distributions are iteratively estimated using the.
Particle Filters.
Forward-Scan Sonar Tomographic Reconstruction PHD Filter Multiple Target Tracking Bayesian Multiple Target Tracking in Forward Scan Sonar.
Virtual Vector Machine for Bayesian Online Classification Yuan (Alan) Qi CS & Statistics Purdue June, 2009 Joint work with T.P. Minka and R. Xiang.
Learning the Appearance and Motion of People in Video Hedvig Sidenbladh, KTH Michael Black, Brown University.
-Arnaud Doucet, Nando de Freitas et al, UAI
Mobile Robot Localization (ch. 7)
Maximum a posteriori sequence estimation using Monte Carlo particle filters S. J. Godsill, A. Doucet, and M. West Annals of the Institute of Statistical.
Michael Isard and Andrew Blake, IJCV 1998 Presented by Wen Li Department of Computer Science & Engineering Texas A&M University.
Boosted Particle Filter: Multitarget Detection and Tracking Fayin Li.
Looking at people and Image-based Localisation Roberto Cipolla Department of Engineering Research team
Sequential Monte-Carlo Method -Introduction, implementation and application Fan, Xin
Real-Time Tracking with Mean Shift Presented by: Qiuhua Liu May 6, 2005.
OBJECT TRACKING USING PARTICLE FILTERS. Table of Contents Tracking Tracking Tracking as a probabilistic inference problem Tracking as a probabilistic.
Tracking with dynamics
Particle Filtering. Sensors and Uncertainty Real world sensors are noisy and suffer from missing data (e.g., occlusions, GPS blackouts) Use sensor models.
1 Chapter 8: Model Inference and Averaging Presented by Hui Fang.
Introduction to Sampling Methods Qi Zhao Oct.27,2004.
The Unscented Particle Filter 2000/09/29 이 시은. Introduction Filtering –estimate the states(parameters or hidden variable) as a set of observations becomes.
Monte Carlo Localization for Mobile Robots Frank Dellaert 1, Dieter Fox 2, Wolfram Burgard 3, Sebastian Thrun 4 1 Georgia Institute of Technology 2 University.
Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks Arnaud Doucet, Nando de Freitas, Kevin Murphy and Stuart Russell CS497EA presentation.
Density Estimation in R Ha Le and Nikolaos Sarafianos COSC 7362 – Advanced Machine Learning Professor: Dr. Christoph F. Eick 1.
Learning Image Statistics for Bayesian Tracking Hedvig Sidenbladh KTH, Sweden Michael Black Brown University, RI, USA
Introduction to Sampling based inference and MCMC
Tracking Objects with Dynamics
Particle Filtering for Geometric Active Contours
Probabilistic Robotics
Visual Tracking CMPUT 615 Nilanjan Ray.
PRAKASH CHOCKALINGAM, NALIN PRADEEP, AND STAN BIRCHFIELD
Tracking Many slides adapted from Kristen Grauman, Deva Ramanan.
Presentation transcript:

CSCE643: Computer Vision Bayesian Tracking & Particle Filtering Jinxiang Chai Some slides from Stephen Roth

Appearance-based Tracking

Review: Mean-Shift Tracking Key idea #1: Formulate the tracking problem as nonlinear optimization by maximizing color histogram consistency between target and template.

Key idea #2: Solving the optimization problem with mean-shift techniques Review: Mean-Shift Tracking

Lucas-Kanade Registration & Mean-Shift Tracking Key Idea #1: Formulate the tracking/registration as a function optimization problem Lucas-Kanade registration Mean Shift Tracking

Key Idea #2: Iteratively solve the optimization problem with gradient-based optimization techniques A ATbATb b (A T A) -1 Linear approx. (around y 0 ) Independent of y Density estimate! (as a function of y) Gauss-NewtonMean Shift Lucas-Kanade Registration & Mean-Shift Tracking

Optimization-based Tracking Pros: + computationally efficient + sub-pixel accuracy + flexible for tracking a wide variety of objects (optical flow, parametric motion models, 2D color histograms, 3D objects)

Optimization-based Tracking Cons: - prone to local minima due to local optimization techniques. This could be improved by global optimization techniques such as Particle swamp and Interacting Simulated AnnealingParticle swamp Interacting Simulated Annealing - fail to model multi-modal tracking results due to tracking ambiguities (e.g., occlusion, illumination changes)

Optimization-based Tracking Cons: - prone to local minima due to local optimization techniques. This could be improved by global optimization techniques such as Particle swamp and Interacting Simulated AnnealingParticle swamp Interacting Simulated Annealing - fail to model multi-modal tracking results due to tracking ambiguities (e.g., occlusion, illumination changes) Solution: Bayesian Tracking & Particle Filter

Particle Filtering Many different names -Sequential Monte Carlo filters - Bootstrap filters -Condensation Algorithm

Bayesian Rules Observed measurements Hidden states Many computer vision problems can be formulated a posterior estimation problem

Bayesian Rules Posterior: This is what you want. Knowing p(X|Z) will tell us what is the most likely state X. Many computer vision problems can be formulated a posterior estimation problem

Bayesian Rules Posterior: This is what you want. Knowing p(X|Z) will tell us what is the most likely state X. Likelihood term: This is what you can evaluate

Bayesian Rules Posterior: This is what you want. Knowing p(X|Z) will tell us what is the most likely state X. Likelihood term: This is what you can evaluate Prior: This is what you may know a priori, or what you can predict

Bayesian Rules Posterior: This is what you want. Knowing p(X|Z) will tell us what is the most likely state X. Likelihood term: This is what you can evaluate Prior: This is what you may know a priori, or what you can predict Evidence: This is a constant for observed measurements such as images

Bayesian Tracking Problem statement: estimate the most likely state x k given the observations thus far Z k ={z 1,z 2,…,z k } …… x1x1 x k-2 x k-1 xkxk z1z1 z k-2 z k-1 zkzk Observed measurements Hidden state

Notations

Examples 2D region tracking x k :2D location and scale of interesting regions z k : color histograms of the region

Examples 2D Contour tracking x k : control points of spline-based contour representation z k : edge strength perpendicular to contour

Examples 3D head tracking x k :3D head position and orientation z k : color images of head region [Jing et al, 2003]

Examples 3D skeletal pose tracking x k : 3D skeletal poses z k : image measurements including silhouettes, edges, colors, etc.

Bayesian Tracking Construct the posterior probability density function of the state based on all available information By knowing the posterior many kinds of estimates for can be derived –mean (expectation), mode, median, … –Can also give estimation of the accuracy (e.g. covariance) Thomas Bayes Sample space Posterior

Bayesian Tracking State posteriorMean state

Bayesian Tracking Goal: estimate the most likely state given the observed measurements up to the current frame

Recursive Bayesian Estimation

Bayesian Formulation

Bayesian Tracking

…… x1x1 x k-2 x k-1 xkxk z1z1 z k-2 z k-1 zkzk Observed measurements Hidden state

Bayesian Tracking …… x1x1 x k-2 x k-1 xkxk z1z1 z k-2 z k-1 zkzk Observed measurements Hidden state

Bayesian Tracking

…… x1x1 x k-2 x k-1 xkxk z1z1 z k-2 z k-1 zkzk Observed measurements Hidden state

Bayesian Tracking: Temporal Priors The PDF models the prior knowledge that predicts the current hidden state using previous states - simple smoothness prior, e.g., - linear models, e.g., - more complicated prior models can be constructed via data-driven modeling techniques or physics-based modeling techniques

Bayesian Tracking: Likelihood …… x1x1 x k-2 x k-1 xkxk z1z1 z k-2 z k-1 zkzk Observed measurements Hidden state

Bayesian Tracking: Likelihood The likelihood term measures how well the hidden state matches the observed measurements

Bayesian Tracking: Likelihood The likelihood term measures how well the hidden state matches the observed measurements - In general, we can define the likelihood using analysis-by-synthesis strategy. - We often assume residuals are normal distributed.

Bayesian Tracking: Likelihood The likelihood term measures how well the hidden state matches the observed measurements x k :2D location and scale z k : color histograms How to define the likelihood term for 2D region tracking?

Bayesian Tracking: Likelihood The likelihood term measures how well the hidden state matches the observed measurements x k :2D location and scale z k : color histograms Matching residuals

Bayesian Tracking: Likelihood The likelihood term measures how well the hidden state matches the observed measurements x k :2D location and scale z k : color histograms Matching residuals Equivalent to

Bayesian Tracking: Likelihood The likelihood term measures how well the hidden state matches the observed measurements x k :3D head position and orientation z k : color images of head region Synthesized image

Bayesian Tracking: Likelihood The likelihood term measures how well the hidden state matches the observed measurements x k :3D head position and orientation z k : color images of head region observed image

Bayesian Tracking: Likelihood The likelihood term measures how well the hidden state matches the observed measurements x k :3D head position and orientation z k : color images of head region Matching residuals

Bayesian Tracking How to estimate the following posterior?

Bayesian Tracking How to estimate the following posterior? The posterior distribution p(x|z) may be difficult or impossible to compute in closed form.

Bayesian Tracking How to estimate the following posterior? The posterior distribution p(x|z) may be difficult or impossible to compute in closed form. An alternative is to represent p(x|z) using Monte Carlo samples (particles): –Each particle has a value and a weight x x

Multiple Modal Posteriors

Non-Parametric Approximation

-This is similar kernel-based density estimation! - However, this is normally not necessary

Non-Parametric Approximation

How Does This Help Us?

Monte Carlo Approximation

Filtering: Step-by-Step

Temporal Propagation

after a few iterations, most particles have negligible weight (the weight is concentrated on a few particles only)!

Resampling

Particle Filtering Isard & Blake IJCV 98

Particle Filtering Isard & Blake IJCV 98

Particle Filtering Isard & Blake IJCV 98

Particle Filtering Isard & Blake IJCV 98

Particle Filtering Isard & Blake IJCV 98

Particle Filtering in Action Video (click here)here

State Posterior Isard & Blake IJCV 98

Leaf Examples Video (click here)here

Dancing Examples Video (click here)here

Hand Examples Video (click here)here

Some Properties It can be shown that in the infinite particle limit this converges to the correct solution [Isard & Blake]. In practice, we of course want to use a finite number. - In low-dimensional spaces we might only need 100s of particles for the procedure to work well. - In high-dimensional spaces sometimes 1000s, 10000s or even more particles are needed. There are many variants of this basic procedure, some of which are more efficient (e.g. need fewer particles) - See e.g.: Arnaud Doucet, Simon Godsill, Christophe Andrieu: On sequential Monte Carlo sampling methods for Bayesian filtering. Statistics and Computing, vol. 10, pp , 2000.

Summary: Particle Filtering Advantages + can deal with nonlinearities and non-Gaussian noise + use temporal priors for tracking + Multi-modal posterior okay + Multiple samples provides multiple hypotheses + Easy to implement Disadvantages - might become computationally inefficient, particularly when tracking in a high-dimensional state space (e.g., 3D human bodies) - but parallelizable and thus can be accelerated via GPU implementations.