A Fast Method for Finding the Exact N-best Hypotheses for Multitarget Tracking

IEEE Transactions on Aerospace and Electronic Systems

Volumn 29, Issue 2, 1993, Pages 555-560

  Danchick, R ^a   Newnam, G E ^a  

^a NORTHROP GRUMMAN CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED ANALYSIS; ELECTROOPTICAL DEVICES; PROBABILITY; REAL TIME SYSTEMS; SENSORS;

MULTIPLE HYPOTHESIS TRACKING; MULTIPLE TARGET TRACKING; REID ALGORITHM;

TRACKING (POSITION);

EID: 0027577209     PISSN: 00189251     EISSN: None     Source Type: Journal    
DOI: 10.1109/7.210093     Document Type: Article

References (7)

1. Morefield, C. L. (1977) Application of 0–1 integer programming for multitarget tracking problems, IEEE Trans. Automat. Contr:, AC-22 (June 1977), 302–311.
2. Reid, D. B. (1979) An algorithm for tracking multiple targets, IEEE Trans., AC-24 (1979), 843–854.
3. Nagarajan, V., Chidambara, M. R., and Sharma, R. N. (1987) New approach to improved detection and tracking performance in track-while-scan radars, Part 2: detection, track initiation and association, IEEE Proc. 134, (Feb. 1987), 93–98.
4. Nagarajan, V., Chidambara, M. R., and Sharma, R. N. (1987) Combinatorial problems in multitarget tracking—A comprehensive solution, IEEE Proc. 134, Pt. F, 1 (Feb. 1987), 113–118.
5. Jonker, R., and Volgenant, A. (1987) A shortest augmenting path algorithm for dense and sparse linear assignment problems, Computing 38 (1987), 325–340.
6. Bourgeois, F., and Lassalle, J. C. (1971) An extension of the Munkres algorithm for the assignment problem to rectangular matrices, Communications of the ACM, 14, 12 (Dec. 1971).
7. Karp, R. M. (1980) An algorithm to solve the m x n assignment problem in expected time O(mn log n), Networks, 10 (1980), 143–152.