Share Email Print

Proceedings Paper

Data association in target tracking using priority queues
Author(s): A. Sinha; T. Kirubarajan; M. Farooq
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Data association is one of the main components of target tracking. While, in its simplest form, data association links a list of tracks to a list of measurements or links two lists of measurements (2-D association), the more complex problem involves assignment of multiple number of such lists (S-D association where S ≥ 3). In target tracking, the presence of false detections (false alarms) and the absence of detections from some targets (missed detections) complicate the problem of data association further. In this work, we explore the possibility of applying track ordering in priority queues to solve the association problem more efficiently. The basic component of our algorithm is to form priority queues by permutations of the tracks. Each queue is served on a first-come-first-served basis, i.e., each track is assigned to the best measurement available based on its turn in the queue. It can be shown that the best solution to the 2-D problem can be obtained from one of these queues. However, the solution is computationally expensive even for a moderate number of targets. In this paper we show that due to redundancy only a small fraction of the total number of permutations is required to be evaluated to obtain the best solution.

Paper Details

Date Published: 16 September 2005
PDF: 10 pages
Proc. SPIE 5913, Signal and Data Processing of Small Targets 2005, 59130P (16 September 2005); doi: 10.1117/12.619175
Show Author Affiliations
A. Sinha, McMaster Univ. (Canada)
T. Kirubarajan, McMaster Univ. (Canada)
M. Farooq, Royal Military College of Canada (Canada)

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

© SPIE. Terms of Use
Back to Top