<abstract xmlns="http://www.w3.org/1999/xhtml"><p>Multi-target tracking is a challenge due to the variable number of targets and the frequent interaction between targets in complex dynamic environments. This paper presents a multi-target tracking algorithm based on bipartite graph matching. Unlike previous approaches, the method proposed considers the target tracking as a bipartite graph matching problem where the nodes of the bipartite graph correspond to the targets in two neighboring frames, and the edges correspond to the degree of the similarity measure between the targets in different frames. Finding correspondence between the targets is formulated as a maximal matching problem which can be solved by the dynamic Hungarian algorithm. Then, merging and splitting of the targets detection is proposed, the candidate occlusion region is predicted according to the overlapping between the bounding boxes of the interacting targets to handle the mutual occlusion problem. The extensive experimental results show that the algorithm proposed can achieve good performance on dynamic target interactions compared to state-of-the-art methods.</p></abstract>

Multi-target tracking is a challenge due to the variable number of targets and the frequent interaction between targets in complex dynamic environments. This paper presents a multi-target tracking algorithm based on bipartite graph matching. Unlike previous approaches, the method proposed considers the target tracking as a bipartite graph matching problem where the nodes of the bipartite graph correspond to the targets in two neighboring frames, and the edges correspond to the degree of the similarity measure between the targets in different frames. Finding correspondence between the targets is formulated as a maximal matching problem which can be solved by the dynamic Hungarian algorithm. Then, merging and splitting of the targets detection is proposed, the candidate occlusion region is predicted according to the overlapping between the bounding boxes of the interacting targets to handle the mutual occlusion problem. The extensive experimental results show that the algorithm proposed can achieve good performance on dynamic target interactions compared to state-of-the-art methods.

Multi-Targets Tracking Based On Bipartite Graph Matching

School of Computer and Information, Hefei University of Technology, Hefei 230009 Anhui, China

School of Mathematics, Hefei University of Technology, Hefei 230009 Anhui, China

School of Computer and Information, Anhui Agriculture University, Hefei 230036 Anhui, China

Suzhou University, Suzhou 234000 Anhui, China

Cybernetics and Information Technologies

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"Multi-Targets Tracking Based On Bipartite Graph Matching"}

Multi-target tracking is a challenge due to the variable number of targets and the frequent interaction between targets in complex dynamic environments. This...

Multi-Targets Tracking Based On Bipartite Graph Matching

Data publikacji: 30 gru 2014

Zakres stron: 78 - 87

DOI: https://doi.org/10.2478/cait-2014-0045

© by Jinqin Zhong

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.