Share Email Print

Proceedings Paper

Multiple hypothesis tracking algorithms for massively parallel computers
Author(s): Thomas G. Allen
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Many large, complex target tracking scenarios, such as full-scale strategic missile attacks or low-observable tactical engagements, require both advanced algorithms and state-of-the-art parallel processing to produce accurate, timely results. In this paper, approaches for implementing multiple object, multiple hypothesis tracking algorithms on a massively parallel computer are presented and evaluated. Multiple hypothesis tracking algorithms offer improved performance over more traditional approaches, albeit at the expense of increased processing and storage requirements. Massively parallel array processors can deliver this needed computational power, assuming the algorithms can be efficiently mapped onto this restrictive class of architectures. Algorithms are described here for all the functions within the multiple hypothesis approach. These algorithms are then benchmarked using the distributed array of processors (DAP) series from Active Memory Technology, Inc. Results of these benchmarks show that the multiple hypothesis tracking algorithms can be successfully implemented on array processors, displaying processing times that increase sublinearly with the number of objects under surveillance.

Paper Details

Date Published: 25 August 1992
PDF: 15 pages
Proc. SPIE 1698, Signal and Data Processing of Small Targets 1992, (25 August 1992); doi: 10.1117/12.139393
Show Author Affiliations
Thomas G. Allen, ALPHATECH, Inc. (United States)

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

© SPIE. Terms of Use
Back to Top