Graph matching based on spectral embedding with missing value

作者：Tang Jin; Jiang Bo; Zheng Aihua; Luo Bin^*

来源：Pattern Recognition, 2012, 45(10): 3768-3779.

DOI：10.1016/j.patcog.2012.03.016

• Dot product representation of graph
• Missing value
• Association graph
• Co-embedding
• Point pattern matching

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.

• 出版日期2012-10
• 单位安徽大学