Share Email Print

Journal of Electronic Imaging

Dynamic shortest path association for multiple object tracking in video sequence
Author(s): Zhenghao Xi; Heping Liu; Huaping Liu; Yang Zheng
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Persistently tracking multiple objects in cluttered environments is very challenging. We present a tracking association approach based on the shortest path faster algorithm. We first formulate the multiple object tracking as an integer programming problem of the flow network. Under this framework, the integer assumption is relaxed to a standard linear programming problem. Therefore, the global optimal solution can quickly be obtained using the fast dynamic shortest path algorithm, which highlights the dynamic programming characteristic of the shortest path, thus faster, algorithm. The proposed method avoids the difficulties of integer programming; more importantly, it has a lower worst-case complexity than competing methods but a better tracking accuracy and robustness in complex environments. Simulation results show that our proposed algorithm takes less time than other methods and can operate in real time.

Paper Details

Date Published: 8 January 2015
PDF: 15 pages
J. Electron. Imag. 24(1) 013009 doi: 10.1117/1.JEI.24.1.013009
Published in: Journal of Electronic Imaging Volume 24, Issue 1
Show Author Affiliations
Zhenghao Xi, Univ. of Science and Technology Beijing (China)
Tsinghua Univ. (China)
Heping Liu, Univ. of Science and Technology Beijing (China)
Huaping Liu, Tsinghua Univ. (China)
Yang Zheng, Univ. of Science and Technology Beijing (China)

© SPIE. Terms of Use
Back to Top