On-line data registration in OUTDOOR environment

J. Będkowski, A. Maslowski
{"title":"On-line data registration in OUTDOOR environment","authors":"J. Będkowski, A. Maslowski","doi":"10.1109/MMAR.2011.6031356","DOIUrl":null,"url":null,"abstract":"In the paper an algorithm of 3D data registration based on CUDA implementation is shown. The research is related to the problem of collecting 3D data with laser measurement system mounted on rotated head, to be used in mobile robot applications. Assumed performance of data registration algorithm is achieved, therefore it can used as On-line. The ICP (Iterative Closest Point) approach is chosen as registration method. Computation is based on massively parallel architecture of NVIDIA CUDA. The presented concept of 3D data matching is based on parallel computation used for fast nearest neighbor search. Nearest neighbor search procedure is using 3D space decomposition into cubic buckets, therefore the time of matching is deterministic.","PeriodicalId":440376,"journal":{"name":"2011 16th International Conference on Methods & Models in Automation & Robotics","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 16th International Conference on Methods & Models in Automation & Robotics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMAR.2011.6031356","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In the paper an algorithm of 3D data registration based on CUDA implementation is shown. The research is related to the problem of collecting 3D data with laser measurement system mounted on rotated head, to be used in mobile robot applications. Assumed performance of data registration algorithm is achieved, therefore it can used as On-line. The ICP (Iterative Closest Point) approach is chosen as registration method. Computation is based on massively parallel architecture of NVIDIA CUDA. The presented concept of 3D data matching is based on parallel computation used for fast nearest neighbor search. Nearest neighbor search procedure is using 3D space decomposition into cubic buckets, therefore the time of matching is deterministic.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
户外环境下的在线数据注册
本文给出了一种基于CUDA实现的三维数据配准算法。针对移动机器人中安装在旋转头部上的激光测量系统的三维数据采集问题进行了研究。假设数据配准算法达到了一定的性能,可以作为联机使用。选择ICP(迭代最近点法)作为配准方法。计算基于NVIDIA CUDA的大规模并行架构。提出了一种基于并行计算的三维数据匹配概念,用于快速最近邻搜索。最近邻搜索方法是将三维空间分解为立方桶,因此匹配时间是确定的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Optimal control via initial conditions of a time delay hyperbolic system Fast and robust biped walking involving arm swing and control of inertia based on Neural network with harmony search optimizer New method of fractional order integrator analog modeling for orders 0.5 and 0.25 A methodology of estimating hybrid black-box - prior knowledge models of an industrial processes An unscented Kalman filter approach to designing GMDH neural networks: Application to the tunnel furnace
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1