Share Email Print

Proceedings Paper

Data association problems posed as multidimensional assignment problems: algorithm development
Author(s): Aubrey P. Poore; Nenad Rijavec; Thomas N. Barker; Marcus L. Munger
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The central problem in multitarget-multisensor tracking is the data association problem of partitioning the observations into tracks and false alarms so that an accurate estimate of the true tracks can be recovered. Many previous and current methodologies are based on single scan processing, which is real-time, but often leads to a large number of partial and incorrect assignments, and thus incorrect track identification. The fundamental difficulty is that data association decisions once made are irrevocable. Deferred logic methods such as multiple hypothesis tracking allow correction of these misassociations and are thus considered to be the method for tracking a large number of targets. The corresponding data association problems are however NP-hard and must be solved in real-time. The current work develops a class of algorithms that produce near-optimal solutions in real-time and are potentially orders of magnitude faster than existing methods.

Paper Details

Date Published: 3 September 1993
PDF: 11 pages
Proc. SPIE 1955, Signal Processing, Sensor Fusion, and Target Recognition II, (3 September 1993); doi: 10.1117/12.154972
Show Author Affiliations
Aubrey P. Poore, Colorado State Univ. (United States)
Nenad Rijavec, Colorado State Univ. (United States)
Thomas N. Barker, IBM Federal Systems Co. (United States)
Marcus L. Munger, IBM Federal Systems Co. (United States)

Published in SPIE Proceedings Vol. 1955:
Signal Processing, Sensor Fusion, and Target Recognition II
Ivan Kadar; Vibeke Libby, Editor(s)

© SPIE. Terms of Use
Back to Top