The Mean of Multi-Object Trajectories

Abstract

This paper introduces the concept of a mean for trajectories and multi-object trajectories (defined as sets or multi-sets of trajectories) along with algorithms for computing them. Specifically, we use the Fréchet mean, and metrics based on the optimal sub-pattern assignment (OSPA) construct, to extend the notion of average from vectors to trajectories and multi-object trajectories. Further, we develop efficient algorithms to compute these means using greedy search and Gibbs sampling. Using distributed multi-object tracking as an application, we demonstrate that the Fréchet mean approach to multi-object trajectory consensus significantly outperforms state-of-the-art distributed multi-object tracking methods.

References in corpus (11)

• FairMOT: On the Fairness of Detection and Re-Identification in Multiple Object Tracking
• Generalized optimal sub-pattern assignment metric
• Distributed Fusion with Multi-Bernoulli Filter based on Generalized Covariance Intersection
• Robust Distributed Fusion with Labeled Random Finite Sets
• A metric on the space of finite sets of trajectories for evaluation of multi-target tracking algorithms
• Computationally Efficient Distributed Multi-sensor Fusion with Multi-Bernoulli Filter
• Fusion of labeled RFS densities with minimum information loss
• Distributed Multi-object Tracking under Limited Field of View Sensors
• TrackerBots: Autonomous Unmanned Aerial Vehicle for Real-Time Localization and Tracking of Multiple Radio-Tagged Animals
• An Overview of Multi-Object Estimation via Labeled Random Finite Set
• Regenerative random permutations of integers