Kang Chuanli, Geng Chongming, Lin Zitao, Zhang Sai, Zhang Siyao, Wang Shiwei
College of Geomatics and Geoinformation, Guilin University of Technology, Guilin 541004, China.
Key Laboratory of Spatial Information and Geomatics, Guilin University of Technology, Guilin 541004, China.
Sensors (Basel). 2024 Mar 14;24(6):1853. doi: 10.3390/s24061853.
Existing point-to-point registration methods often suffer from inaccuracies caused by erroneous matches and noisy correspondences, leading to significant decreases in registration accuracy and efficiency. To address these challenges, this paper presents a new coarse registration method based on a geometric constraint and a matrix evaluation. Compared to traditional registration methods that require a minimum of three correspondences to complete the registration, the proposed method only requires two correspondences to generate a transformation matrix. Additionally, by using geometric constraints to select out high-quality correspondences and evaluating the matrix, we greatly increase the likelihood of finding the optimal result. In the proposed method, we first employ a combination of descriptors and keypoint detection techniques to generate initial correspondences. Next, we utilize the nearest neighbor similarity ratio (NNSR) to select high-quality correspondences. Subsequently, we evaluate the quality of these correspondences using rigidity constraints and salient points' distance constraints, favoring higher-scoring correspondences. For each selected correspondence pair, we compute the rotation and translation matrix based on their centroids and local reference frames. With the transformation matrices of the source and target point clouds known, we deduce the transformation matrix of the source point cloud in reverse. To identify the best-transformed point cloud, we propose an evaluation method based on the overlap ratio and inliers points. Through parameter experiments, we investigate the performance of the proposed method under various parameter settings. By conducting comparative experiments, we verified that the proposed method's geometric constraints, evaluation methods, and transformation matrix computation consistently outperformed other methods in terms of root mean square error (RMSE) values. Additionally, we validated that our chosen combination for generating initial correspondences outperforms other descriptor and keypoint detection combinations in terms of the registration result accuracy. Furthermore, we compared our method with several feature-matching registration methods, and the results demonstrate the superior accuracy of our approach. Ultimately, by testing the proposed method on various types of point cloud datasets, we convincingly established its effectiveness. Based on the evaluation and selection of correspondences and the registration result's quality, our proposed method offers a solution with fewer iterations and higher accuracy.
现有的点对点配准方法常常因错误匹配和噪声对应而产生不准确的情况,导致配准精度和效率显著下降。为应对这些挑战,本文提出了一种基于几何约束和矩阵评估的新的粗配准方法。与传统配准方法相比,传统方法至少需要三个对应点才能完成配准,而本文提出的方法仅需两个对应点就能生成变换矩阵。此外,通过使用几何约束来筛选出高质量对应点并评估矩阵,我们极大地提高了找到最优结果的可能性。在所提出的方法中,我们首先采用描述符和关键点检测技术的组合来生成初始对应点。接下来,我们利用最近邻相似比(NNSR)来选择高质量对应点。随后,我们使用刚性约束和显著点距离约束来评估这些对应点的质量,更倾向于得分较高的对应点。对于每一对选定的对应点,我们基于它们的质心和局部参考系计算旋转和平移矩阵。已知源点云和目标点云的变换矩阵后,我们反向推导出源点云的变换矩阵。为了识别最佳变换后的点云,我们提出了一种基于重叠率和内点的评估方法。通过参数实验,我们研究了所提出方法在各种参数设置下的性能。通过进行对比实验,我们验证了所提出方法的几何约束、评估方法和变换矩阵计算在均方根误差(RMSE)值方面始终优于其他方法。此外,我们验证了我们选择的用于生成初始对应点的组合在配准结果准确性方面优于其他描述符和关键点检测组合。此外,我们将我们的方法与几种特征匹配配准方法进行了比较,结果证明了我们方法的卓越准确性。最终,通过在各种类型的点云数据集上测试所提出的方法,我们令人信服地证明了其有效性。基于对应点的评估和选择以及配准结果的质量,我们提出的方法提供了一种迭代次数更少且精度更高的解决方案。