Beyond MAP Estimation With the Track-Oriented Multiple Hypothesis Tracker

The track-oriented multiple hypothesis tracker (TOMHT) is a popular algorithm for tracking multiple targets in a cluttered environment. In tracking parlance it is known as a multi-scan, maximum a posteriori (MAP) estimator-multi-scan because it enumerates possible data associations jointly over several scans, and MAP because it seeks the most likely data association conditioned on the observations. This paper extends the TOMHT, building on its internal representation to support probabilistic queries other than MAP estimation. Specifically, by summing over the TOMHT's pruned space of data association hypotheses one can compute marginal probabilities of individual tracks. Since this summation is generally intractable, any practical implementation must replace it with an approximation. We introduce a factor graph representation of the TOMHT's data association posterior and use variational message-passing to approximate track marginals. In an empirical evaluation, we show that marginal estimates computed through message-passing compare favorably to those computed through explicit summation over the k-best hypotheses, especially as the number of possible hypotheses increases. We also show that track marginals enable parameter estimation in the TOMHT via a natural extension of the expectation maximization algorithm used in single-target tracking. In our experiments, online EM updates using approximate marginals significantly increased tracker robustness to poor initial parameter specification.

[1]  C. Morefield Application of 0-1 integer programming to multitarget tracking problems , 1977 .

[2]  D. Reid An algorithm for tracking multiple targets , 1978, 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes.

[3]  R. Shumway,et al.  AN APPROACH TO TIME SERIES SMOOTHING AND FORECASTING USING THE EM ALGORITHM , 1982 .

[4]  Krishna R. Pattipati,et al.  M-best SD assignment algorithm with application to multitarget tracking , 1998, Defense, Security, and Sensing.

[5]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[6]  Y. Bar-Shalom,et al.  m-best S-D assignment algorithm with application to multitarget tracking , 2001 .

[7]  Rina Dechter,et al.  Iterative Join-Graph Propagation , 2002, UAI.

[8]  William T. Freeman,et al.  Understanding belief propagation and its generalizations , 2003 .

[9]  S.S. Blackman,et al.  Multiple hypothesis tracking for multiple target tracking , 2004, IEEE Aerospace and Electronic Systems Magazine.

[10]  Max Welling,et al.  On the Choice of Regions for Generalized Belief Propagation , 2004, UAI.

[11]  John W. Fisher,et al.  Loopy Belief Propagation: Convergence and Effects of Message Errors , 2005, J. Mach. Learn. Res..

[12]  William T. Freeman,et al.  Constructing free-energy approximations and generalized belief propagation algorithms , 2005, IEEE Transactions on Information Theory.

[13]  Martin J. Wainwright,et al.  Data association based on optimization in graphical models with application to sensor networks , 2006, Math. Comput. Model..

[14]  Chee Chong,et al.  Evaluation of a posteriori probabilities of multi-frame data association hypotheses , 2007, SPIE Optical Engineering + Applications.

[15]  Alexander T. Ihler,et al.  Accuracy Bounds for Belief Propagation , 2007, UAI.

[16]  Amir Globerson,et al.  An LP View of the M-best MAP problem , 2009, NIPS.

[17]  Olivier Capp'e Online EM Algorithm for Hidden Markov Models , 2009, 0908.2359.

[18]  Jason L. Williams,et al.  Convergence of loopy belief propagation for data association , 2010, 2010 Sixth International Conference on Intelligent Sensors, Sensor Networks and Information Processing.

[19]  Jason L. Williams,et al.  Data association by loopy belief propagation , 2010, 2010 13th International Conference on Information Fusion.

[20]  Branko Ristic,et al.  A Metric for Performance Evaluation of Multi-Target Tracking Algorithms , 2011, IEEE Transactions on Signal Processing.

[21]  Ole Tange,et al.  GNU Parallel: The Command-Line Power Tool , 2011, login Usenix Mag..

[22]  Brendan J. Frey,et al.  Fast Exact Inference for Recursive Cardinality Models , 2012, UAI.

[23]  Dhruv Batra,et al.  An Efficient Message-Passing Algorithm for the M-Best MAP Problem , 2012, UAI.

[24]  Padhraic Smyth,et al.  Variational message-passing: extension to continuous variables and applications in multi-target tracking , 2013 .

[25]  Anna Freud,et al.  Design And Analysis Of Modern Tracking Systems , 2016 .