References
- 1. Y. Bar Shalom, Ed. Multitarget-Multisensor Tracking: Advanced Applications. Artech House, Norwood, 1990.
- 2. Bar Shalom, Y., T. Fortmann. Tracking and Data Association. Academic Press, 1988.
- 3. Bar Shalom, Y., P. K. Willet, X. Tian. Tracking and Data Fusion: A Handbook of Algorithms. YBS Publishing, Storrs, CT, USA, 2011.
- 4. He, X., R. Tharmarasa, M. Pelletier, T. Kirubarajanar. Accurate Murty’s Algorithm for Multitarget Top Hypothesis. – In: Proc. of Int. Conference of Information Fusion, Chicago, USA, 2011.
- 5. Dezert, J., F. Smarandache, A. Tchamova. On the Blackman’s Association Problem. – In: Proc. of Int. Conference of Information Fusion, Cairn, Australia, 2003.
- 6. Tchamova, A., J. Dezert, T. Semerddjiev, P. Konstantinova. Target Tracking with Generalized Data Association Based on the General DSm Rule of Combination. – In: Proc. of Int. Conference of Information Fusion, Stockholm, Sweden, 2004.
- 7. Dezert, J., A. Tchamova, T. Semerddjiev, P. Konstantinova. Performance Evaluation of Fusion Rules for Multitarget Tracking in Clutter Based on Generalized Data Association. – In: Proc. of Int. Conference of Information Fusion, Philadelphia, USA, 2005.
- 8. F. Smarandache, J. Dezert, Ed. Advances and Applications of DSmT for Information Fusion. Vol. 1, 2, 3. American Research Press, 2004, 2006, 2009. http://www.gallup.unm.edu/~smarandache/DSmT.htm
- 9. Denoeux, T., N. El Zoghby, V. Cherfaoui, A. Jouglet. Optimal Object Associaton in the Dempster-Shafer Framework. – IEEE Trans. on Cybernetics, 2014 (to appear).
- 10. Dezert, J., K. Benameur. On the Quality of Optimal Assignment for Data Association. – Springer, Lecture Notes in Computer Science, Vol. 8764, 2014, pp. 374-382.
- 11. Dezert, J., K. Benameur, L. Ratton, J. F. Grandin. On the Quality Estimation of Optimal Multiple Criteria Data Association Solutions. – In: Proc. of Int. Conference of Information Fusion, Washington, DC, USA, 6-9 July 2015.
- 12. Kuhn, H. W. The Hungarian Method for the Assignment Problem. – Naval Research Logistic Quarterly, Vol. 2, 1955, pp. 83-97.
- 13. Munkres, J. Algorithms for the Assignment and Transportation Problems. – Journal of the Society of Industrial and Applied Mathematics, Vol. 5, 1957, No 1, pp. 32-38.
- 14. Bourgeois, F., J. C. Lassalle. An Extension of the Munkres Algorithm for the Assignment Problem to Rectangular Matrices. – Comm. of the ACM, Vol. 14, 1971, No 12, pp. 802-804.
- 15. Murty, K. G. An Algorithm for Ranking All the Assignments in Order of Increasing Cost. – Operations Research Journal, Vol. 16, 1968, No 3, pp. 682-687.
- 16. Smets, P., R. Kennes. The Transferable Belief Model. – Artificial Intelligence, Vol. 66, 1994, No 2, pp. 191-234.