[2D1] [General Session] 13. AI Application

[2D1-03] Performance enhancement of multi-human tracking based on K-Shortest Paths by data reduction

〇Nozomi Hata¹, Yuri Nishikawa^3,4, Takashi Nakayama¹, Jun Ozawa³, Katsuki Fujisawa^2,3 (1. Faculty of Mathematics, Kyushu University, 2. Institute of Mathematics for Industry, Kyushu University, 3. National Institute of Advanced Industrial Science and Technology, 4. Panasonic Corporation)

Keywords:multi human tracking, graph optimization, K-Shortest Paths, parallel computing

Object tracking is a challenging problem and it has been improving dramatically in recent years. In this paper, we perform parallelized multi-object tracking system. Object tracking problem has 2 difficulties; one is to detect objects collect, and the other is to track collect using the collect object detection. Jerome et al. performed a multi-object tracking system using K-Shortest Paths to avoid these problems efficiently.
However, it is difficult to calculate in parallel because of the iterations calculation of shortest paths on the graph while changing the weight of graph.
In our method, we divided time intervals to apply KSP method from Probability Occupancy Map(POM), which is also obtained via using KSP method. Performance evaluation shows our algorithm is 5.4 times faster than the original KSP with 87% accuracy.