Multiple object tracking using the shortest path faster association algorithm.
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...
| Publicado en: | Scientific World Journal pp. 481719 - 481720 |
|---|---|
| Autores principales: | , , , |
| Formato: | research Journal Article |
| Publicado: |
Wiley-Blackwell
2014
|
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=103845734&site=ehost-live header: @attributes: shortDbName: ccm uiTerm: 103845734 longDbName: CINAHL Complete uiTag: AN controlInfo: bkinfo: dissinfo: jinfo: jid: 1537744X 1BX5 jtl: Scientific World Journal issn: 1537744X maglogo: N pubinfo: dt: 2014 pid: 480 pub: Wiley-Blackwell place: Malden, Massachusetts artinfo: ui: 103845734 103845734 NLM25215322 2012727978 10.1155/2014/481719 NLM25215322 PMC4151586 103845734 ppf: 481719 ppct: 1 formats: tig: atl: Multiple object tracking using the shortest path faster association algorithm. aug: au: Xi, Zhenghao Liu, Heping Liu, Huaping Yang, Bin affil: 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. sug: subj: Algorithms Models, Theoretical ab: 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. pubtype: Academic Journal doctype: research Journal Article ougenre: Article language: English refInfo: holdings: @attributes: islocal: N |
|---|