Share Email Print

Proceedings Paper

Data association problems posed as multidimensional assignment problems: numerical simulations
Author(s): A. B. Poore; N. Rijavec; T. N. Barker; M. 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. Such algorithms have been developed in earlier work of the authors and the intent of this work is to demonstrate the efficiency and robustness on a class of tracking problems.

Paper Details

Date Published: 22 October 1993
PDF: 10 pages
Proc. SPIE 1954, Signal and Data Processing of Small Targets 1993, (22 October 1993); doi: 10.1117/12.157792
Show Author Affiliations
A. B. Poore, Colorado State Univ. (United States)
N. Rijavec, Colorado State Univ. (United States)
T. N. Barker, IBM Federal Systems Co. (United States)
M. Munger, IBM Federal Systems Co. (United States)

Published in SPIE Proceedings Vol. 1954:
Signal and Data Processing of Small Targets 1993
Oliver E. Drummond, Editor(s)

© SPIE. Terms of Use
Back to Top