Object Relocation Visual Tracking Based on Histogram Filter and Siamese Network in Intelligent Transportation
Open Access
Abstract
Target detection and tracking algorithms are one of the key technologies in the field of autonomous driving in intelligent transportation, providing important sensing capabilities for vehicle localization and path planning. Siamese network-based trackers formulate the visual tracking mission as an image-matching process by regression and classification branches, which simplifies the network structure and improves the tracking accuracy. However, there remain many problems, as described below. (1) The lightweight neural networks decrease the feature representation ability. It is easy for the tracker to fail under the disturbing distractors (e.g., deformation and similar objects) or large changes in the viewing angle. (2) The tracker cannot adapt to variations of the object. (3) The tracker cannot reposition the object that has failed to track. To address these issues, we first propose a novel match filter arbiter based on the Euclidean distance histogram between the centers of multiple candidate objects to automatically determine whether the tracker fails. Secondly, the Hopcroft–Karp algorithm is introduced to select the winners from the dynamic template set through the backtracking process, and object relocation is achieved by comparing the Gradient Magnitude Similarity Deviation between the template and the winners. The experiments show that our method obtains better performance on several tracking benchmarks, i.e., OTB100, VOT2018, GOT-10k, and LaSOT, compared with state-of-the-art methods.Keywords
Funding Information
- National Key Research and Development Program of China (2020YFB1807500, 62072360, 62001357, 62172438, 61901367, 2021ZDLGY02-09, 2020JQ-844, 2022A1515010988, 2022JH-RGZN-0003, 20RGZN0005, 201805052-ZD3CG36)
- National Natural Science Foundation of China (2020YFB1807500, 62072360, 62001357, 62172438, 61901367, 2021ZDLGY02-09, 2020JQ-844, 2022A1515010988, 2022JH-RGZN-0003, 20RGZN0005, 201805052-ZD3CG36)
- Key Research and Development Plan of Shaanxi Province (2020YFB1807500, 62072360, 62001357, 62172438, 61901367, 2021ZDLGY02-09, 2020JQ-844, 2022A1515010988, 2022JH-RGZN-0003, 20RGZN0005, 201805052-ZD3CG36)
- Natural Science Foundation of Guangdong Province of China (2020YFB1807500, 62072360, 62001357, 62172438, 61901367, 2021ZDLGY02-09, 2020JQ-844, 2022A1515010988, 2022JH-RGZN-0003, 20RGZN0005, 201805052-ZD3CG36)
- Artificial Intelligence of Xi’an Science and Technology Plan (2020YFB1807500, 62072360, 62001357, 62172438, 61901367, 2021ZDLGY02-09, 2020JQ-844, 2022A1515010988, 2022JH-RGZN-0003, 20RGZN0005, 201805052-ZD3CG36)
- Xi’an Science and Technology Plan (2020YFB1807500, 62072360, 62001357, 62172438, 61901367, 2021ZDLGY02-09, 2020JQ-844, 2022A1515010988, 2022JH-RGZN-0003, 20RGZN0005, 201805052-ZD3CG36)
- Xi’an Key Laboratory of Mobile Edge Computing and Security (2020YFB1807500, 62072360, 62001357, 62172438, 61901367, 2021ZDLGY02-09, 2020JQ-844, 2022A1515010988, 2022JH-RGZN-0003, 20RGZN0005, 201805052-ZD3CG36)
This publication has 34 references indexed in Scilit:
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksIEEE Transactions on Pattern Analysis and Machine Intelligence, 2016
- Hierarchical Convolutional Features for Visual Tracking2015
- High-Speed Tracking with Kernelized Correlation FiltersIEEE Transactions on Pattern Analysis and Machine Intelligence, 2014
- Exploiting the Circulant Structure of Tracking-by-Detection with Kernels2012
- Signaling cost and performance of SIGMA: A seamless handover scheme for data networksWireless Communications and Mobile Computing, 2005
- The Hungarian method for the assignment problemNaval Research Logistics (NRL), 2004
- Random Forest: A Classification and Regression Tool for Compound Classification and QSAR ModelingJournal of Chemical Information and Computer Sciences, 2003
- An adaptive color-based particle filterImage and Vision Computing, 2003
- Mean shift: a robust approach toward feature space analysisIEEE Transactions on Pattern Analysis and Machine Intelligence, 2002
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973