Abstract
In this research, we use hash match of invariants under fixed pair length and local compatibility check of positions or normal vectors to improve the efficiency of two-point normal set (2PNS) point cloud registration algorithm. On the one hand, we use the key value formed by the invariants of base point pairs of fixed length to construct and retrieve the hash table to realize the matching of base point pairs in the two point clouds to be registered to speed up the extraction of candidate transformation matrices. On the other hand, the time consumed in the verification phase is reduced by checking the compatibility between the positions or normal vectors of the corresponding points in the specific areas of the two point clouds under the transformation from the candidate matrix. Through these two improvements, the algorithm significantly reduces the time spent in the point cloud registration algorithm.