Machine Learning Methods for Data Association in Multi-Object Tracking

Abstract

Data association is a key step within the multi-object tracking pipeline that is notoriously challenging due to its combinatorial nature. A popular and general way to formulate data association is as the NP-hard multidimensional assignment problem (MDAP). Over the last few years, data-driven approaches to assignment have become increasingly prevalent as these techniques have started to mature. We focus this survey solely on learning algorithms for the assignment step of multi-object tracking, and we attempt to unify various methods by highlighting their connections to linear assignment as well as to the MDAP. First, we review probabilistic and end-to-end optimization approaches to data association, followed by methods that learn association affinities from data. We then compare the performance of the methods presented in this survey, and conclude by discussing future research directions.

Accepted for publication in ACM Computing Surveys

References in corpus (7)

• Tracking without bells and whistles
• A Scalable Algorithm for Tracking an Unknown Number of Targets Using Multiple Sensors
• Approximate evaluation of marginal association probabilities with belief propagation
• Deep Continuous Conditional Random Fields with Asymmetric Inter-object Constraints for Online Multi-object Tracking
• Tracklet Association by Online Target-Specific Metric Learning and Coherent Dynamics Estimation
• A Hybrid Data Association Framework for Robust Online Multi-Object Tracking
• Learning Optimal Parameters for Multi-target Tracking with Contextual Interactions