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
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
Originalsprog | Engelsk |
---|---|
Titel | Computer Vision –- ECCV 2022 : 17th European Conference, Tel Aviv, Israel, October 23–27, 2022, Proceedings, Part VIII |
Redaktører | Shai Avidan, Gabriel Brostow, Moustapha Cissé, Giovanni Maria Farinella, Tal Hassner |
Forlag | Springer |
Publikationsdato | 12 nov. 2022 |
Sider | 20-37 |
ISBN (Trykt) | 978-3-031-20073-1 |
ISBN (Elektronisk) | 978-3-031-20074-8 |
DOI | |
Status | Udgivet - 12 nov. 2022 |
Begivenhed | European Conference on Computer Vision 2022 - Tel Aviv, Israel Varighed: 23 okt. 2022 → 27 okt. 2022 https://eccv2022.ecva.net/ |
Konference
Konference | European Conference on Computer Vision 2022 |
---|---|
Land/Område | Israel |
By | Tel Aviv |
Periode | 23/10/2022 → 27/10/2022 |
Internetadresse |
Navn | Lecture Notes in Computer Science (LNCS) |
---|---|
Vol/bind | 13668 |
ISSN | 0302-9743 |