期刊文献+

Compressive Tracking Based on Online Hough Forest 被引量:2

Compressive Tracking Based on Online Hough Forest
原文传递
导出
摘要 Existing tracking algorithms often suffer from the drift and lost problems caused by factors such as pose variation, illumination change, occlusion and motion. Therefore, developing a robust and effective tracker is still a challenging task. In this paper, we propose a real-time compressive tracking based on online Hough forest. The gray and texture features of discrete samples are extracted and compressed via the random measurement matrix. Online Hough forest classifier is used to vote the location probability of the target, and it optimizes the confidence map estimation for the target detection. The location of target being tracked is determined by combining the upper frame of the target center location and the probability confidence map of the incremental Hough forest. Finally, the classifier parameters are updated online by introducing the illumination variation and target occlusion feedback mechanism adaptively. The experiments with state-of-the-art algorithms on challenging sequences demonstrated that the proposed algorithm can effectively enhance the robustness and accuracy, and inherit the real-time performance of the compressive tracking algorithm. Existing tracking algorithms often suffer from the drift and lost problems caused by factors such as pose variation, illumination change, occlusion and motion. Therefore, developing a robust and effective tracker is still a challenging task. In this paper, we propose a real-time compressive tracking based on online Hough forest. The gray and texture features of discrete samples are extracted and compressed via the random measurement matrix. Online Hough forest classifier is used to vote the location probability of the target, and it optimizes the confidence map estimation for the target detection. The location of target being tracked is determined by combining the upper frame of the target center location and the probability confidence map of the incremental Hough forest. Finally, the classifier parameters are updated online by introducing the illumination variation and target occlusion feedback mechanism adaptively. The experiments with state-of-the-art algorithms on challenging sequences demonstrated that the proposed algorithm can effectively enhance the robustness and accuracy, and inherit the real-time performance of the compressive tracking algorithm.
出处 《International Journal of Automation and computing》 EI CSCD 2017年第4期396-406,共11页 国际自动化与计算杂志(英文版)
基金 supported by National Natural Science Foundation of China(No.61203343) Natural Science Foundation of Hebei Province(No.E2014209106) Science and Technology Research Project of Hebei Provincial Department of Education(Nos.QN2016102 and QN2016105) the Graduate Student Innovation Fund of North China University of Science and Technology(No.2016S10)
关键词 Compressive tracking online learning target tracking Hough forest probabilistic voting. Compressive tracking, online learning, target tracking, Hough forest, probabilistic voting.
  • 相关文献

参考文献2

二级参考文献4

共引文献15

同被引文献13

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部