地球信息科学学报

地球信息科学学报 ›› 2018, Vol. 20 ›› Issue (4): 430-439.doi: 10.12082/dqxxkx.2018.170493

• 全国激光雷达大会特约稿件 • 上一篇    下一篇

基于虚拟特征点的三维激光点云粗配准算法

李鹏1,2(), 邢帅1,2, 李瑾3, 何华1, 王丹菂1,2, 李鹏程1,2   

  1. 1. 信息工程大学地理空间信息学院,郑州 450001
    2. 地理信息工程国家重点实验室,西安 710054
    3. 兰州交通大学博文学院,兰州 730010
  • 收稿日期:2017-10-30 修回日期:2018-01-27 出版日期:2018-04-20 发布日期:2018-04-20
  • 作者简介:

    作者简介：李 鹏(1988-),男,硕士,主要从事摄影测量与遥感应用研究。E-mail: peng_li6789@163.com

  • 基金资助:
    国家自然科学基金项目(41371436);基于LDA模型的机载LiDAR多特征地物提取(SKLGIE2016-M-3-1);信息工程大学优秀青年基金项目（2016610902）

A Three-dimensional Laser Point Cloud Rough Registration Algorithm Based on Virtual Feature Points

LI Peng1,2,*(), XIN Shuai1,2, LI Jin3, HE Hua1, WANG Dandi1,2, LI Pengcheng1,2   

  1. 1. Institute of Surveying and Mapping, Information Engineering University, Zhengzhou 450001, China
    2. State Key Laboratory of Geo-information Engineering, Xi′an 710054, China;
    3. Lanzhou jiaotong University Bowen College, Lanzhou 730010, China
  • Received:2017-10-30 Revised:2018-01-27 Online:2018-04-20 Published:2018-04-20
  • Contact: LI Peng
  • Supported by:
    National Natural Science Foundation of China, No.41371436;Multi-feature Extraction of Airborne LiDAR Based on LDA Model, No.SKLGIE2006-M-3-1;Information Engineering University Outstanding Youth Fund Project, No.2016610902.

RichHTML

PDF (PC)

赞

被引次数

2 | 2

摘要：

在地面三维激光点云特征提取的过程中,由于三维点云数据采集仪器、采集方法及后期处理等因素影响,依靠传统的基于曲率、法线等几何特征及统计学算法提取出的点云特征数量较多且存在较大误差,若使用其直接作为特征点数据进行点云粗配准,很难提高点云粗配准的精度及速度。因此,本文在对点云数据实际空间分布结构分析的基础上,结合特征点提取算法、法向一致化算法、PCA（Principal Component Analysis）方法及特征点聚类等方法,提出了一种三维激光点云数据虚拟特征点拟合算法。该算法生成的虚拟特征点是由点云实际的特征点拟合得到,或是由位于被测物特征线上的特征点拟合生成的特征线计算得到,该虚拟特征点并不是扫描对象上实际存在的激光反射脚点。通过实验验证,虚拟特征点拟合算法可以较准确地拟合出由于设备及操作方法等原因而未被采集到的建筑物边角点数据,得到的虚拟特征点数据较实际特征点数据具有更少的数据量及更高的精度,使用拟合得到的虚拟特征点可以减少粗配准算法的计算量,提高粗配准算法的计算效率并能获得更精确及可靠的初始配准变换参数。

关键词: 虚拟特征点, 粗配准, 最小二乘, 点云配准, 激光点云

Abstract:

Due to the influence of the 3D point cloud data collection instrument, acquisition method and post-processing, the number of point cloud features extracted from statistical algorithm base on geometric features such as the curvature and normal is quite large and with large errors. Using these features for rough cloud point registration, it is difficult to improve the precision and speed of rough cloud point registration. Since the accurate registration algorithm of point cloud data, such as ICP (Iteration Closest Point), 3D-NDT (3-Dimensional-Normal Distributions Transform) and GMM (Gaussian mixture model), works in a narrow registration range, the proper initial transform parameters are requested to essentially improve the speed and accuracy of the algorithm, otherwise it will cause the exact registration algorithm to fall into local optimum or result in registration failure. By analyzing actual spatial distribution of point cloud data, we find that it is difficult to collect accurate point, line feature and plane features information of point cloud or the accuracy of the collected key features is very low due to collection instruments, acquisition methods and post-processing and other factors. Therefore, combined with the method of feature point extraction, principal component analysis (PCA) and feature point clustering, this paper presents a virtual feature point fitting algorithm. Based on the commonly used feature point extraction algorithm, this algorithm uses segment endpoints of an average of more than 3 lines that are not parallel and the endpoints in the range domain ε1 or adopt the distance weighted calculation to complete the virtual feature points fitting. Another way is to use the feature points to fit lines by the least squares method, and then according to the principle of the smallest two norms, 3 or more non-parallel lines whose distance each other is less than ε2 is used to fit the virtual feature points whose distance to those lines is shortest. The virtual point feature generated by the algorithm is calculated from the actual feature points of the point cloud and the feature lines generated by fitting the feature points. It is not the actual laser reflection foot point on the scanned object. Through experimental verification, the virtual feature point algorithm can be more accurate to fit the corner point data of building which cannot be collected due to equipment and operating methods and other reasons. The virtual point feature data obtained by the algorithm is 64.71% less than the actual feature point data amount, the computing speed increased by 41.90%, and accuracy was improved by an order of magnitude. Using the fitted virtual feature points can reduce the amount of data involved in the coarse registration algorithm, improve the computational efficiency of the coarse registration algorithm and obtain more accurate and reliable initial transformation parameters.

Key words: virtual feature points, rough registration, least squares, point cloud registration, laser point cloud