Share Email Print

Proceedings Paper

Multitarget tracking and multidimensional assignment problems
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

A fundamental problem in multi-target 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. Here, this problem is formulated as a multi-dimensional assignment problem using gating techniques to introduce sparsity into the problem, filtering techniques to generate tracks which are then used to score each assignment of a collection of observations to its corresponding filtered track. Problem complexity is further reduced by decomposing the problem into disjoint components using graph theoretic methods. A recursive Lagrangean relaxation algorithm is then developed to obtain high quality suboptimal solutions in real-time. The algorithms are, however, applicable to a large class of sparse multi-dimensional assignment problems arising in general multi-target and multi-sensor tracking. Results of extensive numerical testing are presented for a case study to demonstrate the speed, robustness, and exceptional quality of the solutions.

Paper Details

Date Published: 1 August 1991
PDF: 12 pages
Proc. SPIE 1481, Signal and Data Processing of Small Targets 1991, (1 August 1991); doi: 10.1117/12.45668
Show Author Affiliations
Aubrey B. Poore, Colorado State Univ. (United States)
Nenad Rijavec, Colorado State Univ. (United States)

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

© SPIE. Terms of Use
Back to Top