Cross-entropy method for K-best dependent-target data association hypothesis selection

This paper is concerned with probabilistic evaluation of multiple-frame data association hypotheses in multiple-target tracking problems, in particular, when targets are not necessarily independent a priori. Multiple-target tracking problems with dependent targets naturally arise whenever targets interact with each other, as they move in congested traffic, or as they actively coordinate their movements in other situations. This paper develops a Bayesian data association hypothesis evaluation formula for dependent targets. Because the resulting formula does not have a multiplicative or log-linear form, the best hypothesis cannot be selected by integer linear programming or multi-dimensional assignment algorithms commonly used to solve data association problems in multiple target tracking. Instead, we propose to use Reuven Rubinstein's cross-entropy method as a possible solution. A K-best hypothesis selection extension will be discussed as an application of the generalized Murty's algorithm. This paper focuses on the theoretical aspects as the first step of a solution concept development.

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

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

[3]  Chee-Yee Chong,et al.  Markov chain Monte Carlo method for evaluating multi-frame data association hypotheses , 2008, 2008 11th International Conference on Information Fusion.

[4]  S. Mori,et al.  Tracking and classifying multiple targets without a priori identification , 1986 .

[5]  Chee-Yee Chong,et al.  Evaluation of Data Association Hypotheses: Non-Poisson I.I.D. Cases , 2004 .

[6]  Donald Reid.  An algorithm for tracking multiple targets , 1978 .

[7]  Ingemar J. Cox,et al.  On Finding Ranked Assignments With Application to Multi-Target Tracking and Motion Correspondence , 1995 .

[8]  Aubrey B. Poore,et al.  A New Class of Methods for Solving Data Association Problems Arising from Multiple Target Tracking , 1991, 1991 American Control Conference.

[9]  Songhwai Oh,et al.  Markov chain Monte Carlo data association for general multiple-target tracking problems , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[10]  Katta G. Murty,et al.  Letter to the Editor - An Algorithm for Ranking all the Assignments in Order of Increasing Cost , 1968, Oper. Res..

[11]  Chee-Yee Chong,et al.  Point process formalism for multiple target tracking , 2002, Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997).

[12]  Nahum Shimkin,et al.  Cross-entropy based data association for multi target tracking , 2008, VALUETOOLS.

[13]  Chee-Yee Chong,et al.  Generalized Murty's algorithm with application to multiple hypothesis tracking , 2007, 2007 10th International Conference on Information Fusion.

[14]  Dirk P. Kroese,et al.  The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning , 2004 .

[15]  Samuel S. Blackman,et al.  Design and Analysis of Modern Tracking Systems , 1999 .

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

[17]  Yakov Bar-Shalom,et al.  Multitarget-Multisensor Tracking: Principles and Techniques , 1995 .