tracking by sajid ali(nitttr,chandigarh)

Upload: sajid-ali

Post on 08-Apr-2018

219 views

Category:

Documents


0 download

TRANSCRIPT

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    1/38

    Presented By:SajidAliCSE (Regular)-2010

    NITTTR, Chandigarh

    Tracking with Linear Dynamic

    Models

    1

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    2/38

    Contents:

    Sajid Ali,NITTTR2

    y Tracking

    y Three main issues

    y Assumptions

    y Tracking as Inductiony Linear Dynamic Models

    y Kalman Filter

    y References

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    3/38

    Tracking

    Sajid Ali,NITTTR3

    y Tracking is the problem of generating an inference about themotion of an object given a sequence of images.

    y The key technical difficulty is maintaining an accurate

    representation of the posterior on object position givenmeasurements, and doing so efficiently.

    y Targeting: a significant fraction of the tracking literature isoriented towards (a) deciding what to shoot and (b) hitting it.Typically, this literature describes tracking using radar or infra-

    red signals (rather than vision).

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    4/38

    Tracking(Cont..)

    Sajid Ali,NITTTR4

    y Very general model:

    y We assume there are moving objects, which have anunderlying state X

    y There are measurements Y, some of which are functions ofthis state

    y There is a clock

    y at each tick, the state changes

    y at each tick, we get a new observation

    y Examples

    y object is ball, state is 3D position+velocity, measurements arestereo pairs

    y object is person, state is body configuration, measurementsare frames, clock is in camera (30 fps)

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    5/38

    Sajid Ali,NITTTR5

    Three main Issues in Tracking

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    6/38

    Simplifying Assumptions

    Sajid Ali,NITTTR6

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    7/38

    Tracking as induction

    Sajid Ali,NITTTR

    y Assume data association is done

    y well talk about this later; a dangerous assumption

    y Do correction for the 0th frame

    yAssume we have corrected estimate for ith framey show we can do prediction for i+1, correction for i+1

    7

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    8/38

    Base case

    Sajid Ali,NITTTR8

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    9/38

    Induction step

    Sajid Ali,NITTTR

    Given

    9

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    10/38

    Induction step (Cont.)

    Sajid Ali,NITTTR10

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    11/38

    Linear dynamic models

    Sajid Ali,NITTTR

    yUse notation ~ to mean hasthe pdf of , N(a, b) is anormal distribution withmean a and covariance b.

    y Then a linear dynamic modelhas the form

    y This is much, much moregeneral than it looks, andextremely powerful

    y We are on a boat at night andlost our position

    y We know: star position

    yi

    ! N Mix

    i;7

    m i

    xi

    ! N Di1xi1;7di

    11

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    12/38

    Examples

    Sajid Ali,NITTTR

    y Drifting points

    y we assume that the new position of the point is the old one, plusnoise.

    y For the measurement model, we may not need to observe thewhole state of the objecty e.g. a point moving in 3D, at the 3kth tick we see x, 3k+1th tick we see

    y, 3k+2th tick we see z

    y in this case, we can still make decent estimates ofall three coordinates ateach tick.

    y This property, which does not apply to every model, is calledObservability

    12

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    13/38

    Examples

    Sajid Ali,NITTTR

    y Points moving with constant velocity

    y Periodic motion

    y Points moving with constant acceleration

    13

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    14/38

    Points moving with constant velocity

    Sajid Ali,NITTTR

    y We have

    y (the Greek letters denote noise terms)

    y Stack (u, v) into a single state vector

    y which is the form we had above

    ui

    ui 1

    (tvi1 Ii

    vi! v

    i1 :i

    v

    i !

    1 (t

    0 1

    u

    v

    i1noise

    14

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    15/38

    Points moving with constant

    acceleration

    Sajid Ali,NITTTR

    y We have

    y (the Greek letters denote noise terms)

    y Stack (u, v) into a single state vector

    y which is the form we had above

    ui

    ui 1

    (tvi1

    Ii

    vi! v

    i1 (ta

    i1 :

    i

    ai

    ! ai

    1 \i

    v

    i

    !

    1 (t 0

    0 1 (t

    0 0 1

    u

    v

    i1

    noise

    15

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    16/38

    Sajid Ali,NITTTR16

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    17/38

    Sajid Ali,NITTTR17

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    18/38

    The Kalman Filter

    Sajid Ali,NITTTR

    y Key ideas:

    y Linear models interact uniquely well with Gaussian noise -make the prior Gaussian, everything else Gaussian and thecalculations are easy

    y Gaussians are really easy to represent --- once you know themean and covariance, youre done

    18

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    19/38

    What is it used for ?

    Sajid Ali,NITTTR19

    y Tracking missiles

    y Tracking heads/hands/drumsticks

    y Extracting lip motion from video

    y Fitting Bezier patches to point datay Lots of computer vision applications

    y Economics

    y Navigation

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    20/38

    The Kalman Filter in 1D

    Sajid Ali,NITTTR

    y Dynamic Model

    y Notation

    Predicted mean

    Corr

    ected mean

    20

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    21/38

    Prediction for 1D Kalman filter

    Sajid Ali,NITTTR

    y The new state is obtained by

    y multiplying old state by known constant

    y adding zero-mean noise

    y

    Therefore, predicted mean for new state isy constant times mean for old state

    y Predicted variance is

    y 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 rvs adds variance

    21

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    22/38

    Sajid Ali,NITTTR22

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    23/38

    Correction for 1D Kalman filter

    Sajid Ali,NITTTR

    y Pattern match to identities given in book

    ybasically, guess the integrals, get:

    y

    Notice:y if measurement noise is small,

    we rely mainly on the measurement,

    if its large, mainly on the

    prediction

    23

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    24/38

    Sajid Ali,NITTTR

    In higher dimensions,

    derivation follows the

    same lines, but isnt as

    easy. Expressions here.

    24

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    25/38

    Sajid Ali,NITTTR25

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    26/38

    Sajid Ali,NITTTR26

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    27/38

    Smoothing

    Sajid Ali,NITTTR

    y Idea

    y We dont have the best estimate of state - what about thefuture?

    y Run two filters, one moving forward, the other backward intime.

    y Now combine state estimates

    y The crucial point here is that we can obtain a smoothed estimate byviewing the backward filters prediction as yet another measurement for

    the forward filtery so weve already done the equations

    27

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    28/38

    Sajid Ali,NITTTR28

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    29/38

    Sajid Ali,NITTTR29

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    30/38

    Sajid Ali,NITTTR30

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    31/38

    Data Association

    Sajid Ali,NITTTR

    y Nearest neighbours

    y choose the measurement with highest probability givenpredicted state

    y popular, but can lead to catastrophe

    y Probabilistic Data Association

    y combine measurements, weighting by probability givenpredicted state

    y gate using predicted state

    31

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    32/38

    Sajid Ali,NITTTR32

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    33/38

    Sajid Ali,NITTTR33

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    34/38

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    35/38

    Sajid Ali,NITTTR35

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    36/38

    Sajid Ali,NITTTR36

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    37/38

    References:

    Sajid Ali,NITTTR37

    y http://www.cs.utexas.edu/~grauman/courses/fall2008/slides/lecture23_tracking.ppt

    y http://luthuli.cs.uiuc.edu/~daf/book/bookpages/Slides/Tracking.ppt

  • 8/6/2019 Tracking By Sajid Ali(Nitttr,Chandigarh)

    38/38

    Sajid Ali,NITTTR38

    Thanks