Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth The three main issues in tracking.

Slides:



Advertisements
Similar presentations
State Space Models. Let { x t :t T} and { y t :t T} denote two vector valued time series that satisfy the system of equations: y t = A t x t + v t (The.
Advertisements

Copula Regression By Rahul A. Parsa Drake University &
1 12. Principles of Parameter Estimation The purpose of this lecture is to illustrate the usefulness of the various concepts introduced and studied in.
Computer Vision - A Modern Approach Set: Probability in segmentation Slides by D.A. Forsyth Missing variable problems In many vision problems, if some.
Integration of sensory modalities
Observers and Kalman Filters
Visual Recognition Tutorial
Prof. Trevor Darrell Lecture 19: Tracking
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,
Motion Tracking. Image Processing and Computer Vision: 82 Introduction Finding how objects have moved in an image sequence Movement in space Movement.
Image processing. Image operations Operations on an image –Linear filtering –Non-linear filtering –Transformations –Noise removal –Segmentation.
Mobile Intelligent Systems 2004 Course Responsibility: Ola Bengtsson.
Copyright © 2009 Pearson Education, Inc. Chapter 16 Random Variables.
Tracking using the Kalman Filter. Point Tracking Estimate the location of a given point along a sequence of images. (x 0,y 0 ) (x n,y n )
Estimation and the Kalman Filter David Johnson. The Mean of a Discrete Distribution “I have more legs than average”
© 2003 by Davi GeigerComputer Vision November 2003 L1.1 Tracking We are given a contour   with coordinates   ={x 1, x 2, …, x N } at the initial frame.
1-1 Copyright © 2015, 2010, 2007 Pearson Education, Inc. Chapter 15, Slide 1 Chapter 15 Random Variables.
Tracking with Linear Dynamic Models. Introduction Tracking is the problem of generating an inference about the motion of an object given a sequence of.
Kalman Filtering Pieter Abbeel UC Berkeley EECS Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics TexPoint fonts used in EMF. Read.
Modern Navigation Thomas Herring
Principles of the Global Positioning System Lecture 13 Prof. Thomas Herring Room A;
Slam is a State Estimation Problem. Predicted belief corrected belief.
Perceptual and Sensory Augmented Computing Computer Vision II, Summer’14 Computer Vision II – Lecture 8 Tracking with Linear Dynamic Models
TP15 - Tracking Computer Vision, FCUP, 2013 Miguel Coimbra Slides by Prof. Kristen Grauman.
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 16 Random Variables.
Human-Computer Interaction Human-Computer Interaction Tracking Hanyang University Jong-Il Park.
Computer vision: models, learning and inference Chapter 19 Temporal models.
Computer Vision Group Prof. Daniel Cremers Autonomous Navigation for Flying Robots Lecture 6.2: Kalman Filter Jürgen Sturm Technische Universität München.
SIS Sequential Importance Sampling Advanced Methods In Simulation Winter 2009 Presented by: Chen Bukay, Ella Pemov, Amit Dvash.
1 7. Two Random Variables In many experiments, the observations are expressible not as a single quantity, but as a family of quantities. For example to.
Probabilistic Robotics Bayes Filter Implementations.
1 Chapter 16 Random Variables. 2 Expected Value: Center A random variable assumes a value based on the outcome of a random event.  We use a capital letter,
Karman filter and attitude estimation Lin Zhong ELEC424, Fall 2010.
Multiple Random Variables Two Discrete Random Variables –Joint pmf –Marginal pmf Two Continuous Random Variables –Joint Distribution (PDF) –Joint Density.
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology Principles of Parameter Estimation.
Processing Sequential Sensor Data The “John Krumm perspective” Thomas Plötz November 29 th, 2011.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Chapter 16 Random Variables.
Slide 16-1 Copyright © 2004 Pearson Education, Inc.
1 Assignment, Project and Presentation Mobile Robot Localization by using Particle Filter by Chong Wang, Chong Fu, and Guanghui Luo. Tracking, Mapping.
An Introduction to Kalman Filtering by Arthur Pece
NCAF Manchester July 2000 Graham Hesketh Information Engineering Group Rolls-Royce Strategic Research Centre.
EECS 274 Computer Vision Tracking. Motivation: Obtain a compact representation from an image/motion sequence/set of tokens Should support application.
Tracking with dynamics
Joint Moments and Joint Characteristic Functions.
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION Kalman Filter with Process Noise Gauss- Markov.
General approach: A: action S: pose O: observation Position at time t depends on position previous position and action, and current observation.
11/25/03 3D Model Acquisition by Tracking 2D Wireframes Presenter: Jing Han Shiau M. Brown, T. Drummond and R. Cipolla Department of Engineering University.
Chapter 15 Random Variables.
Chapter 15 Random Variables
Tracking We are given a contour G1 with coordinates G1={x1 , x2 , … , xN} at the initial frame t=1, were the image is It=1 . We are interested in tracking.
Tracking Objects with Dynamics
Chapter 16 Random Variables
Probabilistic Robotics
Hidden Markov Models Part 2: Algorithms
7. Two Random Variables In many experiments, the observations are expressible not as a single quantity, but as a family of quantities. For example to record.
Chapter 16 Random Variables Copyright © 2009 Pearson Education, Inc.
Bayes and Kalman Filter
CSSE463: Image Recognition Day 30
Principles of the Global Positioning System Lecture 13
CSSE463: Image Recognition Day 30
Parametric Methods Berlin Chen, 2005 References:
7. Two Random Variables In many experiments, the observations are expressible not as a single quantity, but as a family of quantities. For example to record.
CSSE463: Image Recognition Day 30
Chapter 16 Random Variables Copyright © 2010 Pearson Education, Inc.
Kalman Filter: Bayes Interpretation
7. Two Random Variables In many experiments, the observations are expressible not as a single quantity, but as a family of quantities. For example to record.
The Discrete Kalman Filter
Tracking Many slides adapted from Kristen Grauman, Deva Ramanan.
Nome Sobrenome. Time time time time time time..
Presentation transcript:

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth The three main issues in tracking

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth Tracking Very general model: –We assume there are moving objects, which have an underlying state X –There are measurements Y, some of which are functions of this state –There is a clock at each tick, the state changes at each tick, we get a new observation Examples –object is ball, state is 3D position+velocity, measurements are stereo pairs –object is person, state is body configuration, measurements are frames, clock is in camera (30 fps)

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth Three main steps

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth Simplifying Assumptions

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth Tracking as induction Assume data association is done –we’ll talk about this later; a dangerous assumption Do correction for the 0’th frame Assume we have corrected estimate for i’th frame –show we can do prediction for i+1, correction for i+1

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth Base case

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth Induction step Given

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth Induction step

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth Linear dynamic models Use notation ~ to mean “has the pdf of”, N(a, b) is a normal distribution with mean a and covariance b. Then a linear dynamic model has the form This is much, much more general than it looks, and extremely powerful

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth Examples Drifting points –we assume that the new position of the point is the old one, plus noise. –For the measurement model, we may not need to observe the whole state of the object e.g. a point moving in 3D, at the 3k’th tick we see x, 3k+1’th tick we see y, 3k+2’th tick we see z in this case, we can still make decent estimates of all three coordinates at each tick. –This property, which does not apply to every model, is called Observability

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth Examples Points moving with constant velocity Periodic motion Etc. Points moving with constant acceleration

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth Points moving with constant velocity We have –(the Greek letters denote noise terms) Stack (u, v) into a single state vector –which is the form we had above

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth Points moving with constant acceleration We have –(the Greek letters denote noise terms) Stack (u, v) into a single state vector –which is the form we had above

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth The Kalman Filter Key ideas: –Linear models interact uniquely well with Gaussian noise - make the prior Gaussian, everything else Gaussian and the calculations are easy –Gaussians are really easy to represent --- once you know the mean and covariance, you’re done

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth The Kalman Filter in 1D Dynamic Model Notation Predicted mean Corrected mean

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth Prediction for 1D Kalman filter The new state is obtained by –multiplying old state by known constant –adding zero-mean noise Therefore, predicted mean for new state is –constant times mean for old state Predicted variance is –sum of constant^2 times old state variance and noise variance Because: old state is normal random variable, multiplying normal rv by constant implies mean is multiplied by a constant variance by square of constant, adding zero mean noise adds zero to the mean, adding rv’s adds variance

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth Correction for 1D Kalman filter Pattern match to identities given in book –basically, guess the integrals, get: Notice: –if measurement noise is small, we rely mainly on the measurement, if it’s large, mainly on the prediction

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth In higher dimensions, derivation follows the same lines, but isn’t as easy. Expressions here.

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth Smoothing Idea –We don’t have the best estimate of state - what about the future? –Run two filters, one moving forward, the other backward in time. –Now combine state estimates The crucial point here is that we can obtain a smoothed estimate by viewing the backward filter’s prediction as yet another measurement for the forward filter –so we’ve already done the equations

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth Data Association Nearest neighbours –choose the measurement with highest probability given predicted state –popular, but can lead to catastrophe Probabilistic Data Association –combine measurements, weighting by probability given predicted state –gate using predicted state

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth

Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth