Cargando…
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...
Autores principales: | Xi, Zhenghao, Liu, Heping, Liu, Huaping, Yang, Bin |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4151586/ https://www.ncbi.nlm.nih.gov/pubmed/25215322 http://dx.doi.org/10.1155/2014/481719 |
Ejemplares similares
-
Euclidean shortest paths: exact or approximate algorithms
por: Li, Fajie, et al.
Publicado: (2014) -
An Improved Physarum polycephalum Algorithm for the Shortest Path Problem
por: Zhang, Xiaoge, et al.
Publicado: (2014) -
Distributed algorithms from arboreal ants for the shortest path problem
por: Garg, Shivam, et al.
Publicado: (2023) -
Shortest Paths in Multiplex Networks
por: Ghariblou, Saeed, et al.
Publicado: (2017) -
Finding shortest lattice vectors faster using quantum search
por: Laarhoven, Thijs, et al.
Publicado: (2015)