Open AccessAn Improved Kernel Correlation Filter Tracking Combined with Mobilenet SSD
Author(s) -
Chang-Jian Wang Chang-Jian Wang,
Yong Ding Chang-Jian Wang,
Ye Ji Yong Ding
Publication year - 2022
Publication title -
diànnǎo xuékān/diannao xuekan
Language(s) - English
Resource type - Journals
eISSN - 2312-993X
pISSN - 1991-1599
DOI - 10.53106/199115992022043302006
Subject(s) - computer science , tracking (education) , kernel (algebra) , scale (ratio) , algorithm , frame (networking) , correlation , filter (signal processing) , tree (set theory) , mathematics , artificial intelligence , computer vision , psychology , telecommunications , pedagogy , mathematical analysis , physics , geometry , combinatorics , quantum mechanics
This article mainly solves the problems that exist when using the Kernel Correlation Filter (KCF) for tracking in complex scenarios. To make the algorithm suitable for target tracking under complex conditions such as scale changes, similar interference, and occlusion, a MobileNet SSD (Single Shot Detection) target detection combined with an improved KCF target tracking algorithm is proposed. Firstly, the MobileNet SSD is used to locate the target in the initial frame, and the location is sent to KCF for training. Secondly, aiming at the problem of scale changes, a Binary-Tree scale search strategy is proposed. In this strategy, the scale value is searched in a tree shape according to the response size, which reduces the number of scale searches. Finally, the average peak correlation energy is used for occlusion determination, and the model update strategy is improved, thereby enhancing the algorithm’s ability to track occluded targets. The results of experimental evaluation and comparison on the OTB100 and UAV123 data sets show that when the target has complex conditions such as scale changes, similar interference, occlusion, etc., the proposed algorithm performs well in mainstream related filtering algorithms. Through the quantitative and qualitative analysis of the experimental results, the effectiveness of the proposed algorithm is verified.