Target Tracking Using Kalman
Target Tracking Using Kalman
Target Tracking Using Kalman
SUBMITTED BY
DEVENDER BUDHWAR(4411)
SAHIL SANDHU(4455)
AMIT KUMAR KARNA (04403)
INDEX
INTRODUCTION TO KALMAN FILTER
PROBLEM DEFINITION
APPROACH
CODE
RESULT
CONCLUSION
INTRODUCTION
The Kalman filter is an efficient recursive filter which estimates
the state of a dynamic system from a series of incomplete and noisy
measurements, developed by Rudolf Kalman.
Kalman filters are an important technique for building fault-
tolerance into a wide range of systems, including real-time imaging.
In the field of motion estimation for video coding
many techniques have been applied . It is now quite
common to see the Kalman filtering technique and some
of its extensions to be used for the estimation of motion
within image sequences.
In control theory, the Kalman filter is most commonly referred to as
linear quadratic estimation (LQE)
PROBLEM DEFINITION
2D TARGET TRACKING.
The state of the system is represented as a vector of real numbers.
At each discrete time increment, a linear operator is applied to the
state to generate the new state, with some noise mixed in, and
optionally some information from the controls on the system if they
are known.
This Problem proposes a ball based motion estimation using Kalman
filtering to improve the motion vector estimates.
APPROACH
In order to use the Kalman filter to estimate the internal state of a
process given only a sequence of noisy observations, one must
model the process in accordance with the framework of the Kalman
filter. This means specifying the matrices Fk, Hk, Qk, Rk, and
sometimes Bk for each time-step k as described below.
where
Fk is the state transition model which is applied to the previous
state xk−1;
Bk is the control-input model which is applied to the control
vector uk;
wk is the process noise which is assumed to be drawn from a
zero mean multivariate normal distribution with covariance Qk.
APPROACH
V(k+ 1 )=F(k)V(k) + W(k) where V(k) is the motion
vector.
Prediction:
Motion vector prediction
V( k+ 1 / k ) = F( k ) V( k / k )
Prediction error
P(k+ 1/ k ) = F ( k ) P ( k / k ) F ' ( k ) + Q ( k )
where p( k )denotes the transpose matrix of F(k).
CODE
cc = 0;
cr = 0;
radius = 0;
flag = 0;
[MR,MC,Dim]
MR,MC,Dim] = size(Imback);
size(Imback);