Fast and reliable tracking algorithm for on-road vehicle detection systems

J. Baek, Byung-Gil Han, Hyunwoo Kang, Yoonsu Chung, Su-In Lee
{"title":"Fast and reliable tracking algorithm for on-road vehicle detection systems","authors":"J. Baek, Byung-Gil Han, Hyunwoo Kang, Yoonsu Chung, Su-In Lee","doi":"10.1109/ICUFN.2016.7536983","DOIUrl":null,"url":null,"abstract":"In this paper, we proposes a novel tracking algorithm combining Kalman Filter with mean-shift. Kalman Filter predicts the vehicle position in the next frame. Mean-shift finds the best candidate which has maximum similarity with the tracked vehicle in the predicted area. Kalman Filter updates its state value of vehicle position with the position of the best candidate from the mean-shift tracker. As a result, the proposed algorithm tracks the vehicle without local maximum problem of mean-shift tracker. The proposed algorithm is very fast because it does not perform the redetection process, and it has no detection misses because it finds the best candidate which has maximum similarity with the tracked vehicle in the predicted area. Also, the proposed algorithm has deleting and adding policies for the tracking list management. If a vehicle was consecutively detected in the previous frames, the proposed algorithm assumes that the vehicle exists although the vehicle is not detected in the predicted region at the current frame. If a vehicle was not detected in the previous frames consecutively, the proposed algorithm assumes that the vehicle does not exist although the vehicle is detected in the current frame. We evaluated the performance of the proposed algorithm in terms of processing time and detection ratio. At target board, the proposed algorithm has 40 frames per second, which meets the real time requirements of the ADAS systems. The detection ratio and processing time of the proposed algorithm outperformed our former work.","PeriodicalId":403815,"journal":{"name":"2016 Eighth International Conference on Ubiquitous and Future Networks (ICUFN)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Eighth International Conference on Ubiquitous and Future Networks (ICUFN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICUFN.2016.7536983","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

In this paper, we proposes a novel tracking algorithm combining Kalman Filter with mean-shift. Kalman Filter predicts the vehicle position in the next frame. Mean-shift finds the best candidate which has maximum similarity with the tracked vehicle in the predicted area. Kalman Filter updates its state value of vehicle position with the position of the best candidate from the mean-shift tracker. As a result, the proposed algorithm tracks the vehicle without local maximum problem of mean-shift tracker. The proposed algorithm is very fast because it does not perform the redetection process, and it has no detection misses because it finds the best candidate which has maximum similarity with the tracked vehicle in the predicted area. Also, the proposed algorithm has deleting and adding policies for the tracking list management. If a vehicle was consecutively detected in the previous frames, the proposed algorithm assumes that the vehicle exists although the vehicle is not detected in the predicted region at the current frame. If a vehicle was not detected in the previous frames consecutively, the proposed algorithm assumes that the vehicle does not exist although the vehicle is detected in the current frame. We evaluated the performance of the proposed algorithm in terms of processing time and detection ratio. At target board, the proposed algorithm has 40 frames per second, which meets the real time requirements of the ADAS systems. The detection ratio and processing time of the proposed algorithm outperformed our former work.
道路车辆检测系统快速可靠的跟踪算法
本文提出了一种将卡尔曼滤波与均值漂移相结合的跟踪算法。卡尔曼滤波预测下一帧的车辆位置。Mean-shift算法在预测区域内寻找与履带车辆相似度最大的最佳候选者。卡尔曼滤波器用均值漂移跟踪器的最佳候选位置更新其车辆位置的状态值。结果表明,该算法不存在均值漂移跟踪器的局部极大值问题。该算法不需要进行重新检测,速度快,并且在预测区域内找到与履带车辆相似度最大的最佳候选,无检测漏检。此外,该算法还具有跟踪列表管理的删除和添加策略。如果在前一帧中连续检测到车辆,则假设该车辆存在,尽管在当前帧中该车辆未在预测区域检测到。如果在前一帧中连续检测不到车辆,则即使在当前帧中检测到车辆,该算法也假定该车辆不存在。我们在处理时间和检测率方面评估了所提出算法的性能。在目标板上,该算法具有40帧/秒的速度,满足ADAS系统的实时性要求。该算法的检测率和处理时间都优于我们之前的工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信