Advances in displaying uncertain estimates of multiple targets

Both maximum likelihood estimation as well as minimum mean optimal subpattern assignment (MMOSPA) estimation have been shown to provide meaningful estimates in instances of target identity uncertainty when the number of targets present is known. Maximum likelihood measurement to track association (2D assignment) has been widely studied and is reviewed in this paper. However, it is widely believed that approximate MMOSPA estimation can not be performed in real time except when considering a very small number of targets. This paper demonstrates the MMOSPA estimator arises as a special case of a minimum mean Wasserstein metric estimator when the number of targets is unknown. Additionally, it is shown that approximate MMOSPA estimates can be calculated in microseconds to miliseconds without extensive optimization, making MMOSPA estimation a practicable alternative to more traditional estimators.

[1]  David A. Castanon,et al.  New assignment algorithms for data association , 1992, Defense, Security, and Sensing.

[2]  Lang Hong,et al.  Bias phenomenon and compensation for PDA/JPDA algorithms , 1998 .

[3]  Darin T. Dunham,et al.  Benchmarks for target tracking , 2011, Optical Engineering + Applications.

[4]  Krishna R. Pattipati,et al.  Fast data association using multidimensional assignment with clustering , 2001 .

[5]  Hans Driessen,et al.  Tracking closely spaced targets: Bayes outperformed by an approximation? , 2008, 2008 11th International Conference on Information Fusion.

[6]  Egon Balas,et al.  A parallel shortest augmenting path algorithm for the assignment problem , 1991, JACM.

[7]  H.L. Kennedy.  Controlling track coalescence with scaled Joint Probabilistic Data Association , 2008, 2008 International Conference on Radar.

[8]  Song-lin Chen,et al.  A New Joint Possibility Data Association Algorithm Avoiding Track Coalescence , 2011 .

[9]  Y. Bar-Shalom,et al.  Parallelization of a multiple model multitarget tracking algorithm with superlinear speedups , 1997, IEEE Transactions on Aerospace and Electronic Systems.

[10]  Peter Willett,et al.  Shooting two birds with two bullets: How to find Minimum Mean OSPA estimates , 2010, 2010 13th International Conference on Information Fusion.

[11]  Oliver E. Drummond.  Track covariance compensation for data misassociations: alternative data association algorithms , 2008, SPIE Defense + Commercial Sensing.

[12]  Robert J. Fitzgerald,et al.  Development of Practical PDA Logic for Multitarget Tracking by Microprocessor , 1986, 1986 American Control Conference.

[13]  Peter Willett,et al.  An approximate Minimum MOSPA estimator , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[14]  J. Munkres.  ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[15]  Ulrich Derigs,et al.  The shortest augmenting path method for solving assignment problems — Motivation and computational experience , 1985 .

[16]  Andrew V. Goldberg,et al.  An efficient cost scaling algorithm for the assignment problem , 1995, Math. Program..

[17]  D. Song,et al.  The P versus NP Problem in Quantum Physics , 2014, ArXiv.

[18]  Robin J. Evans,et al.  Integrated probabilistic data association , 1994, IEEE Trans. Autom. Control..

[19]  Ba-Ngu Vo,et al.  A Consistent Metric for Performance Evaluation of Multi-Object Filters , 2008, IEEE Transactions on Signal Processing.

[20]  Peter Willett,et al.  Aspects of MMOSPA estimation , 2011, IEEE Conference on Decision and Control and European Control Conference.

[21]  Ángel F. García-Fernández,et al.  Multitarget tracking using the Joint Multitrack Probability Density , 2009, 2009 12th International Conference on Information Fusion.

[22]  Mark R. Morelande,et al.  A Bayesian Approach to Multiple Target Detection and Tracking , 2007, IEEE Transactions on Signal Processing.

[23]  Ronald P. Mahler,et al.  Why Multi-Source, Multi-Target Data Fusion is Tricky , 1999 .

[24]  S. S. Blackman,et al.  Coordinated Presentation Of Multiple Hypotheses In Multitarget Tracking , 1989, Defense, Security, and Sensing.

[25]  Dimitri P. Bertsekas,et al.  Reverse Auction and the Solution of Inequality Constrained Assignment Problems , 1993, SIAM J. Optim..

