摘要
为了提高迭代最近点(ICP)算法中最邻近点搜索的存储和计算效率,本文通过对盒子结构方法优、缺点的深入分析,提出了基于格网划分的最邻近点搜索方法。该方法充分考虑了3D点云获取时的投影特性,将点云投影到某一坐标平面,并基于格网划分进行存储,使最邻近点的搜索限制在较小的范围。不同类型的模拟数据和实测数据试验均表明,该方法能够在不损失匹配精度和拉入范围的前提下,显著提高存储和计算效率。
In order to improve the storage and computational efficiency of closest points searching of the Iterative Closest Point (ICP) algorithm, by a deep analysis of advantages and disadvantages about the method of boxing structure, a method of closest points searching based on grid partition was proposed in the paper. This method considered the projection characteristic of the 3D points cloud being acquired fully, and projected the points cloud to one of the coordinate planes, and stored the points cloud based on grid parti- tion, then limited the closest points searching in a smaller extent. Both the tests with simulated data of different kinds and real meas- ured data showed that this method could significantly improve the storage and computational efficiency without losing the registration precision and pull-in range.
出处
《测绘科学》
CSCD
北大核心
2012年第5期90-93,共4页
Science of Surveying and Mapping
关键词
3D点云
表面匹配
迭代最近点算法(ICP)
最邻近点搜索
盒子结构
格网划分
3D points cloud
surface registration
Iterative Closest Point (ICP) algorithm
closest points searching
boxingstructure
grid partition