Multiple Object Tracking Using the Shortest Path Faster Association Algorithm

Abstract EN

To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm.

First, the multiple object tracking is formulated as an integer programming problem of the flow network.

Then we relax the integer programming to a standard linear programming problem.

Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm.

The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments.

Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time.