1 / 16

CV Workshop: Multiple Target Tracking

CV Workshop: Multiple Target Tracking. Michael Rubinstein IDC. Some images taken from Welch & Bishop 2001. Target Tracking and MTT. The problem: Input: Detection/Sensor (noisy) measurements Estimating the most probable measurement at time k from measurements up to time k’ k‘<k: prediction

ira
Download Presentation

CV Workshop: Multiple Target Tracking

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. CV Workshop:Multiple Target Tracking Michael Rubinstein IDC Some images taken from Welch & Bishop 2001

  2. Target Tracking and MTT • The problem: • Input: Detection/Sensor (noisy) measurements • Estimating the most probable measurement at time k from measurements up to time k’ • k‘<k: prediction • K’>k: smoothing • Various applications • Computer vision (tracking), robotics, control theory, astronomy, ballistics (missiles), econometrics (stocks), etc…

  3. MTT • Why did I choose this topic? • Interesting and wanted to learn it • Eshel and Moses – CVPR 2008 Eshel & Moses 2008

  4. The Kalman Filter - Simple Example • Lost at sea • Night • No idea of location • For simplicity – let’s assume 1D

  5. Simple Example • Time t1: Star Sighting • Denote x(t1)=z1 • Uncertainty (inaccuracies, human error, etc) • Denote 1 (normal) • Can establish the conditional probability of x(t1) given measurement z1

  6. Simple Example • Probability for any location, based on measurement • For Gaussian density – 68.3% within 1 • Best estimate of position: Mean/Mode/Median

  7. Simple Example • Time t2t1: friend (more trained) • x(t2)=z2, (t2)=2 • Since she has higher skill: 2<1

  8. Simple Example • f(x(t2)|z1,z2) also Gaussian

  9. Simple Example •  less than both 1 and 2 • 1= 2: average • 1> 2: more weight to z2 • Rewrite:

  10. Simple Example • The Kalman update rule: Best estimate Given z2 (a poseteriori) Best Prediction prior to z2 (a priori) Optimal Weighting (Kalman Gain) Residual

  11. Linear Dynamic Systems • (Stochastic) Process Model • Measurement Model

  12. Kalman Filter • Under certain assumptions…

  13. Results

  14. Results

  15. Higher Measurement Certainty Lower Measurement Certainty

  16. TODO… • Multiple targets • Physical human motion models • Particle filter

More Related