Graph matching algorithm in position and orientation estimation tasks

An algorithm for the graph matching is presented. The steps of finding compliance with the expectation ratio are described. The degree of difference of edges is calculated. The way to find the similarity of vertices using the Euclidean distance is described. The algorithm is implemented and experimentally tested for performance.