.png){kind=icon}
Return
Exploiting multi-layer graph factorization for multi-attributed graph matching
.png){kind=icon}
OA
AI
DOI：10.1016/j.patrec.2018.09.024.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multi-layer graph matching methods effectively solve multi-attributed graph matching problems based on the multi-layer structure adopted to address the ambiguity and uncertainty arisen from the attribute integration. However, despite of its effectiveness for matching multi-attributed graphs, the approach has a long way to apply in the practical environment due to the scalability problem caused by a huge matrix for describing the multi-layer structure. In this paper, we propose a novel multi-layer graph matching algorithm based on the multi-layer graph factorization to address the issue. The main contribution of this research is three-fold. First, we propose a factorization method that decomposes the huge multi-layer matrix into several small matrices for efficiency. Second, we reformulate the original multi-layer matching problem into two relaxed problems by using the factorized matrices. Third, based on the relaxed problems, we propose a multi-layer graph matching algorithm inspired from the convex-concave relaxation procedure. In our extensive experiments on the synthetic and real-image datasets, the proposed method exhibits better performance than state-of-the-art algorithms based on the single-layer structure. (C) 2018 Elsevier B.V. All rights reserved.
Keywords:
Multi-attributed graph matching
Multi-layer structure
Matrix factorization
Path following
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
7.9K
Citations:
1.6W
Organization
No organization information available
Cited Papers
ShareSaveManaging Service Productivity In Sub-saharan African Banks: The Case of Nigerian Knowledge Workers
PREAI
ShareSaveShareSaveShareSaveShareSaveModular DNA-origami-based nanoarrays enhanced cell binding-affinity through “lock-key” interaction.png)
OAAI
IF0
OAAIShareSave
View more