Tracking algorithm speed comparisons between MHT and PMHT
Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997) - Tập 2 - Trang 846-851 vol.2
Tóm tắt
The Probabilistic Multi-Hypothesis Tracker (PMHT) is an emerging tracking algorithm that appears to have the potential to compete with other well-established tracking algorithms. One of the values that the PMHT brings to the tracking problem is its computational efficiency that grows linearly as the number of targets increases, whereas most tracking algorithms increase exponentially as targets increase. Knowing this, how much does this computational efficiency for the PMHT translate into an algorithm speed advantage? The Multi-Hypothesis Tracker (MHT) was first presented in the late 1970s. Since then significant work has been done in order to improve this robust algorithm, and today the MHT is one of the leading tracking algorithms. Taking an efficient coding of the MHT, it is used as a comparison for the PMHT in terms of algorithm speed. In order to make this comparison objectively, the PMHT is run against the MHT in a common environment. Results have been produced for both the single target scenario and the multiple target scenarios.
Từ khóa
#Target tracking #Nearest neighbor searches #Modems #Real time systems #Time measurement #Covariance matrix #Robustness #Testing #Clocks #Current measurementTài liệu tham khảo
dunham, 1997, Tracking multiple targets in cluttered environments with a probabilistic multi-hypothesis tracker, SPIE Proc Acquisition Tracking and Pointing VI, 3086
blackman, 1999, Design and Analysis of Modern Tracking Systems
streit, 1995, Probabilistic multi- hypothesis, tracking, NUWC-NPT Tech Rep, 428
10.1117/12.492775
dunham, 2002, Hybrid tracking algorithm using MHT and PMHT, SPIE Proceedings on Signal and Data Processing of Small Targets, 4728