Graph matching based on spectral embedding with missing value |
| |
Authors: | Jin Tang Bo Jiang Aihua Zheng Bin Luo |
| |
Affiliation: | Key Lab of Intelligent Computing and Signal Processing of Ministry of Education, School of Computer Science and Technology, Anhui University, PR China |
| |
Abstract: | This paper proposes an efficient algorithm for inexact graph matching based on spectral embedding with missing value. We commence by building an association graph model based on initial matching algorithm. Then, by dot product representation of graph with missing value, a new embedding method (co-embedding), where the correspondences between unmatched nodes are treated as missing data in an association graph, is presented. At last, a new graph matching algorithm which alternates between the co-embedding and point pattern matching is proposed. Convictive experimental results on both synthetic and real-world data demonstrate the effectiveness of the proposed graph matching algorithm. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|