合肥工业大学计算机与信息学院,安徽,合肥,230009
纸质出版:2017
移动端阅览
王治丹, 蒋建国, 齐美彬. 基于最大池图匹配的形变目标跟踪方法[J]. 电子学报, 2017,45(3):704-711.
WANG Zhi-dan, JIANG Jian-guo, QI Mei-bin. Deformable Object Tracking Based on Max-pooling Graph Matching[J]. Acta Electronica Sinica, 2017, 45(3): 704-711.
王治丹, 蒋建国, 齐美彬. 基于最大池图匹配的形变目标跟踪方法[J]. 电子学报, 2017,45(3):704-711. DOI: 10.3969/j.issn.0372-2112.2017.03.030.
WANG Zhi-dan, JIANG Jian-guo, QI Mei-bin. Deformable Object Tracking Based on Max-pooling Graph Matching[J]. Acta Electronica Sinica, 2017, 45(3): 704-711. DOI: 10.3969/j.issn.0372-2112.2017.03.030.
该文提出了一种基于最大池图匹配的形变目标跟踪算法,适用于跟踪目标产生较大形变或者严重遮挡等场合.此方法首先将目标搜索区域过分割为候选目标部件并建立动态图表示,即目标部件的表象特征和它们之间的几何位置关系.然后采用最大池图匹配算法,得到目标图和候选图中部件的匹配关系,从而确定出目标位置的置信图.联合考虑目标整体和目标部件对目标位置的支持,投票决定出精确的目标位置.在各种形变目标的跟踪序列测试下,该算法与其他跟踪器的对比验证了其有效性和鲁棒性.
This paper develops a novel deformable object tracking algorithm based on max-pooling graph matching
which can be applied in the scenes with large deformations and severe occlusions.The dynamic graph is built based on candidate parts extracted by over-segmentation method from searching area
namely feature representation of candidate parts and geometric structure between them.Based on max-pooling graph matching method
the matching relations between target parts and candidate parts are found to calculate the confidence map of target location.Considering both the support of holistic target and local parts
the optimal target location can be determined.Compared to state-of-the-art methods
experimental results on several deformable sequences demonstrate the effectiveness and robustness of the proposed method.
0
浏览量
2
下载量
3
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621