Graph Matching

Graph matching refers to the process of finding correspondences between two sets of vertices while preserving complex relational information. Due to the strong object representation capability of graph structures and their robustness to severe deformations and outliers, graph matching has been widely applied to various correspondence problems in the field of computer vision. Theoretically, the graph matching problem could be solved by exhaustively searching the entire solution space, but in practice, this approach is infeasible due to the exponential growth of the solution space with the input data size. Therefore, existing research primarily focuses on solving the graph matching problem through various approximation techniques.