Graph matching based on fast normalized cut and multiplicative update mapping

作者：

Highlights：

• A graph matching method based on fast normalized cut and multiplicative update mapping is proposed.

• The discrete constraint is incorporated into the optimization step and the multiplicative update algorithm is utilized in the mapping process.

• Both synthetic points and real-world images comparisons with the state-of-the-art methods validate the effectiveness of the proposed method.

摘要

•A graph matching method based on fast normalized cut and multiplicative update mapping is proposed.•The discrete constraint is incorporated into the optimization step and the multiplicative update algorithm is utilized in the mapping process.•Both synthetic points and real-world images comparisons with the state-of-the-art methods validate the effectiveness of the proposed method.

论文关键词：Graph matching,Fast normalized cut,Discrete constraint,Multiplicative update

论文评审过程：Received 4 December 2020, Revised 6 April 2021, Accepted 6 August 2021, Available online 24 August 2021, Version of Record 4 September 2021.

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