Appearance-free Tripartite Matching for Multiple Object Tracking

• URL: http://arxiv.org/abs/2008.03628v2
• Date: Thu, 7 Oct 2021 18:05:56 GMT
• Title: Appearance-free Tripartite Matching for Multiple Object Tracking
• Authors: Lijun Wang, Yanting Zhu, Jue Shi, Xiaodan Fan
• Abstract summary: Multiple Object Tracking (MOT) detects the trajectories of multiple objects given an input video. Most existing algorithms depend on the uniqueness of the object's appearance, and the dominating bipartite matching scheme ignores the speed smoothness. We propose an appearance-free tripartite matching to avoid the irregular velocity problem of the bipartite matching.
• Score: 6.165592821539306
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multiple Object Tracking (MOT) detects the trajectories of multiple objects given an input video. It has become more and more important for various research and industry areas, such as cell tracking for biomedical research and human tracking in video surveillance. Most existing algorithms depend on the uniqueness of the object's appearance, and the dominating bipartite matching scheme ignores the speed smoothness. Although several methods have incorporated the velocity smoothness for tracking, they either fail to pursue global smooth velocity or are often trapped in local optimums. We focus on the general MOT problem regardless of the appearance and propose an appearance-free tripartite matching to avoid the irregular velocity problem of the bipartite matching. The tripartite matching is formulated as maximizing the likelihood of the state vectors constituted of the position and velocity of objects, which results in a chain-dependent structure. We resort to the dynamic programming algorithm to find such a maximum likelihood estimate. To overcome the high computational cost induced by the vast search space of dynamic programming when many objects are to be tracked, we decompose the space by the number of disappearing objects and propose a reduced-space approach by truncating the decomposition. Extensive simulations have shown the superiority and efficiency of our proposed method, and the comparisons with top methods on Cell Tracking Challenge also demonstrate our competence. We also applied our method to track the motion of natural killer cells around tumor cells in a cancer study.\footnote{The source code is available on \url{https://github.com/szcf-weiya/TriMatchMOT}

Related papers

• Dense Optical Tracking: Connecting the Dots [82.79642869586587]
  DOT is a novel, simple and efficient method for solving the problem of point tracking in a video. We show that DOT is significantly more accurate than current optical flow techniques, outperforms sophisticated "universal trackers" like OmniMotion, and is on par with, or better than, the best point tracking algorithms like CoTracker.
  arXiv  Detail & Related papers  (2023-12-01T18:59:59Z)
• SparseTrack: Multi-Object Tracking by Performing Scene Decomposition based on Pseudo-Depth [84.64121608109087]
  We propose a pseudo-depth estimation method for obtaining the relative depth of targets from 2D images. Secondly, we design a depth cascading matching (DCM) algorithm, which can use the obtained depth information to convert a dense target set into multiple sparse target subsets. By integrating the pseudo-depth method and the DCM strategy into the data association process, we propose a new tracker, called SparseTrack.
  arXiv  Detail & Related papers  (2023-06-08T14:36:10Z)
• 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)
• ShaSTA: Modeling Shape and Spatio-Temporal Affinities for 3D Multi-Object Tracking [25.093138732809738]
  Multi-object tracking is a cornerstone capability of any robotic system. Detectors function in a low precision recall regime, ensuring a low number of false-negatives while producing a high rate of false-positives. We propose a method that learns shape andtemporal affinities between consecutive frames to better distinguish between true-positive and false-positive detections and tracks.
  arXiv  Detail & Related papers  (2022-11-08T00:20:38Z)
• CAMO-MOT: Combined Appearance-Motion Optimization for 3D Multi-Object Tracking with Camera-LiDAR Fusion [34.42289908350286]
  3D Multi-object tracking (MOT) ensures consistency during continuous dynamic detection. It can be challenging to accurately track the irregular motion of objects for LiDAR-based methods. We propose a novel camera-LiDAR fusion 3D MOT framework based on the Combined Appearance-Motion Optimization (CAMO-MOT)
  arXiv  Detail & Related papers  (2022-09-06T14:41:38Z)
• Real Time Detection Free Tracking of Multiple Objects Via Equilibrium Optimizer [0.951828574518325]
  Multiple objects tracking (MOT) is a difficult task, as it usually requires special hardware and higher computation. We present a new framework of MOT by using equilibrium algorithm (EO) and reducing the resolution of the bounding boxes of the objects. Experimental results confirm that EO multi-object tracker achieves satisfying tracking results.
  arXiv  Detail & Related papers  (2022-05-22T06:04:34Z)
• FMODetect: Robust Detection and Trajectory Estimation of Fast Moving Objects [110.29738581961955]
  We propose the first learning-based approach for detection and trajectory estimation of fast moving objects. The proposed method first detects all fast moving objects as a truncated distance function to the trajectory. For the sharp appearance estimation, we propose an energy minimization based deblurring.
  arXiv  Detail & Related papers  (2020-12-15T11:05:34Z)
• Factor Graph based 3D Multi-Object Tracking in Point Clouds [8.411514688735183]
  We propose a novel optimization-based approach that does not rely on explicit and fixed assignments. We demonstrate its performance on the real world KITTI tracking dataset and achieve better results than many state-of-the-art algorithms.
  arXiv  Detail & Related papers  (2020-08-12T13:34:46Z)
• Dense Scene Multiple Object Tracking with Box-Plane Matching [73.54369833671772]
  Multiple Object Tracking (MOT) is an important task in computer vision. We propose the Box-Plane Matching (BPM) method to improve the MOT performacne in dense scenes. With the effectiveness of the three modules, our team achieves the 1st place on the Track-1 leaderboard in the ACM MM Grand Challenge HiEve 2020.
  arXiv  Detail & Related papers  (2020-07-30T16:39:22Z)
• 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)
• Tracking Road Users using Constraint Programming [79.32806233778511]
  We present a constraint programming (CP) approach for the data association phase found in the tracking-by-detection paradigm of the multiple object tracking (MOT) problem. Our proposed method was tested on a motorized vehicles tracking dataset and produces results that outperform the top methods of the UA-DETRAC benchmark.
  arXiv  Detail & Related papers  (2020-03-10T00:04:32Z)

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.