| Probabilistic hypergraph matching based on affinity tensor updating | |
Yang, Xu1; Liu, Zhi-Yong1,2,3 ; Qiao, Hong1,2,3; Su, Jian-Hua1
| |
| 发表期刊 | NEUROCOMPUTING
 |
| 2017-12-20 | |
| 卷号 | 269期号:0页码:142-147 |
| 文章类型 | Article |
| 摘要 | 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. |
| 其他摘要 | 无 |
| 关键词 | Hypergraph Matching Probabilistic Graph Matching Tensor Decomposition Structural Pattern Recognition |
| WOS标题词 | Science & Technology ; Technology |
| DOI | 10.1016/j.neucom.2016.12.096 |
| 关键词[WOS] | REWEIGHTED RANDOM-WALKS ; GRAPH |
| 收录类别 | SCI ; ISTP |
| 语种 | 英语 |
| 项目资助者 | 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研究方向 | Computer Science |
| WOS类目 | Computer Science, Artificial Intelligence |
| WOS记录号 | WOS:000412266000017 |
| 引用统计 | |
| 文献类型 | 期刊论文 |
| 条目标识符 | http://ir.ia.ac.cn/handle/173211/14133 |
| 专题 | 复杂系统管理与控制国家重点实验室_机器人理论与应用 |
| 作者单位 | 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 |
| 推荐引用方式 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. |
| 条目包含的文件 | 下载所有文件 | |||||
| 文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 | ||
| Probabilistic Hyperg（2483KB） | 期刊论文 | 作者接受稿 | 开放获取 | CC BY-NC-SA | 浏览 下载 | |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论