Paper
27 July 1999 Comparison of PMHT and S-D assignment trackers
Author Affiliations +
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.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yanhua Ruan, Peter K. Willett, and Roy L. Streit "Comparison of PMHT and S-D assignment trackers", Proc. SPIE 3720, Signal Processing, Sensor Fusion, and Target Recognition VIII, (27 July 1999); https://doi.org/10.1117/12.357167
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Detection and tracking algorithms

Expectation maximization algorithms

Algorithm development

Time metrology

Monte Carlo methods

Target detection

Radon

RELATED CONTENT

A fast coalescence-avoiding JPDAF
Proceedings of SPIE (May 15 2012)
Time-recursive number-of-tracks estimation for MHT
Proceedings of SPIE (July 13 2000)
Maneuvering PMHTs
Proceedings of SPIE (November 26 2001)
Bayesian approach to avoiding track seduction
Proceedings of SPIE (August 07 2002)

Back to Top