A method for feature matching in images using descriptor structures

A method of feature matching in images using descriptor structures is considered in the work. The descriptors in the developed method can be any known solutions in the field of computer vision. However, inaccuracies can occur when matching image pairs. It is proposed that descriptor structures should be compared to eliminate the "outliers". Descriptor structures are described using graphs. An Umeyama method is used to find matching features using descriptor structures. The method is based on the decomposition of matrices into eigenvalues and eigenvectors for weighted graph matching problems. Thus, matches are based on the descriptor at the initial stage. Two graphs are then constructed for each image based on the resulting sets of mapped features. The weights of the graph are distances between all image features, calculated using the Gauss function. Weight matrices are built for each graph. Matrix decomposition is carried out into eigenvalues and eigenvectors. The resulting matrix is calculated based on the Umeyama method and correct matches are found. Thus, false matches are excluded from the set of matches obtained using descriptors by comparing structures. The method is invariant to zoom and in-plane image rotation. The method leads to correct results only if the number of correct matches is greater than the number of false matches. The complexity of the developed algorithm is proportional to the number of matches found.