The reviewed record of science sign in
Pith

arxiv: 2207.10031 · v1 · pith:MYZZ4B5G · submitted 2022-07-20 · cs.CV

MOTCOM: The Multi-Object Tracking Dataset Complexity Metric

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:MYZZ4B5Grecord.jsonopen to challenge →

classification cs.CV
keywords motcomcomplexitydatasetsmetriccomprehensivedatasetdescribingmulti-object
0
0 comments X
read the original abstract

There exists no comprehensive metric for describing the complexity of Multi-Object Tracking (MOT) sequences. This lack of metrics decreases explainability, complicates comparison of datasets, and reduces the conversation on tracker performance to a matter of leader board position. As a remedy, we present the novel MOT dataset complexity metric (MOTCOM), which is a combination of three sub-metrics inspired by key problems in MOT: occlusion, erratic motion, and visual similarity. The insights of MOTCOM can open nuanced discussions on tracker performance and may lead to a wider acknowledgement of novel contributions developed for either less known datasets or those aimed at solving sub-problems. We evaluate MOTCOM on the comprehensive MOT17, MOT20, and MOTSynth datasets and show that MOTCOM is far better at describing the complexity of MOT sequences compared to the conventional density and number of tracks. Project page at https://vap.aau.dk/motcom

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.