An efficient real-time target tracking algorithm using adaptive feature fusion

• URL: http://arxiv.org/abs/2204.02054v1
• Date: Tue, 5 Apr 2022 08:40:52 GMT
• Title: An efficient real-time target tracking algorithm using adaptive feature fusion
• Authors: Yanyan Liu, Changcheng Pan, Minglin Bie, and Jin Li
• Abstract summary: We propose an efficient real-time target tracking method based on a low-dimension adaptive feature fusion. The proposed algorithm can obtain a higher success rate and accuracy, improving by 0.023 and 0.019, respectively. The proposed method paves a more promising way for real-time target tracking tasks under a complex environment.
• Score: 5.629708188348423
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Visual-based target tracking is easily influenced by multiple factors, such as background clutter, targets fast-moving, illumination variation, object shape change, occlusion, etc. These factors influence the tracking accuracy of a target tracking task. To address this issue, an efficient real-time target tracking method based on a low-dimension adaptive feature fusion is proposed to allow us the simultaneous implementation of the high-accuracy and real-time target tracking. First, the adaptive fusion of a histogram of oriented gradient (HOG) feature and color feature is utilized to improve the tracking accuracy. Second, a convolution dimension reduction method applies to the fusion between the HOG feature and color feature to reduce the over-fitting caused by their high-dimension fusions. Third, an average correlation energy estimation method is used to extract the relative confidence adaptive coefficients to ensure tracking accuracy. We experimentally confirm the proposed method on an OTB100 data set. Compared with nine popular target tracking algorithms, the proposed algorithm gains the highest tracking accuracy and success tracking rate. Compared with the traditional Sum of Template and Pixel-wise LEarners (STAPLE) algorithm, the proposed algorithm can obtain a higher success rate and accuracy, improving by 0.023 and 0.019, respectively. The experimental results also demonstrate that the proposed algorithm can reach the real-time target tracking with 50 fps. The proposed method paves a more promising way for real-time target tracking tasks under a complex environment, such as appearance deformation, illumination change, motion blur, background, similarity, scale change, and occlusion.

Related papers

• Sparse Prior Is Not All You Need: When Differential Directionality Meets Saliency Coherence for Infrared Small Target Detection [15.605122893098981]
  This study introduces a Sparse Differential Directionality prior (SDD) framework. We leverage the distinct directional characteristics of targets to differentiate them from the background. We further enhance target detectability with a saliency coherence strategy. A Proximal Alternating Minimization-based (PAM) algorithm efficiently solves our proposed model.
  arXiv  Detail & Related papers  (2024-07-22T04:32:43Z)
• RTracker: Recoverable Tracking via PN Tree Structured Memory [71.05904715104411]
  We propose a recoverable tracking framework, RTracker, that uses a tree-structured memory to dynamically associate a tracker and a detector to enable self-recovery. Specifically, we propose a Positive-Negative Tree-structured memory to chronologically store and maintain positive and negative target samples. Our core idea is to use the support samples of positive and negative target categories to establish a relative distance-based criterion for a reliable assessment of target loss.
  arXiv  Detail & Related papers  (2024-03-28T08:54:40Z)
• Leveraging the Power of Data Augmentation for Transformer-based Tracking [64.46371987827312]
  We propose two data augmentation methods customized for tracking. First, we optimize existing random cropping via a dynamic search radius mechanism and simulation for boundary samples. Second, we propose a token-level feature mixing augmentation strategy, which enables the model against challenges like background interference.
  arXiv  Detail & Related papers  (2023-09-15T09:18:54Z)
• SCTracker: Multi-object tracking with shape and confidence constraints [11.210661553388615]
  This paper proposes a multi-object tracker based on shape constraint and confidence named SCTracker. Intersection of Union distance with shape constraints is applied to calculate the cost matrix between tracks and detections. The Kalman Filter based on the detection confidence is used to update the motion state to improve the tracking performance when the detection has low confidence.
  arXiv  Detail & Related papers  (2023-05-16T15:18:42Z)
• Real-time Multi-Object Tracking Based on Bi-directional Matching [0.0]
  This study offers a bi-directional matching algorithm for multi-object tracking. A stranded area is used in the matching algorithm to temporarily store the objects that fail to be tracked. In the MOT17 challenge, the proposed algorithm achieves 63.4% MOTA, 55.3% IDF1, and 20.1 FPS tracking speed.
  arXiv  Detail & Related papers  (2023-03-15T08:38:08Z)
• Towards Real-Time Visual Tracking with Graded Color-names Features [10.475679500780574]
  MeanShift algorithm has been widely used in tracking tasks because of its simplicity and efficiency. Traditional MeanShift algorithm needs to label the initial region of the target, which reduces the applicability of the algorithm. We develop a tracking method that combines the background models and the graded features of color-names under the MeanShift framework.
  arXiv  Detail & Related papers  (2022-06-17T11:38:37Z)
• Learning Dynamic Compact Memory Embedding for Deformable Visual Object Tracking [82.34356879078955]
  We propose a compact memory embedding to enhance the discrimination of the segmentation-based deformable visual tracking method. Our method outperforms the excellent segmentation-based trackers, i.e., D3S and SiamMask on DAVIS 2017 benchmark.
  arXiv  Detail & Related papers  (2021-11-23T03:07:12Z)
• ZARTS: On Zero-order Optimization for Neural Architecture Search [94.41017048659664]
  Differentiable architecture search (DARTS) has been a popular one-shot paradigm for NAS due to its high efficiency. This work turns to zero-order optimization and proposes a novel NAS scheme, called ZARTS, to search without enforcing the above approximation. In particular, results on 12 benchmarks verify the outstanding robustness of ZARTS, where the performance of DARTS collapses due to its known instability issue.
  arXiv  Detail & Related papers  (2021-10-10T09:35:15Z)
• Video Annotation for Visual Tracking via Selection and Refinement [74.08109740917122]
  We present a new framework to facilitate bounding box annotations for video sequences. A temporal assessment network is proposed which is able to capture the temporal coherence of target locations. A visual-geometry refinement network is also designed to further enhance the selected tracking results.
  arXiv  Detail & Related papers  (2021-08-09T05:56:47Z)
• Efficient and accurate object detection with simultaneous classification and tracking [1.4620086904601473]
  We propose a detection framework based on simultaneous classification and tracking in the point stream. In this framework, a tracker performs data association in sequences of the point cloud, guiding the detector to avoid redundant processing. Experiments were conducted on the benchmark dataset, and the results showed that the proposed method outperforms original tracking-by-detection approaches.
  arXiv  Detail & Related papers  (2020-07-04T10:22:33Z)
• Learning to Optimize Non-Rigid Tracking [54.94145312763044]
  We employ learnable optimizations to improve robustness and speed up solver convergence. First, we upgrade the tracking objective by integrating an alignment data term on deep features which are learned end-to-end through CNN. Second, we bridge the gap between the preconditioning technique and learning method by introducing a ConditionNet which is trained to generate a preconditioner.
  arXiv  Detail & Related papers  (2020-03-27T04:40:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.