Scale Adaptive Kernel Correlation Tracking Method with High Confidence

2021 ◽  
Vol 58 (8) ◽  
pp. 0815004
Author(s):  
李福进 Li Fujin ◽  
刘慧慧 Liu Huihui ◽  
任红格 Ren Hongge ◽  
史涛 Shi Tao
2020 ◽  
Vol 39 (3) ◽  
pp. 3825-3837
Author(s):  
Yibin Chen ◽  
Guohao Nie ◽  
Huanlong Zhang ◽  
Yuxing Feng ◽  
Guanglu Yang

Kernel Correlation Filter (KCF) tracker has shown great potential on precision, robustness and efficiency. However, the candidate region used to train the correlation filter is fixed, so tracking is difficult when the target escapes from the search window due to fast motion. In this paper, an improved KCF is put forward for long-term tracking. At first, the moth-flame optimization (MFO) algorithm is introduced into tracking to search for lost target. Then, the candidate sample strategy of KCF tracking method is adjusted by MFO algorithm to make it has the capability of fast motion tracking. Finally, we use the conservative learning correlation filter to judge the moving state of the target, and combine the improved KCF tracker to form a unified tracking framework. The proposed algorithm is tested on a self-made dataset benchmark. Moreover, our method obtains scores for both the distance precision plot (0.891 and 0.842) and overlap success plots (0.631 and 0.601) on the OTB-2013 and OTB-2015 data sets, respectively. The results demonstrate the feasibility and effectiveness compared with the state-of-the-art methods, especially in dealing with fast or uncertain motion.


2016 ◽  
Vol 23 (8) ◽  
pp. 1136-1140 ◽  
Author(s):  
Yang Li ◽  
Yafei Zhang ◽  
Yulong Xu ◽  
Jiabao Wang ◽  
Zhuang Miao

2018 ◽  
Vol 232 ◽  
pp. 03016 ◽  
Author(s):  
Di Wu ◽  
Li Peng

Aiming at the problem that the traditional correlation filter tracking algorithm is prone to tracking failure under the target’s scale change and occlusion environment, we propose a scale-adaptive Kernel Correlation Filter (KCF) target tracking algorithm combined with the learning rate adjustment. Firstly, we use the KCF to obtain the initial position of the target, and then adopt a low-complexity scale estimation scheme to get the target's scale, which improves the ability of the proposed algorithm to adapt to the change of the target's scale, and the tracking speed is also ensured. Finally, we use the average difference between two adjacent images to analyze the change of the image, and adjust the learning rate of the target model in segments according to the average difference to solve the tracking failure problem when the target is severely obstructed. Compared the proposed algorithm with other five classic target tracking algorithms, the experimental results show that the proposed algorithm is well adapted to the complex environment such as target’s scale change, severe occlusion and background interference. At the same time, it has a real-time tracking speed of 231 frame/s.


2018 ◽  
Vol 55 (4) ◽  
pp. 041501 ◽  
Author(s):  
高美凤 Gao Meifeng ◽  
张晓玄 Zhang Xiaoxuan

2019 ◽  
Vol 17 (3) ◽  
pp. 031001 ◽  
Author(s):  
Junhao Zhao Junhao Zhao ◽  
Gang Xiao Gang Xiao ◽  
Xingchen Zhang Xingchen Zhang ◽  
D. P. Bavirisetti D. P. Bavirisetti

Sign in / Sign up

Export Citation Format

Share Document