{"title":"Computation-time reduction of track oriented multiple hypothesis tracking","authors":"Y. Obata, M. Ito, S. Tsujimichi, Y. Kosuge","doi":"10.1109/SICE.2001.977847","DOIUrl":null,"url":null,"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.","PeriodicalId":415046,"journal":{"name":"SICE 2001. Proceedings of the 40th SICE Annual Conference. International Session Papers (IEEE Cat. No.01TH8603)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SICE 2001. Proceedings of the 40th SICE Annual Conference. International Session Papers (IEEE Cat. No.01TH8603)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SICE.2001.977847","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
