文章基本信息

标题：Multi-Targets Tracking Based on Bipartite Graph Matching
本地全文：下载
作者：Jinqin Zhong ; Jieqing Tan ; Yingying Li 等
期刊名称：Cybernetics and Information Technologies
印刷版ISSN：1311-9702
电子版ISSN：1314-4081
出版年度：2014
卷号：14
期号：Special
DOI：10.2478/cait-2014-0045
出版社：Bulgarian Academy of Science
摘要：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-target tracking; bipartite graph optimal matching; target ; interaction; merging and splitting