Motion constraint Markov network model for multi-target tracking

Abstract

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.

References

[1] MaccormickJ., BlakeA.. International Journal of Computer Vision, 2000, 39: 57

[2] Isard M., Maccormick J., In Proc. IEEE ICCV, 2001, 34.

[3] KhanZ., BalchT., DellaertF.. IEEE Trans. on PAMI, 2005, 27: 1805

[4] Yu T., Wu Y., In Proc. IEEE CVPR, 2004, 834.

[5] XueJ., ZhengN., ZhongX.. Science in China: Series F Information Sciences, 2006, 49: 48

[6] ShafiqueK., ShahM.. IEEE Trans. on PAMI, 2005, 27: 1

[7] Jaakkola T., Technical Report, MIT AI Lab, 2000.

[8] WinnJ., BishopC.. Journal of Machine Learning Research, 2005, 6: 661

[9] Wu Y., Hua G., Yu T., In Proc. IEEE ICCV, 2003, 1094.

[10] ArulampalamM., MaskellS., GordonN., ClappT.. IEEE Trans. on Signal Processing, 2002, 50: 174

[11] NummiaroK., Koller-MeierE., GoolL.. Image and Vision Computing, 2003, 21: 99