A time-weighted metric for sets of trajectories to assess multi-object tracking algorithms

• URL: http://arxiv.org/abs/2110.13444v1
• Date: Tue, 26 Oct 2021 07:15:52 GMT
• Title: A time-weighted metric for sets of trajectories to assess multi-object tracking algorithms
• Abstract summary: This paper proposes a metric for sets of trajectories to evaluate multi-object tracking algorithms. The proposed metric extends the metric in [1] by including weights to the costs associated to different time steps.
• Score: 3.3989643515413235
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper proposes a metric for sets of trajectories to evaluate multi-object tracking algorithms that includes time-weighted costs for localisation errors of properly detected targets, for false targets, missed targets and track switches. The proposed metric extends the metric in [1] by including weights to the costs associated to different time steps. The time-weighted costs increase the flexibility of the metric [1] to fit more applications and user preferences. We first introduce a metric based on multi-dimensional assignments, and then its linear programming relaxation, which is computable in polynomial time and is also a metric. The metrics can also be extended to metrics on random finite sets of trajectories to evaluate and rank algorithms across different scenarios, each with a ground truth set of trajectories.

Related papers

• CoWTracker: Tracking by Warping instead of Correlation [53.834673070954494]
  We propose a dense point tracker that eschews cost volumes in favor of warping.<n>Inspired by recent advances in optical flow, our approach iteratively refines track estimates by warping features from the target frame to the query frame based on the current estimate.<n>Our model is simple and achieves state-of-the-art performance on standard dense point tracking benchmarks, including TAP-Vid-DAVIS, TAP-Vid-Kinetics, and Robo-TAP.
  arXiv  Detail & Related papers  (2026-02-04T18:58:59Z)
• DELTAv2: Accelerating Dense 3D Tracking [79.63990337419514]
  We propose a novel algorithm for accelerating dense long-term 3D point tracking in videos.<n>We introduce a coarse-to-fine strategy that begins tracking with a small subset of points and progressively expands the set of tracked trajectories.<n>The newly added trajectories are using a learnable module, which is trained end-to-end alongside the tracking network.
  arXiv  Detail & Related papers  (2025-08-02T03:15:47Z)
• Preference-Optimal Multi-Metric Weighting for Parallel Coordinate Plots [6.5422577283150245]
  We propose a principled formulation for calculating the optimal weight based on a specific preferred metric combination.<n>We achieved this using various radar charts to visualize the metric trade-offs on the 2D plane reduced by UMAP.
  arXiv  Detail & Related papers  (2025-06-24T06:48:09Z)
• Fast computation of the TGOSPA metric for multiple target tracking via unbalanced optimal transport [0.0]
  In multiple target tracking, it is important to be able to evaluate the performance of different tracking algorithms. The trajectory generalized optimal sub-pattern assignment metric (TGOSPA) is a recently proposed metric for such evaluations. We present an approximation algorithm for evaluating the TGOSPA metric, based on casting the TGOSPA problem as an unbalanced multimarginal optimal transport problem.
  arXiv  Detail & Related papers  (2025-03-12T14:51:03Z)
• From Target Tracking to Targeting Track -- Part I: A Metric for Spatio-Temporal Trajectory Evaluation [28.60731216439878]
  Traditional trajectory estimates are given by a curve function of time (FoT) FoT provides complete information of the movement of the target over time and can be used to infer the state corresponding to arbitrary time. To address this lacuna, we propose a metric denominated as thetemporal-aligned trajectory integral distance (-ID) The proposed distance metric and the time-averaged version is validated through theoretical analysis and numerical examples of a single target or multiple targets.
  arXiv  Detail & Related papers  (2025-02-20T16:47:50Z)
• Cost and Reward Infused Metric Elicitation [0.5356944479760104]
  In machine learning, metric elicitation refers to the selection of performance metrics that best reflect an individual's implicit preferences for a given application. We build upon the multiclass metric elicitation framework of Hiranandani et al., extrapolating their proposed Diagonal Linear Performance Metric Elicitation (DLPME) algorithm to account for additional bounded costs and rewards.
  arXiv  Detail & Related papers  (2025-01-01T01:36:49Z)
• TGOSPA Metric Parameters Selection and Evaluation for Visual Multi-object Tracking [4.998475411100799]
  We use the trajectory generalized optimal sub-pattern assignment (TGOSPA) metric to evaluate multi-object tracking performance. It accounts for localization errors, the number of missed and false objects, and the number of track switches. By exploring the TGOSPA parameter selection, we enable users to compare, comprehend, and optimize the performance of algorithms tailored for specific tasks.
  arXiv  Detail & Related papers  (2024-12-11T11:57:05Z)
