.png){kind=icon}
.png){kind=icon}
Return
Graph matching based on fast normalized cut and multiplicative update mapping
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2021.108228.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Point correspondence is a fundamental problem in pattern recognition and computer vision, which can be tackled by graph matching. Since graph matching is basically an NP-complete problem, some approximate methods are proposed to solve it. Continuous relaxation offers an effective approximate method for graph matching problem. However, the discrete constraint is not taken into consideration in the optimization step. In this paper, a fast normalized cut based graph matching method is proposed, where the discrete constraint is introduced into the optimization step. Specifically, first a semidefinite positive affinity matrix based form objective function is constructed by introducing a regularization term which is related to the discrete constraint. Then the fast normalized cut algorithm is utilized to find the continuous solution. Last, the discrete solution of graph matching is obtained by a multiplicative update algorithm. Experiments on both synthetic points and real-world images validate the effectiveness of the proposed method by comparing it with the state-of-the-art methods. 0 2021 Elsevier Ltd. All rights reserved.
Keywords:
Graph matching
Fast normalized cut
Discrete constraint
Multiplicative update
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W