系统仿真学报 ›› 2023, Vol. 35 ›› Issue (5): 979-986.doi: 10.16182/j.issn1004731x.joss.22-0010

• 论文 • 上一篇    下一篇

基于改进的协方差矩阵描述子的点云配准方法

张元1,2,3(), 韩浩宇1,2,3(), 韩燮1,2,3, 付嘉旭1,2,3   

  1. 1.中北大学 计算机科学与技术学院,山西 太原 030051
    2.机器视觉与虚拟现实山西省重点实验室,山西 太原 030051
    3.山西省视觉信息处理及智能机器人工程研究中心,山西 太原 030051
  • 收稿日期:2022-01-06 修回日期:2022-02-28 出版日期:2023-05-30 发布日期:2023-05-22
  • 通讯作者: 韩浩宇 E-mail:zhangyuan@nuc.edu.cn;985811696@qq.com
  • 作者简介:张元(1976-),女,副教授,硕士,研究方向为计算机视觉。E-mail:zhangyuan@nuc.edu.cn
  • 基金资助:
    国家重点研发计划(2018YFB2101504);山西省重点研发计划(201903D121147);山西省自然科学基金(201901D111150)

Point Cloud Registration Method Based on Improved Covariance Matrix Descriptor

Yuan Zhang1,2,3(), Haoyu Han1,2,3(), Xie Han1,2,3, Jiaxu Fu1,2,3   

  1. 1.Computer Science and Technology Department, North University of China, Taiyuan 030051, China
    2.Shanxi Provincial Key Laboratory of Machine Vision and Virtual Reality, Taiyuan 030051, China
    3.Shanxi Province Visual Information Processing and Intelligent Robot Engineering Research Center, Taiyuan 030051, China
  • Received:2022-01-06 Revised:2022-02-28 Online:2023-05-30 Published:2023-05-22
  • Contact: Haoyu Han E-mail:zhangyuan@nuc.edu.cn;985811696@qq.com

摘要:

点云配准是数字化文物保护的关键一环,提高配准精度与抗噪性是文物点云配准的主要目标。针对该问题,提出一种基于协方差矩阵描述子的三维点云配准方法。使用张量投票法剔除噪声点,对剔除噪声后的点云,使用内在形状签名法提取关键点;对提取的关键点构建邻域信息,利用该信息建立协方差矩阵描述子;通过计算最近距离寻找匹配点对,使用法向量夹角对其约束,剔除误匹配点对;选取匹配点对计算变换矩阵完成粗配准,再通过迭代最近点对方法进行精配准。实验结果表明,相比于常用配准算法,本文算法配准精度更高,且适用于低重叠率模型与含噪声模型。

关键词: 点云配准, 协方差矩阵描述子, 关键点, 张量投票, 内在形状签名

Abstract:

Point cloud registration is a key part of the digital protection of cultural relics. Improving registration accuracy and noise resistance is the main goal of point cloud registration for cultural relics. In order to solve this problem, a three-dimensional (3D) point cloud registration method based on a covariance matrix descriptor is proposed. The tensor voting method is used to eliminate the noise points, and the internal shape signature method is used to extract the key points from the point cloud after removing the noise. Then, the neighborhood information is constructed for the extracted key points, and the covariance matrix descriptor is established by using the information. In addition, the matching point pair is found by calculating the nearest distance, and the angle constraint of the normal vector is used to eliminate the wrong matching point pair. The matching point pair is selected, and the transformation matrix is calculated to complete the rough registration. Then the iterative nearest point method is used for the fine registration. Experimental results show that compared with common registration algorithms, the algorithm proposed in this paper has higher registration accuracy and is suitable for models with low overlap rates and noisy models.

Key words: point cloud registration, covariance matrix descriptor, key points, tensor voting, intrinsic shape signature

中图分类号: