A novel graph matching method based on the local and global distance information of the graph nodes

Zhaoning Yin; Chunyu Zhao; Dongmei Niu; Xiuyang Zhao

doi:10.1117/12.2574410

24 June 2020 A novel graph matching method based on the local and global distance information of the graph nodes

Zhaoning Yin, Chunyu Zhao, Dongmei Niu, Xiuyang Zhao

Proceedings Volume 11526, Fifth International Workshop on Pattern Recognition; 1152603 (2020) https://doi.org/10.1117/12.2574410
Event: Fifth International Workshop on Pattern Recognition, 2020, Chengdu, China

Abstract

Graph matching is a classical NP-hard problem, and it plays an important role in many applications in computer science. In this paper, we propose an approximate graph matching method. For two graphs to be matched, our method first constructs an association graph with nodes representing the candidate correspondences between the two original graphs. It then constructs an affinity matrix based on the local and global distance information between the original graphs’ nodes. Each element of the matrix represents the mutual consistency of a pair of nodes of the association graph. After simulating random walks on the association graph, a stable quasi-stationary distribution is obtained. With the Hungarian algorithm, our method finally discretizes the distribution to achieve an approximate matching between the two original graphs. Experiments on two commonly used datasets demonstrate the effectiveness of our method on graph matching.

Citation Download Citation

Zhaoning Yin, Chunyu Zhao, Dongmei Niu, and Xiuyang Zhao "A novel graph matching method based on the local and global distance information of the graph nodes", Proc. SPIE 11526, Fifth International Workshop on Pattern Recognition, 1152603 (24 June 2020); https://doi.org/10.1117/12.2574410

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available