Multi-Target Tracking - Linking Identities using Bayesian Network Inference

Multi-target tracking requires locating the targets and labeling their identities. The latter is a challenge when many targets, with indistinct appearances, frequently occlude one another, as in football and surveillance tracking. We present an approach to solving this labeling problem. When isolated, a target can be tracked and its identity maintained. While, if targets interact this is not always the case. This paper assumes a track graph exists, denoting when targets are isolated and describing how they interact. Measures of similarity between isolated tracks are defined. The goal is to associate the identities of the isolated tracks, by exploiting the graph constraints and similarity measures. We formulate this as a Bayesian network inference problem, allowing us to use standard message propagation to find the most probable set of paths in an efficient way. The high complexity inevitable in large problems is gracefully reduced by removing dependency links between tracks. We apply ...

• Type: Conference
• Year: 2006
• Where: CVPR
• Authors: Peter Nillius, Josephine Sullivan, Stefan Carlsson
• Keywords: Computer Vision, CVPR 2006, Isolated Tracks, Labeling Problem, Network Inference Problem, Similarity Measures, Standard Message Propagation