| Probabilistic hypergraph matching based on affinity tensor updating | |
Yang, Xu1 ; Liu, Zhi-Yong1,2,3; Qiao, Hong1,2,3; Su, Jian-Hua1
| |
| Source Publication | NEUROCOMPUTING
 |
| 2017-12-20 | |
| Volume | 269Issue:0Pages:142-147 |
| Subtype | Article |
| Abstract | Graph 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 | 无 |
| Keyword | Hypergraph Matching Probabilistic Graph Matching Tensor Decomposition Structural Pattern Recognition |
| WOS Headings | Science & Technology ; Technology |
| DOI | 10.1016/j.neucom.2016.12.096 |
| WOS Keyword | REWEIGHTED RANDOM-WALKS ; GRAPH |
| Indexed By | SCI ; ISTP |
| Language | 英语 |
| Funding Organization | National 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 Area | Computer Science |
| WOS Subject | Computer Science, Artificial Intelligence |
| WOS ID | WOS:000412266000017 |
| Citation statistics | |
| Document Type | 期刊论文 |
| Identifier | http://ir.ia.ac.cn/handle/173211/14133 |
| Collection | 复杂系统管理与控制国家重点实验室_机器人理论与应用 |
| Affiliation | 1.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-SA | View Download | |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment