Evaluation of a probabilistic multihypothesis tracking algorithm in cluttered environments
暂无分享,去创建一个
This research examines the probabilistic multihypothesis tracker (PMHT), a batch-mode, empirical, Bayesian data association and tracking algorithm. Like a traditional multihypothesis tracker (MHT), track estimation is deferred until more conclusive data is gathered. However, unlike a traditional algorithm, PMHT does not attempt to enumerate all possible combinations of feasible data association links, but uses a probabilistic structure derived using expectation-maximization. This study focuses on two issues: the behavior of the PMHT algorithm in clutter and algorithm initialization in clutter. We also compare the performance between this algorithm and other algorithms, including a nearest neighbor tracker, a probabilistic data association filter (PDAF), and a traditional measurement-oriented MHT algorithm.
[1] Roy L. Streit,et al. Maximum likelihood method for probabilistic multihypothesis tracking , 1994, Defense, Security, and Sensing.
[2] R. Streit,et al. Probabilistic Multi-Hypothesis Tracking , 1995 .
[3] Yaakov Bar-Shalom,et al. Tracking with debiased consistent converted measurements versus EKF , 1993 .
[4] Yakov Bar-Shalom,et al. Multitarget-Multisensor Tracking: Principles and Techniques , 1995 .