基于几何与尺度约束增强的RANSAC点云配准算法

POINT CLOUD REGISTRATION ALGORITHM BASED ON GEOMETRIC CONSTRAINT OPTIMIZATION AND SCALE CONSISTENCY ENHANCEMENT OF RANSAC

  • 摘要: 针对传统粗配准方法难以满足三维重建中的高精度点云配准需求,提出一种几何约束优化与尺度一致性增强的RANSAC算法。采用ISS与SHOT算法寻找特征点对,通过判断点对之间的几何约束以剔除外点,提高粗配准的速度和精度。此外,针对传统算法无法处理尺度不一致的点云配准问题,通过引入Umeyama算法结合点云尺度信息计算配准矩阵,并引入GICP算法进一步提升配准精度。经过实验证明,此算法在不同角度点云模型的配准任务上具有明显优势,并有效解决点云尺度不一致问题。

     

    Abstract: Addressing the challenge of achieving high-precision point cloud registration in 3D reconstruction using traditional coarse registration methods, this paper proposes a RANSAC algorithm enhanced through geometric constraint optimization and scale consistency. The proposed approach employed ISS and SHOT algorithms to identify feature point pairs, leveraging geometric constraint assessment between point pairs to eliminate outliers and enhance speed and accuracy of coarse registration. Furthermore, in response to the incapability of conventional methods to handle scale inconsistency in point clouds, the Umeyama algorithm was incorporated to calculate registration matrices by considering point cloud scale information, and the GICP algorithm was introduced to further enhance registration precision. Experimental results demonstrate that this algorithm has obvious advantages in registration tasks of point cloud models from various angles and effectively solves the problem of inconsistent point cloud scale.

     

/

返回文章
返回