GRAP-MOT: Unsupervised Graph-based Position Weighted Person Multi-camera Multi-object Tracking in a Highly Congested Space
Marek Socha, Michał Marczyk, Aleksander Kempski, Michał Cogiel, Paweł Foszner, Radosław Zawiski, Michał Staniszewski
TL;DR
GRAP-MOT tackles multi-camera MOT in highly congested closed spaces by online graph-based identity updates that fuse head-based features and, when available, position estimates. The method builds a cross-camera tracklet graph with edge similarities $s_{ij}^f$, $s_{ij}^p$, and edge occurrences $o_{ij}$, updated through $I_{ij}$ and refined via graph partitioning with $Q$ and repulsion rules. Through extensive internal and CAMPUS dataset experiments, the authors identify the best single-camera tracker (SORT), best head feature (ResNet50), and a greedy modularity based partitioning scheme, while showing the crucial role of position estimation in achieving strong cross-camera identity consistency as measured by IDF1. They also argue that IDF1 provides a more faithful MOT quality measure than MOTA in congested scenarios, discuss limitations, and provide public access to code and data for reproducibility and benchmarking.
Abstract
GRAP-MOT is a new approach for solving the person MOT problem dedicated to videos of closed areas with overlapping multi-camera views, where person occlusion frequently occurs. Our novel graph-weighted solution updates a person's identification label online based on tracks and the person's characteristic features. To find the best solution, we deeply investigated all elements of the MOT process, including feature extraction, tracking, and community search. Furthermore, GRAP-MOT is equipped with a person's position estimation module, which gives additional key information to the MOT method, ensuring better results than methods without position data. We tested GRAP-MOT on recordings acquired in a closed-area model and on publicly available real datasets that fulfil the requirement of a highly congested space, showing the superiority of our proposition. Finally, we analyzed existing metrics used to compare MOT algorithms and concluded that IDF1 is more adequate than MOTA in such comparisons. We made our code, along with the acquired dataset, publicly available.