[26]  A. Volgenant,et al.  Solving the Rectangular assignment problem and applications , 2010, Ann. Oper. Res..

[27]  Peter Willett,et al.  The Set IMMJPDA filter for multitarget tracking , 2011, Defense + Commercial Sensing.

[28]  Peter Willett,et al.  Generalizations of Blom And Bloem's PDF decomposition for permutation-invariant estimation , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[29]  G. Fernández,et al.  Detection and tracking of multiple targets using wireless sensor networks - Detección y seguimiento de múltiples blancos en redes inalámbricas de sensores , 2011 .

[30]  Peter Willett,et al.  The Set MHT , 2011, 14th International Conference on Information Fusion.

[31]  Rajbabu Velmurugan,et al.  Effective data association scheme for tracking closely moving targets using factor graphs , 2011, 2011 National Conference on Communications (NCC).

[32]  Cong Shan,et al.  Bias phenomenon and compensation in multiple target tracking algorithms , 2000 .

[33]  Dimitri P. Bertsekas,et al.  Auction algorithms for network flow problems: A tutorial introduction , 1992, Comput. Optim. Appl..

[34]  Henk A. P. Blom,et al.  Permutation invariance in Bayesian estimation of two targets that maneuver in and out formation flight , 2009, 2009 12th International Conference on Information Fusion.

[35]  Lennart Svensson,et al.  A Bayesian look at the optimal track labelling problem , 2012 .

[36]  Xiangyang Liu,et al.  lmproved JPDA Algorithm with Measurements Adaptively Censored , 2012, 2012 International Conference on Industrial Control and Electronics Engineering.

[37]  A. Volgenant,et al.  A shortest augmenting path algorithm for dense and sparse linear assignment problems , 1987, Computing.

[39]  Ivan Kadar,et al.  Comparison of robustized assignment algorithms , 1997, Defense, Security, and Sensing.

[40]  Panos M. Pardalos,et al.  A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem , 1997, Network Design: Connectivity and Facilities Location.

[41]  Henk A. P. Blom,et al.  Optimal decomposed particle filtering of two closely spaced Gaussian targets , 2011, IEEE Conference on Decision and Control and European Control Conference.

[42]  B. Dorhout.  Experiments with some algorithms for the linear assignment problem , 1977 .

[43]  Peter Willett,et al.  The multitarget Set JPDA filter with target identity , 2011, Defense + Commercial Sensing.

[44]  Peter Willett,et al.  Developing a Real-Time Track Display That Operators Do Not Hate , 2011, IEEE Transactions on Signal Processing.

[45]  Hossam A. Zaki.  A comparison of two algorithms for the assignment problem , 1995, Comput. Optim. Appl..

[46]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[47]  A. Volgenant.  Linear and semi-assignment problems: A core oriented approach , 1996, Comput. Oper. Res..

[48]  Y. Bar-Shalom,et al.  The probabilistic data association filter , 2009, IEEE Control Systems.

[49]  Oliver E. Drummond.  Methodologies for performance evaluation of multitarget multisensor tracking , 1999, Optics & Photonics.

[50]  Dimitri P. Bertsekas,et al.  A forward/reverse auction algorithm for asymmetric assignment problems , 1992, Comput. Optim. Appl..

[51]  Taek Lyul Song,et al.  Highest Probability Data Association for Active Sonar Tracking , 2006, 2006 9th International Conference on Information Fusion.

[52]  D.J. Salmond,et al.  Mixture Reduction Algorithms for Point and Extended Object Tracking in Clutter , 2009, IEEE Transactions on Aerospace and Electronic Systems.

[53]  Songlin Chen,et al.  Modified Joint Probability Data Association Algorithm Controlling Track Coalescence , 2011, 2011 Fourth International Conference on Intelligent Computation Technology and Automation.

[54]  Uwe D. Hanebeck,et al.  Calculating some exact MMOSPA estimates for particle distributions , 2012, 2012 15th International Conference on Information Fusion.

[55]  Mark Levedahl.  Performance comparison of 2D assignment algorithms for assigning truth objects to measured tracks , 2000, SPIE Defense + Commercial Sensing.

