Multi-view matching points extraction algorithm based on union find sets

Abstract

The extraction of multi-view matching points is one of the key elements in 3D reconstruction of multi-view image scene, because the extraction results will directly affect the accuracy of 3D reconstruction. With the conversion from the extraction of multi-view matching points to dynamic connectivity, a solution based on the Union Find algorithm was designed. The efficient tree structure with parent-link was used to organize the nodes in the Union Find sets, so that it was only needed to modify the addressing parameter of a single node in each process of adding the matching points pair, which avoided the computational process of the traversal array to compare with addressing parameter and improved the efficiency to find and modify. At the same time, the weighted method was applied to optimize the algorithm and the weighted encoding method was used to replace the commonly used hard encoding, which can balance the dendrogram structure and reduce the average depth of nodes in the tree. Experimental results of multiple groups of image sets showed that, compared with the traditional breadth-first search algorithm, the algorithm based on Union Find had higher reliability and computational efficiency.