.png){kind=icon}
返回
Hypergraph matching via game-theoretic hypergraph clustering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2022.108526.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Feature matching is used to build correspondences between features in the model and test images. As the extension of graph matching, hypergraph matching is able to encode rich invariance between feature tuples and improve matching accuracy. Different from many existing algorithms based on maximizing the matching score between correspondences, our approach formulates hypergraph matching as a non-cooperative multi-player game and obtains matches by extracting the evolutionary stable strategies (ESS). While this approach generates a high matching accuracy, the number of matches is usually small and it involves a large computation load to obtain more matches. To solve this problem, we extract multiple ESS clusters instead of one single ESS group, thereby transforming hypergraph matching of features to hy-pergraph clustering of candidate matches. By extracting an appropriate number of clusters, we increase the number of matches efficiently, and improve the matching accuracy by imposing the one-to-one con-straint. In experiments with three real datasets, our algorithm is shown to generate a large number of matches efficiently. It also shows significant advantage in matching accuracy in comparison with some other hypergraph matching algorithms. (c) 2022 Elsevier Ltd. All rights reserved.
Keyword:
Feature matching
Hypergraph matching
Game-theoretic
Hypergraph clustering
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Robust feature matching using guided local outlier factor基于引导局部离群因子的鲁棒特征匹配.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
分享收藏
查看更多内容