期刊
IEEE TRANSACTIONS ON CYBERNETICS
卷 51, 期 2, 页码 521-533出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2019.2912718
关键词
Graph matching; joint transformation; similarity metric
类别
资金
- Hong Kong Research Grants Council [C1007-15G]
- National Natural Science Foundation of China [U1611265, 61403164, 61572536, 11631015]
- Natural Science Foundation of Guangdong Province [2016A030313710, 2015A030313624]
In this paper, a robust graph matching (RGM) model is proposed to improve the effectiveness and robustness in matching graphs with deformations, rotations, outliers, and noise. The RGM model embeds joint geometric transformation and utilizes $L_{2,1}$ -norm as the similarity metric for enhanced robustness. Extensive experiments demonstrate the competitive performance of the RGM model in various graph matching tasks.
Establishing correspondence between two given geometrical graph structures is an important problem in computer vision and pattern recognition. In this paper, we propose a robust graph matching (RGM) model to improve the effectiveness and robustness on the matching graphs with deformations, rotations, outliers, and noise. First, we embed the joint geometric transformation into the graph matching model, which performs unary matching over graph nodes and local structure matching over graph edges simultaneously. Then, the $L_{2,1}$ -norm is used as the similarity metric in the presented RGM to enhance the robustness. Finally, we derive an objective function which can be solved by an effective optimization algorithm, and theoretically prove the convergence of the proposed algorithm. Extensive experiments on various graph matching tasks, such as outliers, rotations, and deformations show that the proposed RGM model achieves competitive performance compared to the existing methods.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据