• Truncating Trajectories in Monte Carlo Policy Evaluation: an Adaptive Approach [51.76826149868971]
  Policy evaluation via Monte Carlo simulation is at the core of many MC Reinforcement Learning (RL) algorithms. We propose as a quality index a surrogate of the mean squared error of a return estimator that uses trajectories of different lengths. We present an adaptive algorithm called Robust and Iterative Data collection strategy Optimization (RIDO)
  arXiv  Detail & Related papers  (2024-10-17T11:47:56Z)
• Unleash the Potential of 3D Point Cloud Modeling with A Calibrated Local Geometry-driven Distance Metric [62.365983810610985]
  We propose a novel distance metric called Calibrated Local Geometry Distance (CLGD) CLGD computes the difference between the underlying 3D surfaces calibrated and induced by a set of reference points. As a generic metric, CLGD has the potential to advance 3D point cloud modeling.
  arXiv  Detail & Related papers  (2023-06-01T11:16:20Z)
• Joint Metrics Matter: A Better Standard for Trajectory Forecasting [67.1375677218281]
  Multi-modal trajectory forecasting methods evaluate using single-agent metrics (marginal metrics) Only focusing on marginal metrics can lead to unnatural predictions, such as colliding trajectories or diverging trajectories for people who are clearly walking together as a group. We present the first comprehensive evaluation of state-of-the-art trajectory forecasting methods with respect to multi-agent metrics (joint metrics): JADE, JFDE, and collision rate.
  arXiv  Detail & Related papers  (2023-05-10T16:27:55Z)
• Navigating the Metric Maze: A Taxonomy of Evaluation Metrics for Anomaly Detection in Time Series [0.456877715768796]
  This paper provides a comprehensive overview of the metrics used for the evaluation of time series anomaly detection methods. Twenty metrics are analyzed and discussed in detail, highlighting the unique suitability of each for specific tasks.
  arXiv  Detail & Related papers  (2023-03-02T13:58:06Z)
• mvHOTA: A multi-view higher order tracking accuracy metric to measure spatial and temporal associations in multi-point detection [1.039718070553655]
  Multi-object tracking (MOT) is a challenging task that involves detecting objects in the scene and tracking them across a sequence of frames. The main evaluation metric to benchmark MOT methods on datasets such as KITTI has recently become the higher order tracking accuracy (HOTA) metric. We propose a multi-view higher order tracking metric (mvHOTA) to determine the accuracy of multi-point (multi-instance and multi-class) detection.
  arXiv  Detail & Related papers  (2022-06-19T10:31:53Z)
• Self-Supervised Metric Learning in Multi-View Data: A Downstream Task Perspective [2.01243755755303]
  We study how self-supervised metric learning can benefit downstream tasks in the context of multi-view data. We show that the target distance of metric learning satisfies several desired properties for the downstream tasks. Our analysis characterizes the improvement by self-supervised metric learning on four commonly used downstream tasks.
  arXiv  Detail & Related papers  (2021-06-14T02:34:33Z)
• Meta-Generating Deep Attentive Metric for Few-shot Classification [53.07108067253006]
  We present a novel deep metric meta-generation method to generate a specific metric for a new few-shot learning task. In this study, we structure the metric using a three-layer deep attentive network that is flexible enough to produce a discriminative metric for each task. We gain surprisingly obvious performance improvement over state-of-the-art competitors, especially in the challenging cases.
  arXiv  Detail & Related papers  (2020-12-03T02:07:43Z)
• Efficient Data Association and Uncertainty Quantification for Multi-Object Tracking [12.993112198633016]
  We propose the Joint Posterior Tracker (JPT) to robustly reasons over the posterior of associations and trajectories. JPT exhibits more accurate uncertainty representation of data associations with superior performance on standard metrics. We also show the utility of JPT applied to automatic scheduling of user-in-the-loop annotations for improved trajectory quality.
  arXiv  Detail & Related papers  (2020-11-13T19:36:56Z)
• AM-RRT*: Informed Sampling-based Planning with Assisting Metric [3.42658286826597]
  We present a new algorithm that extends RRT* and RT-RRT* for online path planning in complex, dynamic environments. Our method extends RRT-based sampling methods to enable the use of an assisting distance metric to improve performance in environments with obstacles.
  arXiv  Detail & Related papers  (2020-10-28T01:39:40Z)
• 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)
• Learning to Evaluate Perception Models Using Planner-Centric Metrics [104.33349410009161]
  We propose a principled metric for 3D object detection specifically for the task of self-driving. We find that our metric penalizes many of the mistakes that other metrics penalize by design. For human evaluation, we generate scenes in which standard metrics and our metric disagree and find that humans side with our metric 79% of the time.
  arXiv  Detail & Related papers  (2020-04-19T02:14:00Z)

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.