Accurate Bounding-box Regression with Distance-IoU Loss for Visual Tracking

• URL: http://arxiv.org/abs/2007.01864v4
• Date: Thu, 20 Jan 2022 02:43:52 GMT
• Title: Accurate Bounding-box Regression with Distance-IoU Loss for Visual Tracking
• Authors: Di Yuan, Xiu Shu, Nana Fan, Xiaojun Chang, Qiao Liu and Zhenyu He
• Abstract summary: 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.
• Score: 42.81230953342163
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Most existing trackers are based on using a classifier and multi-scale estimation to estimate the target state. Consequently, and as expected, trackers have become more stable while tracking accuracy has stagnated. While trackers adopt a maximum overlap method based on an intersection-over-union (IoU) loss to mitigate this problem, there are defects in the IoU loss itself, that make it impossible to continue to optimize the objective function when a given bounding box is completely contained within/without another bounding box; this makes it very challenging to accurately estimate the target state. Accordingly, in this paper, we address the above-mentioned problem by proposing a novel tracking method based on a distance-IoU (DIoU) loss, such that the proposed tracker consists of target estimation and target classification. The target estimation part is trained to predict the DIoU score between the target ground-truth bounding-box and the estimated bounding-box. The DIoU loss can maintain the advantage provided by the IoU loss while minimizing the distance between the center points of two bounding boxes, thereby making the target estimation more accurate. Moreover, we introduce a classification part that is trained online and optimized with a Conjugate-Gradient-based strategy to guarantee real-time tracking speed. Comprehensive experimental results demonstrate that the proposed method achieves competitive tracking accuracy when compared to state-of-the-art trackers while with a real-time tracking speed.

Related papers

• 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)
• Multi-Ship Tracking by Robust Similarity metric [10.882525351991875]
  Multi-ship tracking (MST) as a core technology has been proven to be applied to situational awareness at sea and the development of a navigational system for autonomous ships. Despite impressive tracking outcomes achieved by multi-object tracking (MOT) algorithms for pedestrian and vehicle datasets, these models and techniques exhibit poor performance when applied to ship datasets. In this paper, we address the weaknesses of IoU by incorporating the smallest convex shapes that enclose both the predicted and detected bounding boxes.
  arXiv  Detail & Related papers  (2023-10-08T14:05:10Z)
• 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)
• 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)
• Continuity-Discrimination Convolutional Neural Network for Visual Object Tracking [150.51667609413312]
  This paper proposes a novel model, named Continuity-Discrimination Convolutional Neural Network (CD-CNN) for visual object tracking. To address this problem, CD-CNN models temporal appearance continuity based on the idea of temporal slowness. In order to alleviate inaccurate target localization and drifting, we propose a novel notion, object-centroid.
  arXiv  Detail & Related papers  (2021-04-18T06:35:03Z)
• Alpha-Refine: Boosting Tracking Performance by Precise Bounding Box Estimation [85.22775182688798]
  This work proposes a novel, flexible, and accurate refinement module called Alpha-Refine. It can significantly improve the base trackers' box estimation quality. Experiments on TrackingNet, LaSOT, GOT-10K, and VOT 2020 benchmarks show that our approach significantly improves the base trackers' performance with little extra latency.
  arXiv  Detail & Related papers  (2020-12-12T13:33:25Z)
• Tracking-by-Counting: Using Network Flows on Crowd Density Maps for Tracking Multiple Targets [96.98888948518815]
  State-of-the-art multi-object tracking(MOT) methods follow the tracking-by-detection paradigm. We propose a new MOT paradigm, tracking-by-counting, tailored for crowded scenes.
  arXiv  Detail & Related papers  (2020-07-18T19:51:53Z)
• A single target tracking algorithm based on Generative Adversarial Networks [0.0]
  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.
  arXiv  Detail & Related papers  (2019-12-27T02:55:48Z)

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.