Towards affine-invariant graph matching: A directed graph based method.

Graph matching is an important problem in computer vision and pattern recognition. This paper proposes a graph matching algorithm based on a directed graph structure model. Firstly, the point set is divided into two parts by using the line between two points, and the direction information between the two points is specified according to the number of points on both sides of the line. Secondly, the ratio between the number of points on both sides of the line and the total number of points is used to define the adjacency matrix. Finally, the matching matrix is solved by the convex-concave relaxation procedure method to complete the matching. The invariance of the directed graph model under affine transformation is proved. The experimental results show that the directed graph model constructed can effectively and accurately describe the structure information between feature points and the matching method as well as has a high performance. [ABSTRACT FROM AUTHOR]