.png){kind=icon}
返回
Consistent multiple graph matching with multi-layer random walks synchronization
.png){kind=icon}
OA
AI
DOI：10.1016/j.patrec.2018.09.018.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We address the correspondence search problem among multiple graphs with complex properties while considering the matching consistency. We describe each pair of graphs by combining multiple attributes, then jointly match them in a unified framework. The main contribution of this paper is twofold. First, we formulate the global correspondence search problem of multi-attributed graphs by utilizing a set of multi-layer structures. The proposed formulation describes each pair of graphs as a multi-layer structure, and jointly considers whole matching pairs. Second, we propose a robust multiple graph matching method based on the multi-layer random walks framework. The proposed framework synchronizes movements of random walkers, and leads them to consistent matching candidates. In our extensive experiments, the proposed method exhibits robust and accurate performance over the state-of-the-art multiple graph matching algorithms. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
ASSIGNMENT
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Managing Service Productivity In Sub-saharan African Banks: The Case of Nigerian Knowledge Workers
PREAI
分享收藏Particle swarm approach to the optimisation of trenched cantilever‐based MEMS piezoelectric energy harvesters基于悬臂的MEMS压电能量采集器优化的粒子群方法OAAI
OAAI分享收藏
查看更多内容