A fast method for finding the exact N-best hypotheses for multitarget tracking
- 1 April 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 29 (2), 555-560
- https://doi.org/10.1109/7.210093
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- A shortest augmenting path algorithm for dense and sparse linear assignment problemsComputing, 1987
- New approach to improved detection and tracking performance in track-while-scan radars. Part 2: Detection, track initiation and associationIEE Proceedings F Communications, Radar and Signal Processing, 1987
- An algorithm to solve the m × n assignment problem in expected time O(mn log n)Networks, 1980
- An algorithm for tracking multiple targetsIEEE Transactions on Automatic Control, 1979
- Application of 0-1 integer programming to multitarget tracking problemsIEEE Transactions on Automatic Control, 1977
- An extension of the Munkres algorithm for the assignment problem to rectangular matricesCommunications of the ACM, 1971