Motion constraint Markov network model for multi-target tracking

A typical Markov network for modeling the interaction among targets can handle the error merge problem, but it suffers from the labeling problem due to the blind competition among collaborative trackers. In this paper, we propose a motion constraint Markov network model for multi-target tracking. By augmenting the typical Markov network with an ad hoc Markov chain which carries motion constraint prior, this proposed model can overcome the blind competition and direct the label to the corresponding target even in the case of severe occlusion. In addition, the motion constraint prior is formulated as a local potential function and can be easily incorporated in the joint distribution representation of the novel model. Experimental results demonstrate that our model is superior to other methods in solving the error merge and labeling problems simultaneously and efficiently.

[1]  Charles M. Bishop,et al.  Variational Message Passing , 2005, J. Mach. Learn. Res..

[2]  Mubarak Shah,et al.  A noniterative greedy algorithm for multiframe point correspondence , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Luc Van Gool,et al.  An adaptive color-based particle filter , 2003, Image Vis. Comput..

[4]  Frank Dellaert,et al.  MCMC-based particle filtering for tracking a variable number of interacting targets , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Nanning Zheng,et al.  Sequential stratified sampling belief propagation for multiple targets tracking , 2005, Science in China Series F.

[6]  Neil J. Gordon,et al.  A tutorial on particle filters for online nonlinear/non-Gaussian Bayesian tracking , 2002, IEEE Trans. Signal Process..

[7]  W. Cooper,et al.  SCIENCE IN CHINA. , 1940, Science.

[8]  Andrew Blake,et al.  A Probabilistic Exclusion Principle for Tracking Multiple Objects , 2004, International Journal of Computer Vision.