激光与光电子学进展, 2016, 53 (5): 051202, 网络出版: 2016-05-05   

一种聚类改进的迭代最近点配准算法

An Improved Iterative Closest Point Algorithm Using Clustering
作者单位
中国矿业大学环境与测绘学院, 江苏 徐州 221116
摘要
为了满足高精度的室内位置服务需求,提出了一种利用K-means聚类改进的迭代最近点(ICP)算法来构建结构化的二维室内地图。通过对二维激光扫描仪获取的点云数据的聚类分析,将每一帧的数据进行聚类,并通过几何中心的平移对点云数据进行预配准,利用聚类及预配准的结果对点云数据进行精确配准得到全局最优解。聚类改进的ICP算法相比于传统的ICP算法,在仅使用单一的二维激光扫描仪采集的点云数据为数据源时,能获得较高精度的配准结果。实验表明,该算法具有适用性强、配准精度高等优点,有助于在单一传感器下快速、精准地构建室内地图。
Abstract
In order to meet the demand of indoor location service, a new iterative closest point (ICP) algorithm based on K-means clustering is proposed to construct a structured two-dimensional indoor map. Based on the clustering analysis of the point cloud data obtained by the two dimensional laser scanner, the data of each frame is clustered, and the cloud data is pre-registered by the translation of the geometric center. The global optimal solution is obtained by the accuracy registration of the cloud data after clustering and pre-registering. Compared with the traditional ICP algorithm, the improved ICP algorithm can obtain higher accuracy registration results when the point cloud data is collected by a single 2D laser scanner. Experiments show that the algorithm has the advantages of strong robustness and high registration accuracy, which can help to construct the indoor map quickly and accurately under the single sensor.

周文振, 陈国良, 杜珊珊, 李飞. 一种聚类改进的迭代最近点配准算法[J]. 激光与光电子学进展, 2016, 53(5): 051202. Zhou Wenzhen, Chen Guoliang, Du Shanshan, Li Fei. An Improved Iterative Closest Point Algorithm Using Clustering[J]. Laser & Optoelectronics Progress, 2016, 53(5): 051202.

本文已被 7 篇论文引用
被引统计数据来源于中国光学期刊网
引用该论文: TXT   |   EndNote

相关论文

加载中...

关于本站 Cookie 的使用提示

中国光学期刊网使用基于 cookie 的技术来更好地为您提供各项服务,点击此处了解我们的隐私策略。 如您需继续使用本网站,请您授权我们使用本地 cookie 来保存部分信息。
全站搜索
您最值得信赖的光电行业旗舰网络服务平台!