Abstract
In recent years, the object‐tracking algorithm based on Siamese network has gradually become the mainstream algorithm in the field of object tracking due to its characteristics of balancing speed and accuracy. The majority of Siamese‐based trackers only use the first frame extraction template for subsequent tracking in order to prevent the introduction of noise. However, merely with a single initial template employed, it is difficult to achieve the best performance of the tracker in the face of complex tracking environments such as occlusion, motion blur, and non‐rigid deformation. Therefore, the present paper proposes a new multi‐template fusion module based on graph attention network (G‐M module), which consists of two parts: a graph‐attention‐network‐based feature‐embedding module (G module) and a multi‐template fusion module (M module). It can greatly reduce the background noise introduced by template updating while improving the tracker's ability to adapt to changes in object appearance. In addition, in order to maximize the value of G‐M module, the present paper also puts forward a two‐stage template update threshold judgment mechanism. The Pearson correlation coefficient (PCCs) is introduced and combined with APCE and the maximum response value (F‐max) to filter out reliable templates for updating. In this paper, the proposed method is applied to the SiamFC and SiamFC++ trackers. Extensive experiments on mainstream data sets, such as OTB2015, VOT2016, and GOT‐10 k, show that the proposed method can effectively update the tracking template and improve the tracker performance. © 2022 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEJ Transactions on Electrical and Electronic Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.