Probabilistic hypergraph matching based on affinity tensor updating
Yang, Xu1; Liu, Zhi-Yong1,2,3; Qiao, Hong1,2,3; Su, Jian-Hua1
Source PublicationNEUROCOMPUTING
AbstractGraph matching is a fundamental problem in artificial intelligence and structural data processing. Hypergraph matching has recently become popular in the graph matching community. Existing hypergraph matching algorithms usually resort to the continuous methods, while the combinatorial nature of hypergraph matching is not well considered. Therefore in this paper, we propose a novel hypergraph matching algorithm by introducing the affinity tensor updating based graduated projection. Specifically, the hypergraph matching problem is first formulated as a combinatorial optimization problem in a high order polynomial form. Then this NP-hard problem is relaxed and interpreted in a probabilistic manner, which is approximately solved by iterative techniques. The updating of the affinity tensor is performed in each iteration, besides the updating of probabilistic assignment vector. Experimental results on both synthetic and real-world datasets witness the effectiveness of the proposed method. (C) 2017 Elsevier B.V. All rights reserved.
Other Abstract
KeywordHypergraph Matching Probabilistic Graph Matching Tensor Decomposition Structural Pattern Recognition
WOS HeadingsScience & Technology ; Technology
Indexed BySCI ; ISTP
Funding OrganizationNational Key Research and Development Plan of China(2016YFC0300801) ; National Natural Science Foundation of China (NSFC)(61503383 ; Strategic Priority Research Program of the Chinese Academy of Sciences(XDB02080003) ; Beijing Natural Science Foundation(4154087) ; 61633009 ; U1613213 ; 61375005 ; 61210009 ; 61502494)
WOS Research AreaComputer Science
WOS SubjectComputer Science, Artificial Intelligence
WOS IDWOS:000412266000017
Citation statistics
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,Liu, Zhi-Yong,Qiao, Hong,et al. Probabilistic hypergraph matching based on affinity tensor updating[J]. NEUROCOMPUTING,2017,269(0):142-147.
APA Yang, Xu,Liu, Zhi-Yong,Qiao, Hong,&Su, Jian-Hua.(2017).Probabilistic hypergraph matching based on affinity tensor updating.NEUROCOMPUTING,269(0),142-147.
MLA Yang, Xu,et al."Probabilistic hypergraph matching based on affinity tensor updating".NEUROCOMPUTING 269.0(2017):142-147.
Files in This Item: Download All
File Name/Size DocType Version Access License
Probabilistic Hyperg(2483KB)期刊论文作者接受稿开放获取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
[Liu, Zhi-Yong]'s Articles
[Qiao, Hong]'s Articles
Baidu academic
Similar articles in Baidu academic
[Yang, Xu]'s Articles
[Liu, Zhi-Yong]'s Articles
[Qiao, Hong]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Yang, Xu]'s Articles
[Liu, Zhi-Yong]'s Articles
[Qiao, Hong]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: Probabilistic Hypergraph Matching Based on Affinity Tensor Updating.pdf
Format: Adobe PDF
All comments (0)
No comment.

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