首页 | 官方网站   微博 | 高级检索  
     

基于GPU的实时三维点云数据配准研究
引用本文:荆锐,赵旦谱,台宪青. 基于GPU的实时三维点云数据配准研究[J]. 计算机工程, 2012, 38(23): 198-202
作者姓名:荆锐  赵旦谱  台宪青
作者单位:1. 中国科学院自动化研究所,北京100190;中国科学院研究生院信息科学与工程学院,北京100080
2. 中国科学院自动化研究所,北京,100190
摘    要:在三维重建中,不同摄像机坐标系下点云配准耗时过多。为此,提出一种基于图形处理单元(GPU)的实时三维点云数据配准算法。利用投影映射法获取匹配点对,使用点到切平面距离最小化方法计算变换矩阵,通过GPU多线程并行处理大规模图像数据。实验结果表明,对于分别包含307 200个数据的2帧点云,在保持原有配准效果的基础上,该算法的最优耗时仅为基于CPU的最近邻迭代算法的11.9%。

关 键 词:图形处理单元  3D重建  摄像机跟踪  同时定位与地图构建  并行处理
收稿时间:2012-03-02

Research on Real-time 3D Point Cloud Data Registration Based on GPU
JING Rui , ZHAO Dan-pu , TAI Xian-qing. Research on Real-time 3D Point Cloud Data Registration Based on GPU[J]. Computer Engineering, 2012, 38(23): 198-202
Authors:JING Rui    ZHAO Dan-pu    TAI Xian-qing
Affiliation:(1. Institute of Automation, Chinese Academy of Sciences, Beijing 100190, China; 2. School of Information Science and Engineering, Graduate University of Chinese Academy of Sciences, Beijing 100080, China)
Abstract:In 3D reconstruction, point cloud registration time of different camera coordinate system is too long. In order to sovle this problem, this paper proposes a real-time 3D point cloud data registration algorithm based on Graphic Processing Unit(GPU). The projection mapping method is used to find corresponding point pairs, the transformation matrix is obtained by minimizing the distance from the point to the tangent plane, and uses the GPU to multi-thread and parallelly process mass image data. Experimental results show that, in order to keep original registration effect, the optimal time-consuming of this algorithm is about 11.9% compared with Iterative Closest Point algorithm based on GPU(ICP-GPU) in containing 307 200 data 2 frame point cloud.
Keywords:Graphic Processing Unit(GPU)  3D reconstruction  camera tracking  Simultaneous Localization and Map Building(SLAM)  parallel processing
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号