Learning Multi-target Tracking with Quadratic Object Interactions

12/05/2014
by   Shaofei Wang, et al.
0

We describe a model for multi-target tracking based on associating collections of candidate detections across frames of a video. In order to model pairwise interactions between different tracks, such as suppression of overlapping tracks and contextual cues about co-occurence of different objects, we augment a standard min-cost flow objective with quadratic terms between detection variables. We learn the parameters of this model using structured prediction and a loss function which approximates the multi-target tracking accuracy. We evaluate two different approaches to finding an optimal set of tracks under model objective based on an LP relaxation and a novel greedy extension to dynamic programming that handles pairwise interactions. We find the greedy algorithm achieves equivalent performance to the LP relaxation while being 2-7x faster than a commercial solver. The resulting model with learned parameters outperforms existing methods across several categories on the KITTI tracking benchmark.

READ FULL TEXT

page 1

page 6

research
10/05/2016

Learning Optimal Parameters for Multi-target Tracking with Contextual Interactions

We describe an end-to-end framework for learning parameters of min-cost ...
research
12/08/2015

Tracking Objects with Higher Order Interactions using Delayed Column Generation

We study the problem of multi-target tracking and data association in vi...
research
08/14/2014

On Pairwise Costs for Network Flow Multi-Object Tracking

Multi-object tracking has been recently approached with the min-cost net...
research
06/19/2017

Multi-Target Tracking in Multiple Non-Overlapping Cameras using Constrained Dominant Sets

In this paper, a unified three-layer hierarchical approach for solving t...
research
03/30/2022

Learning of Global Objective for Network Flow in Multi-Object Tracking

This paper concerns the problem of multi-object tracking based on the mi...
research
09/19/2019

Learning Optimal and Near-Optimal Lexicographic Preference Lists

We consider learning problems of an intuitive and concise preference mod...

Please sign up or login with your details

Forgot password? Click here to reset