Computation-time reduction of track oriented multiple hypothesis tracking

SICE 2001. Proceedings of the 40th SICE Annual Conference. International Session Papers (IEEE Cat. No.01TH8603) Pub Date : 2001-07-25 DOI:10.1109/SICE.2001.977847

Y. Obata, M. Ito, S. Tsujimichi, Y. Kosuge

引用次数: 3

Abstract

In recent years MHT (multiple hypothesis tracking) attracts much attention because of its tracking performance. MHT has heavy computation load problem and an approach for computation time reduction by applying N-best algorithm was reported. We have improved the function of MHT and named the improved algorithm as track oriented MHT. It has different data structure from original Reid's MHT d(1984), so N-best algorithm can not be applied to it straightforwardly. We show the applying method of N-best algorithm to track oriented MHT. And also we show the efficiency of the method by comparing the computation time in a simulation.

查看原文本刊更多论文

面向多假设跟踪的计算时间减少

近年来，多假设跟踪技术因其良好的跟踪性能而备受关注。MHT存在计算量大的问题，提出了一种利用n -最优算法减少计算时间的方法。我们改进了MHT的功能，并将改进后的算法命名为面向航迹的MHT。它的数据结构与最初的Reid’s MHT d(1984)不同，因此不能直接应用N-best算法。给出了n -最优算法在跟踪导向MHT中的应用方法。并通过仿真计算时间的比较，证明了该方法的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

SICE 2001. Proceedings of the 40th SICE Annual Conference. International Session Papers (IEEE Cat. No.01TH8603)

自引率

0.00%

发文量