Issue No. 10 - October (1997 vol. 8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.629483
<p><b>Abstract</b>—The focus of this paper is to present the results of our investigation and evaluation of various shared-memory parallelizations of the data association problem in multitarget tracking. The multitarget tracking algorithm developed was for a sparse air traffic surveillance problem, and is based on an Interacting Multiple Model (IMM) state estimator embedded into the (2D) assignment framework. The IMM estimator imposes a computational burden in terms of both space and time complexity, since more than one filter model is used to calculate state estimates, covariances, and likelihood functions. In fact, contrary to conventional wisdom, for sparse multitarget tracking problems, we show that the assignment (or data association) problem is <it>not</it> the major computational bottleneck. Instead, the <it>interface</it> to the assignment problem, namely, computing the rather numerous gating tests and IMM state estimates, covariance calculations, and likelihood function evaluations (used as cost coefficients in the assignment problem), is the major source of the workload. Using a measurement database based on two FAA air traffic control radars, we show that a "coarse-grained" (dynamic) parallelization <it>across</it> the numerous tracks found in a multitarget tracking problem is robust, scalable, and demonstrates superior computational performance to previously proposed "fine-grained" (static) parallelizations <it>within</it> the IMM.</p>
Air traffic surveillance, multitarget tracking, Interacting Multiple Model (IMM) estimator, shared-memory MIMD multiprocessor, data association, assignment problem.
Robert L. Popp, Krishna R. Pattipati, Yaakov Bar-Shalom, Reda A. Ammar, "Shared-Memory Parallelization of the Data Association Problem in Multitarget Tracking", IEEE Transactions on Parallel & Distributed Systems, vol. 8, no. , pp. 993-1005, October 1997, doi:10.1109/71.629483