Pith. sign in

REVIEW

MOTCOM: The Multi-Object Tracking Dataset Complexity Metric

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

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

Malte Pedersen , Joakim Bruslund Haurum , Patrick Dendorfer , Thomas B. Moeslund This is my paper · ORCID
classification cs.CV
keywords motcomcomplexitydatasetsmetriccomprehensivedatasetdescribingmulti-object
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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

Discussion (0). Continue with ORCID to comment.

Pith tools