DocumentCode
3210049
Title
Probabilistic data association methods in visual tracking of groups
Author
Gennari, G. ; Hager, G.D.
Author_Institution
Inf. Eng., Padova Univ., Italy
Volume
2
fYear
2004
fDate
27 June-2 July 2004
Abstract
Data association is a fundamental problem when tracking large numbers of moving targets. Most commonly employed methods of data association such as the JPDA estimator are combinatorial and therefore do not scale well to large numbers of targets. However, in many cases large numbers of targets form natural groups which can be efficiently tracked. We describe a method for defining groups based on the position and velocity of targets. This definition introduces a natural set of merging and splitting rules that are embedded into a Kalman filtering framework for tracking multiple groups. In cases where groups of different velocities cross, a general methodology for matching measurements to groups is introduced. This algorithm is based on a modified version of the PDA estimator. It is well suited to handle a high number of measurements and extends naturally to additional grouping constraints such as color or shape.
Keywords
Kalman filters; computer vision; image motion analysis; probability; target tracking; JPDA estimator; Kalman filtering framework; grouping constraints; measurement matching; multiple group tracking; probabilistic data association methods; visual tracking; Computer science; Computer vision; Data engineering; Filtering; Kalman filters; Merging; Personal digital assistants; Shape measurement; Target tracking; Velocity measurement;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision and Pattern Recognition, 2004. CVPR 2004. Proceedings of the 2004 IEEE Computer Society Conference on
ISSN
1063-6919
Print_ISBN
0-7695-2158-4
Type
conf
DOI
10.1109/CVPR.2004.1315257
Filename
1315257
Link To Document