A single target tracking algorithm based on Generative Adversarial Networks

• URL: http://arxiv.org/abs/1912.11967v1
• Date: Fri, 27 Dec 2019 02:55:48 GMT
• Title: A single target tracking algorithm based on Generative Adversarial Networks
• Authors: Zhaofu Diao
• Abstract summary: We propose a single target tracking algorithm with anti-occlusion capability. In actual performance, our algorithm can successfully track the target in the occluded dataset.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the single target tracking field, occlusion leads to the loss of tracking targets is a ubiquitous and arduous problem. To solve this problem, we propose a single target tracking algorithm with anti-occlusion capability. The main content of our algorithm is to use the Region Proposal Network to obtain the tracked target and potential interferences, and use the occlusion awareness module to judge whether the interfering object occludes the target. If no occlusion occurs, continue tracking. If occlusion occurs, the prediction module is started, and the motion trajectory of the target in subsequent frames is predicted according to the motion trajectory before occlusion. The result obtained by the prediction module is used to replace the target position feature obtained by the original tracking algorithm. So we solve the problem that the occlusion causes the tracking algorithm to lose the target. In actual performance, our algorithm can successfully track the target in the occluded dataset. On the VOT2018 dataset, our algorithm has an EAO of 0.421, an Accuracy of 0.67, and a Robustness of 0.186. Compared with SiamRPN ++, they increased by 1.69%, 11.67% and 9.3%, respectively.

Related papers

• An Approximate Dynamic Programming Framework for Occlusion-Robust Multi-Object Tracking [2.4549686118633938]
  We propose a framework called approximate dynamic programming track (ADPTrack) It applies dynamic programming principles to improve an existing method called the base. The proposed method demonstrates a 0.7% improvement in the association accuracy over a state-of-the-art method.
  arXiv  Detail & Related papers  (2024-05-24T01:27:14Z)
• 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)
• SalienDet: A Saliency-based Feature Enhancement Algorithm for Object Detection for Autonomous Driving [160.57870373052577]
  We propose a saliency-based OD algorithm (SalienDet) to detect unknown objects. Our SalienDet utilizes a saliency-based algorithm to enhance image features for object proposal generation. We design a dataset relabeling approach to differentiate the unknown objects from all objects in training sample set to achieve Open-World Detection.
  arXiv  Detail & Related papers  (2023-05-11T16:19:44Z)
• 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)
• An efficient real-time target tracking algorithm using adaptive feature fusion [5.629708188348423]
  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.
  arXiv  Detail & Related papers  (2022-04-05T08:40:52Z)
• Class agnostic moving target detection by color and location prediction of moving area [11.326363150470204]
  Moving target detection plays an important role in computer vision. Recent algorithms such as deep learning-based convolutional neural networks have achieved high accuracy and real-time performance. We propose a model free moving target detection algorithm.
  arXiv  Detail & Related papers  (2021-06-24T12:34:58Z)
• Sparse and Imperceptible Adversarial Attack via a Homotopy Algorithm [93.80082636284922]
  Sparse adversarial attacks can fool deep networks (DNNs) by only perturbing a few pixels. Recent efforts combine it with another l_infty perturbation on magnitudes. We propose a homotopy algorithm to tackle the sparsity and neural perturbation framework.
  arXiv  Detail & Related papers  (2021-06-10T20:11:36Z)
• Learning Target Candidate Association to Keep Track of What Not to Track [100.80610986625693]
  We propose to keep track of distractor objects in order to continue tracking the target. To tackle the problem of lacking ground-truth correspondences between distractor objects in visual tracking, we propose a training strategy that combines partial annotations with self-supervision. Our tracker sets a new state-of-the-art on six benchmarks, achieving an AUC score of 67.2% on LaSOT and a +6.1% absolute gain on the OxUvA long-term dataset.
  arXiv  Detail & Related papers  (2021-03-30T17:58:02Z)
• Graph Attention Tracking [76.19829750144564]
  We propose a simple target-aware Siamese graph attention network for general object tracking. Experiments on challenging benchmarks including GOT-10k, UAV123, OTB-100 and LaSOT demonstrate that the proposed SiamGAT outperforms many state-of-the-art trackers.
  arXiv  Detail & Related papers  (2020-11-23T04:26:45Z)
• Bayesian Optimization with Machine Learning Algorithms Towards Anomaly Detection [66.05992706105224]
  In this paper, an effective anomaly detection framework is proposed utilizing Bayesian Optimization technique. The performance of the considered algorithms is evaluated using the ISCX 2012 dataset. Experimental results show the effectiveness of the proposed framework in term of accuracy rate, precision, low-false alarm rate, and recall.
  arXiv  Detail & Related papers  (2020-08-05T19:29:35Z)
• Accurate Bounding-box Regression with Distance-IoU Loss for Visual Tracking [42.81230953342163]
  The proposed method achieves competitive tracking accuracy when compared to state-of-the-art trackers. The target estimation part is trained to predict the DIoU score between the target ground-truth bounding-box and the estimated bounding-box. We introduce a classification part that is trained online and optimized with a Conjugate-Gradient-based strategy to guarantee real-time tracking speed.
  arXiv  Detail & Related papers  (2020-07-03T11:57:54Z)

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.