An Improved Fast Compressive Tracking Algorithm Based on Online Random Forest Classifier

• Main Authors: Xiong Jintao, Jiang Pan, Yang Jianyu, Zhong Zhibin, Zou Ran, Zhu Baozhong
• Format: Article
• Language: English
• Published: EDP Sciences 2016-01-01
• Series: MATEC Web of Conferences
• Subjects: fast compressive tracking; naive Byes classifier; online; random forest
• Online Access: http://dx.doi.org/10.1051/matecconf/20165901003

The fast compressive tracking (FCT) algorithm is a simple and efficient algorithm, which is proposed in recent years. But, it is difficult to deal with the factors such as occlusion, appearance changes, pose variation, etc in processing. The reasons are that, Firstly, even if the naive Bayes classifier is fast in training, it is not robust concerning the noise. Secondly, the parameters are required to vary with the unique environment for accurate tracking. In this paper, we propose an improved fast compressive tracking algorithm based on online random forest (FCT-ORF) for robust visual tracking. Firstly, we combine ideas with the adaptive compressive sensing theory regarding the weighted random projection to exploit both local and discriminative information of the object. The second reason is the online random forest classifier for online tracking which is demonstrated with more robust to the noise adaptively and high computational efficiency. The experimental results show that the algorithm we have proposed has a better performance in the field of occlusion, appearance changes, and pose variation than the fast compressive tracking algorithm’s contribution.