.png){kind=icon}
Return
Probabilistic hypergraph matching based on affinity tensor updating
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2016.12.096.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Hypergraph matching
Probabilistic graph matching
Tensor decomposition
Structural pattern recognition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
Cited Papers
ShareSave
ShareSaveManaging Service Productivity In Sub-saharan African Banks: The Case of Nigerian Knowledge Workers
PREAI
ShareSaveShareSaveModular DNA-origami-based nanoarrays enhanced cell binding-affinity through “lock-key” interaction.png)
OAAI
IF0
OAAIShareSave
View more