title: Multiple object tracking using the shortest path faster association algorithm.
abstract: 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.
authors.affiliation: School of Automation and Electrical Engineering, University of Science and Technology Beijing, Beijing 100083, China ; State Key Laboratory of Intelligent Technology and Systems, Tsinghua University, Beijing 100084, China.
authors.forename: Zhenghao
authors.identifier: 0000-0002-8144-3123
authors.initials: Z
authors.lastname: Xi
authors.affiliation: School of Automation and Electrical Engineering, University of Science and Technology Beijing, Beijing 100083, China.
authors.forename: Heping
authors.initials: H
authors.lastname: Liu
authors.affiliation: State Key Laboratory of Intelligent Technology and Systems, Tsinghua University, Beijing 100084, China.
authors.forename: Huaping
authors.initials: H
authors.lastname: Liu
authors.affiliation: Department of Electronic Engineering, Changwon National University, Changwon 641-773, Republic of Korea.
authors.forename: Bin
authors.initials: B
authors.lastname: Yang
mesh_terms: D000465:Algorithms; D008962:Models, Theoretical