Share Email Print

Proceedings Paper

Comparison of PMHT and S-D assignment trackers
Author(s): Yanhua Ruan; Peter K. Willett; Roy L. Streit
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 S-dimensional (S-D) assignment algorithm is a recently- favored approach to multitarget tracking in which the data association is formulated as a generalized multidimensional matching problem, and solved by a Lagrangian (dual) relaxation approach. The Probabilistic Multiple Hypothesis Tracking algorithm is a relatively new method, which uses the EM algorithm and a modified probabilistic model to develop a `soft' association tracker. In this paper, we implement the two algorithms (S = 3, in the S-D assignment algorithm) in the multitarget tracking problem, presented with false alarms and imperfect target detection. Simulation results for various scenarios are presented and the performances of the two algorithms are compared in terms of computational time and percentage of lost tracks.

Paper Details

Date Published: 27 July 1999
PDF: 12 pages
Proc. SPIE 3720, Signal Processing, Sensor Fusion, and Target Recognition VIII, (27 July 1999); doi: 10.1117/12.357167
Show Author Affiliations
Yanhua Ruan, Univ. of Connecticut (United States)
Peter K. Willett, Univ. of Connecticut (United States)
Roy L. Streit, Naval Undersea Warfare Ctr. (United States)

Published in SPIE Proceedings Vol. 3720:
Signal Processing, Sensor Fusion, and Target Recognition VIII
Ivan Kadar, Editor(s)

© SPIE. Terms of Use
Back to Top