Point correspondence by a new third order graph matching algorithm
Yang, Xu1; Qiao, Hong1,2,3; Liu, Zhi-Yong1,2,3
AbstractThe correspondence between point sets is a fundamental problem in pattern recognition, which is often formulated and solved by graph matching. In this paper, we propose to solve the correspondence problem by a new third order graph matching algorithm. Compared with some previous hyper-graph matching algorithms, the proposed one achieves considerable memory reduction and is applicable to both undirected and directed graphs. Specifically, the correspondence is formulated by the matching between adjacency tensors encoding the third order structural information of each graph, which is then transformed to be a tractable matrix form. Two types of gradient based optimization methods, the graduated nonconvexity and concavity procedure (GNCCP) and graduated assignment (GA) algorithm, are generalized to solve the problem. Comparative experiments with state-of-the-art algorithms on both synthetic and real data witness the effectiveness of the proposed method.
KeywordGraph Matching Point Correspondence High Order Constraints Adjacency Tensor
WOS HeadingsScience & Technology ; Technology
Indexed BySCI
Funding OrganizationNational Key Research and Development Plan of China(2016YFC0300801) ; National Natural Science Foundation (NSFC) of China(61503383 ; Strategic Priority Research Program of the Chinese Academy of Sciences(XDB02080003) ; 61633009 ; 61375005 ; U1613213 ; 61303174 ; 61210009 ; 61305137)
WOS Research AreaComputer Science ; Engineering
WOS SubjectComputer Science, Artificial Intelligence ; Engineering, Electrical & Electronic
WOS IDWOS:000394197700010
Citation statistics
Cited Times:5[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Affiliation1.Chinese Acad Sci, Inst Automat, State Key Lab Management & Control Complex Syst, Beijing 100190, Peoples R China
2.Chinese Acad Sci, Ctr Excellence Brain Sci & Intelligence Technol, Shanghai 200031, Peoples R China
3.Univ Chinese Acad Sci, Beijing 100049, Peoples R China
Recommended Citation
GB/T 7714
Yang, Xu,Qiao, Hong,Liu, Zhi-Yong. Point correspondence by a new third order graph matching algorithm[J]. PATTERN RECOGNITION,2017,65(0):108-118.
APA Yang, Xu,Qiao, Hong,&Liu, Zhi-Yong.(2017).Point correspondence by a new third order graph matching algorithm.PATTERN RECOGNITION,65(0),108-118.
MLA Yang, Xu,et al."Point correspondence by a new third order graph matching algorithm".PATTERN RECOGNITION 65.0(2017):108-118.
Files in This Item: Download All
File Name/Size DocType Version Access License
Point Correspondence(1539KB)期刊论文作者接受稿开放获取CC BY-NC-SAView Download
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Yang, Xu]'s Articles
[Qiao, Hong]'s Articles
[Liu, Zhi-Yong]'s Articles
Baidu academic
Similar articles in Baidu academic
[Yang, Xu]'s Articles
[Qiao, Hong]'s Articles
[Liu, Zhi-Yong]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Yang, Xu]'s Articles
[Qiao, Hong]'s Articles
[Liu, Zhi-Yong]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: Point Correspondence By A New Third Order Graph Matching Algorithm.pdf
Format: Adobe PDF
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.