SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2108.10606 · ICCV · 2021

Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths

Andrea Hornakova, Roberto Henschel, Bodo Rosenhahn, Paul Swoboda, Timo Kaiser, Michal Rolinek

arXiv · PDF · Open in the Atlas

Code that ran

We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

We present an efficient approximate message passing solver for the lifted disjoint paths problem (LDP), a natural but NP-hard model for multiple object tracking (MOT). Our tracker scales to very large instances that come from long and crowded MOT sequences. Our approximate solver enables us to process the MOT15/16/17 benchmarks without sacrificing solution quality and allows for solving MOT20, which has been out of reach up to now for LDP solvers due to its size and complexity. On all these four standard MOT benchmarks we achieve performance comparable or better than current state-of-the-art methods including a tracker based on an optimal LDP solver.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2108.10606")
get_code_for_paper("2108.10606")
have("2108.10606")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2108.10606.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2108.10606.svg)](https://syntology.ai/paper/2108.10606)

Connect an agent — have() is free.