A comparison of methods for estimating track-to-track assignment probabilities

IEEE Transactions on Aerospace and Electronic Systems

Volumn 48, Issue 3, 2012, Pages 1870-1888

  Kragel, Bret ^a   Herman, Shawn ^a   Roseveare, Nick ^b  

^a NUMERICA CORPORATION   (United States)

^b KANSAS STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASSIGNMENT PROBLEMS; COMPARISON OF METHODS; DATA ASSOCIATION; MARKOV CHAIN MONTE CARLO; OPERATING REGIMES; RUNTIME PERFORMANCE;

AEROSPACE ENGINEERING; ELECTRICAL ENGINEERING;

ESTIMATION;

EID: 84863954780     PISSN: 00189251     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAES.2012.6237567     Document Type: Article

References (29)

1. Bar-Shalom, Y. and Fortmann, T. E. Tracking and Data Association. Burlington, MA: Academic Press, 1988.
2. Blackman, S. Multiple Target Tracking with Radar Application. Norwood, MA: Artech House, 1986.
3. Bar-Shalom, Y., Li, X. R., and Kirubarajan, T. Estimation with Applications to Tracking and Navigation. Hoboken, NJ: Wiley, 2001.
4. Blackman, S. and Popoli, R. Design and Analysis of Modern Tracking Systems. Norwood, MA: Artech House, 1999.
5. Gadaleta, S., et al. Short-term ambiguity assessment to augment tracking data association information. In Proceedings of the Eighth International Conference on Information Fusion, vol. 1, Philadelphia, PA, 2005, p. 8.
6. Bergman, N. and Doucet, A. Markov chain Monte Carlo data association for target tracking. In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, vol. 2, Aug. 2000, pp. II705-II708.
7. Cong, S., Hong, L., and Wicker, D. Markov-chain Monte-Carlo approach for association probability evaluation. IEE Proceedings of Control Theory and Applications, 151, 2 (Mar. 2004), 185-193.
8. Oh, S., Russell, S., and Sastry, S. Markov chain Monte Carlo data association for general multiple-target tracking problems. In Proceedings of the 43rd IEEE Conference on Decision and Control, vol. 1, Nassau, Bahamas, Dec. 2004, pp. 735-742. (Pubitemid 40291420)
9. Horsley, M. A comparison of two methods for computing track-to-track assignment probabilities. MIT Lincoln Laboratory, Project Report PH-35, Apr. 2008.
10. Kragel, B. D., Danford, S., and Poore, A. B. Concurrent map data association and absolute bias estimation with an arbitrary number of sensors. In O. E. Drummond (Ed.), Proceedings of SPIE Conference on Signal and Data Processing of Small Targets, vol. 6969, Orlando, FL, Mar. 2008.
11. Mori, S. and Chong, C-Y. Track-to-track association metric I.I.D.-non-Poisson cases. In Proceedings of the Sixth International Conference on Information Fusion, vol. 1, Cairns, Queensland, Australia, July 2003, pp. 553-559.
12. Stone, L. D., Williams, M. L., and Tran, T. M. Track-to-track association and bias removal. In O. E. Drummond (Ed.), Proceedings of SPIE Conference on Signal and Data Processing of Small Targets, vol. 4278, Aug. 2002, pp. 315-329. (Pubitemid 35467103)
13. Ferry, J. P. Exact association probability for data with bias and features. Journal of Advances in Information Fusion, 5, 1 (June 2010), 41-67.
14. Jonker, R. and Volgenant, A. A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing, 38, 4 (Mar. 1987), 325-340. (Pubitemid 17658282)
15. Murty, K. An algorithm for ranking all the assignments in order of increasing cost. Operations Research, 16 (1968), 682-687.
16. Cox, I. J. and Miller, M. L. On finding ranked assignments with application to multitarget tracking and motion correspondence. IEEE Transactions on Aerospace and Electronic Systems, 31, 1 (Jan. 1995), 486-489.
17. Cox, I. J., Miller, M. L., and Danchick, R. A comparison of two algorithms for determining ranked assignments with application to multitarget tracking and motion correspondence. IEEE Transactions on Aerospace and Electronic Systems, 33, 1 (Jan. 1997), 295-301. (Pubitemid 127761296)
18. Popp, R., Pattipati, K., and Bar-Shalom, Y. Dynamically adaptable m-best 2-D assignment algorithm and multi-level parallelization. IEEE Transactions on Aerospace and Electronic Systems, 35, 4 (Oct. 1999), 1145-1160. (Pubitemid 30546566)
19. Robert, C. P. and Casella, G. Monte Carlo Statistical Methods. New York: Springer, 2004.
20. Pasula, H., et al. Tracking many objects with many sensors. In Proceedings of the International Joint Conferences on Artificial Intelligence (IJCAI-99), vol. 2, 1999, pp. 1160-1171.
21. Mori, S. and Chong, C. Evaluation of a posteriori probabilities of multi-frame data association hypotheses. In O. E. Drummond (Ed.), Proceedings of SPIE Conference on Signal and Data Processing of Small Targets, vol. 6999, San Diego, CA, Aug. 2007.
22. Jerrum, M. and Sinclair, A. The Markov chain Monte Carlo method: An approach to approximate counting and integration. In D. Hochbaum (Ed.), Approximations for NP-Hard Problems, Boston, MA: PWS Publishing, 1996, pp. 482-520.
23. Neal, R. M. Probabilistic inference using Markov chain Monte Carlo methods. Dept. of Computer Science, University of Toronto, Technical Report CRG-TR-93-1, Sept. 1993.
24. Oh, S. and Sastry, S. A polynomial-time approximation algorithm for joint probabilistic data association. In Proceedings of the American Control Conference (ACC), vol. 2, Portland, OR, June 2005, pp. 1283-1288. (Pubitemid 41189298)
25. Tierney, L. Introduction to general state-space Markov theory. In W. Gilks, S. Richardson, and D. Spiegelhalter (Eds.), Markov Chain Monte Carlo in Practice, Boca Raton, FL: Chapman & Hall/CRC, 1996, ch. 4, pp. 59-74.
26. MacKay, D. J. Information Theory, Inference, and Learning Algorithms. New York: Cambridge University Press, 2003.
27. Slocumb, B. Radar analysis of MIT/LL CaT data. Numerica Corporation, Loveland, CO, Internal Report, June 2004.
28. Papoulis, A. Probability, Random Variables, and Stochastic Processes (3rd ed.). New York: McGraw-Hill, 1991.
29. Blair, W. D. and Keel, B. M. Radar systems modeling for tracking. In Y. Bar-Shalom and W. D. Blair (Eds.), Multitarget-Multisensor Tracking: Applications and Advances, vol. 3, Norwood, MA: Artech House, 2001, ch. 7, pp. 321-393.