article · The Scientific World JOURNAL · 2014
Multiple Object Tracking Using the Shortest Path Faster Association Algorithm
Zhenghao Xi, Heping Liu, Huaping Liu, Bin Yang
Cited by 9Open access
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.
Cite this paper
Xi, Z., Liu, H., Liu, H., & Yang, B. (2014). Multiple Object Tracking Using the Shortest Path Faster Association Algorithm. The Scientific World JOURNAL, 2014, 1–11. https://doi.org/10.1155/2014/481719
Xi, Zhenghao, et al. “Multiple Object Tracking Using the Shortest Path Faster Association Algorithm.” The Scientific World JOURNAL, vol. 2014, 2014, pp. 1–11, https://doi.org/10.1155/2014/481719.
Xi, Zhenghao, Heping Liu, Huaping Liu, and Bin Yang. 2014. “Multiple Object Tracking Using the Shortest Path Faster Association Algorithm.” The Scientific World JOURNAL 2014: 1–11. https://doi.org/10.1155/2014/481719.
Xi, Z. et al. (2014) ‘Multiple Object Tracking Using the Shortest Path Faster Association Algorithm’, The Scientific World JOURNAL, 2014, pp. 1–11. Available at: https://doi.org/10.1155/2014/481719.
@article{xi2014multiple,
title = {{Multiple Object Tracking Using the Shortest Path Faster Association Algorithm}},
author = {Xi, Zhenghao and Liu, Heping and Liu, Huaping and Yang, Bin},
journal = {The Scientific World JOURNAL},
volume = {2014},
pages = {1--11},
year = {2014},
doi = {10.1155/2014/481719}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Comparison Studies for Different Shortest path Algorithms
Abdelfatah Aref Tamimi · INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY · 2015
Cited by 23Open access
Comparison of Variants of Yen's Algorithm for Finding K-Simple Shortest Paths
Purnima Niranjane, S.Y. Amdani · International Conference on Intelligent Technologies (CONIT) · 2022
Cited by 10
Towards shortest path computation using Dijkstra algorithm
Neha Makariye · International Conference on IoT and Application (ICIOT) · 2017
Cited by 74
To Figure Out the First Rth Shortest Path Based on Optimal Floyed Algorithm
Wenning Wang · Journal of Changzhou Institute of Technology · 2009
Cited by 2
An Improved Bellman Algorithm for the Kth-shortest Path Problem
Hongyan Shang · Shuxue de shijian yu renshi · 2006
Cited by 2
Algorithm and its application to N shortest paths problem
Chai Deng · Journal of Zhejiang University(Engineering Science) · 2002
Cited by 10
Enumerating problem and optimization problem of shortest path trees
Li Bang · Journal of systems engineering · 2002
Cited by 0
Finding the Shortest Path Based on Delay PCNN
GU Xiao-dong · Dianzi xuebao · 2004
Cited by 3