Game-theoretic hypergraph matching with density enhancement

作者：

Highlights：

• We present a game-theoretic hypergraph matching algorithm with a high matching accuracy.

• We present a density based enhancement to increase the number of matches.

• We show that the computation load can be reduced evidently with little influence on the number of matches and matching accuracy.

• Experiments with synthetic and real datasets are conducted to validate the effectiveness of the proposed algorithm.

摘要

•We present a game-theoretic hypergraph matching algorithm with a high matching accuracy.•We present a density based enhancement to increase the number of matches.•We show that the computation load can be reduced evidently with little influence on the number of matches and matching accuracy.•Experiments with synthetic and real datasets are conducted to validate the effectiveness of the proposed algorithm.

论文关键词：Feature matching,Hypergraph matching,Game-theoretic,Density enhancement

论文评审过程：Received 14 March 2022, Revised 18 August 2022, Accepted 6 September 2022, Available online 9 September 2022, Version of Record 22 September 2022.

论文官网地址：https://doi.org/10.1016/j.patcog.2022.109035