[56]  Oliver E. Drummond,et al.  Best hypothesis target tracking and sensor fusion , 1999, Optics & Photonics.

[57]  Yong-Hoon Kim,et al.  An efficient multitarget tracking algorithm for car applications , 2003, IEEE Trans. Ind. Electron..

[58]  Zhiming Wang.  The shortest augmenting path algorithm for bipartite network problems , 1990 .

[59]  Hassen T. Dorrah,et al.  The multidimensional assignment problem with application , 1990, Proceedings of the 33rd Midwest Symposium on Circuits and Systems.

[60]  Katherine A. Rink,et al.  Use of the Auction Algorithm for Target Object Mapping , 1998 .

[61]  B. Vo,et al.  Bayesian approaches to track existence - IPDA and random sets , 2002, Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997).

[62]  R. Mahler.  A Theoretical Foundation for the Stein-Winter "Probability Hypothesis Density (PHD)" Multitarget Tracking Approach , 2000 .

[63]  Song-lin Chen,et al.  Modified Joint Probability Data Association Algorithm Avoiding Track Coalescence , 2012 .

[64]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[65]  Min Zhu,et al.  A Scaled Joint Probability Data Association Algorithm , 2012, 2012 International Conference on Communication Systems and Network Technologies.

[66]  Y. Bar-Shalom,et al.  Track labeling and PHD filter for multitarget tracking , 2006, IEEE Transactions on Aerospace and Electronic Systems.

[67]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[68]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[69]  Donald B. Malkoff.  Evaluation of the Jonker-Volgenant-Castanon (JVC) assignment algorithm for track association , 1997, Defense, Security, and Sensing.

[70]  Ronald P. S. Mahler,et al.  Multitarget miss distance via optimal assignment , 2004, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[71]  Chen Song-lin,et al.  A Modified Joint Probability Data Association Algorithm , 2010, 2010 International Conference on Computational and Information Sciences.

[72]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[73]  Panos M. Pardalos,et al.  Branch and bound algorithms for the multidimensional assignment problem , 2005, Optim. Methods Softw..

[74]  Peter Willett,et al.  Set JPDA Filter for Multitarget Tracking , 2011, IEEE Transactions on Signal Processing.

[75]  L.Y. Pao,et al.  Multisensor covariance control strategies for reducing bias effects in interacting target scenarios , 2005, IEEE Transactions on Aerospace and Electronic Systems.

[76]  Yaakov Bar-Shalom,et al.  Dimensionless score function for multiple hypothesis tracking , 2007 .

[77]  N. Tomizawa,et al.  On some techniques useful for solution of transportation network problems , 1971, Networks.

[78]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[79]  Oliver E. Drummond,et al.  Performance evaluation methods for multiple-target-tracking algorithms , 1991, Defense, Security, and Sensing.

[80]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[81]  Robert Fitzgerald.  Track Biases and Coalescence with Probabilistic Data Association , 1985, IEEE Transactions on Aerospace and Electronic Systems.

[82]  Mustafa Akgiil.  A genuinely polynomial primal simplex algorithm for the assignment problem , 1993 .

[83]  Yaakov Bar-Shalom,et al.  A note on "book review tracking and data fusion: A handbook of algorithms" [Authors' reply] , 2013 .

[84]  A. Hero,et al.  Multitarget tracking using the joint multitarget probability density , 2005, IEEE Transactions on Aerospace and Electronic Systems.

[85]  Krishna R. Pattipati,et al.  Comparison of assignment algorithms with applications to the passive sensor data association problem , 1989, Proceedings. ICCON IEEE International Conference on Control and Applications.

[86]  Krishna R. Pattipati,et al.  Dynamically adaptable m-best 2-D assignment algorithm and multilevel parallelization , 1999 .

[87]  M.L. Miller,et al.  Optimizing Murty's ranked assignment method , 1997, IEEE Transactions on Aerospace and Electronic Systems.

[88]  D. Bertsekas.  The auction algorithm: A distributed relaxation method for the assignment problem , 1988 .

[89]  Ming Zhu,et al.  K Nearest Neighbor Joint Possibility Data Association Algorithm , 2010, 2010 2nd International Conference on Information Engineering and Computer Science.