Professional Documents
Culture Documents
Vehicle Movement Tracking: Written by Goldberg Stanislav For Vision Topics Seminar
Vehicle Movement Tracking: Written by Goldberg Stanislav For Vision Topics Seminar
http://micro.magnet.fsu.edu/electromag/java/detector/index.html
Pros: Accurate counting Stable under different lighting and traffic conditions Cons: Costly : require digging up the road surface Unable to provide additional traffic parameters
Tracking Requirements
1) Automatic segmentation of a vehicle from a background and other vehicles so there can be a unique track associated with each vehicle 2) Deal with variety of vehicles motorcycles, passenger cars, buses, construction equipment, trucks, etc. 3) Deal with a range of traffic conditions light midday traffic, rush-hour congestion, varying speeds in different lanes. 4) Deal with variety of lighting conditions day, evening, night , sunny, overcast, rainy days. 5) Real-time operation of the system
The Algorithm
A projective transform H , or homography, is used to map from image coordinates (x,y) to world coordinates (X,Y)
H
X Y
cos sin 0
x cos y cos
sin cos 0
y sin x sin
x0 y0 1
x0 y0
Features detection
Corner features are chosen as sub-features Corner detector is based on image gradient
Features detection
Horizontal ( x axis) differentiation can be approximated by
Vertical ( y axis )
Features detection
We assume that between the (k 1)th and kth timestep the vehicle undergoes a constant acceleration of ak that is normally distributed, with mean 0 and standard deviation a. From Newton laws of motion we conclude that:
xk xk
xk xk
1 1
xk t ak t
ak t2 2
x v
x0 v0
vt at
a t2 2
Features tracking
Kalman filtering predicts the area where to search for each corner feature Corner feature is found The distance between predicted and measured feature is computed If the distance is above threshold the track is rejected
Features tracking
Grouping
The central principle: common motion When sub-feature is detected , it initially connected to all neighboring tracks within certain radius For all joined pairs of tracks pa(t), pb(t), relative displacement d(t)= pa(t)- pb(t) is calculated For each frame d value is computed for each edge and edge is broken if either maxtdx(t)- mintdx(t)> thresholdx maxtdy(t)- mintdy(t)> thresholdy Shadow sub-features tend to be unstable over time, so grouping eliminates them.
Grouping
Grouping : problems
Oversegmentation one vehicle is grouped into several segments Overgrouping several vehicles are grouped into one segment
Results
Length in min:sec G number of reported vehicles (by algorithm ) N number of actual vehicles (counted by human)
Results
True match: A one to one match between ground truth and a group False negative: An unmatched ground truth Oversegmentation: A ground truth that is matched by more then one group False positive: An unmatched group Overgrouping: A group that matches more then one ground truth
Results
Start End
The end