A Reduction Method of Three-Dimensional Point Cloud

Weiwei Song, S. Cai, Bo Yang, W. Cui, Yanfang Wang
{"title":"A Reduction Method of Three-Dimensional Point Cloud","authors":"Weiwei Song, S. Cai, Bo Yang, W. Cui, Yanfang Wang","doi":"10.1109/BMEI.2009.5305186","DOIUrl":null,"url":null,"abstract":"Recently, non-contact measurement technology has improved significantly. With the increasing of the accuracy and the speed of data acquisition of 3D laser scanners, the amount of point data has increased dramatically . 3D laser scanners generate up to thousands of points per second, which have become a burden of both computation and store of the data. It is quite important, therefore, to reduce the amount of acquire point data and convert them into formats required by reconstruction processes while maintaining the accuracy. In this paper, we presented a convenient way to solve the problem. The scattered point cloud data is first regularized and compressed by the octree structure and then reduced further according to a curvature rule. Compared with the other reduction methods, the method presented in this paper not only reduced the arithmetic complication on space and time , but also preserved the characteristic of the original object and finished the data reduction quickly. This paper presents a novel approach of point cloud reduction based on octree structure and curvature rule. The proposed method not only reduces the amount of point data and computational complexity but also makes the point cloud data be organized, which makes it easy to be traversed and searched in reconstruction process. The proposed methods are applied to different types of surfaces and the results are discussed.","PeriodicalId":6389,"journal":{"name":"2009 2nd International Conference on Biomedical Engineering and Informatics","volume":"22 1","pages":"1-4"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 2nd International Conference on Biomedical Engineering and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BMEI.2009.5305186","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Recently, non-contact measurement technology has improved significantly. With the increasing of the accuracy and the speed of data acquisition of 3D laser scanners, the amount of point data has increased dramatically . 3D laser scanners generate up to thousands of points per second, which have become a burden of both computation and store of the data. It is quite important, therefore, to reduce the amount of acquire point data and convert them into formats required by reconstruction processes while maintaining the accuracy. In this paper, we presented a convenient way to solve the problem. The scattered point cloud data is first regularized and compressed by the octree structure and then reduced further according to a curvature rule. Compared with the other reduction methods, the method presented in this paper not only reduced the arithmetic complication on space and time , but also preserved the characteristic of the original object and finished the data reduction quickly. This paper presents a novel approach of point cloud reduction based on octree structure and curvature rule. The proposed method not only reduces the amount of point data and computational complexity but also makes the point cloud data be organized, which makes it easy to be traversed and searched in reconstruction process. The proposed methods are applied to different types of surfaces and the results are discussed.
一种三维点云的约简方法
近年来,非接触式测量技术有了显著的进步。随着三维激光扫描仪数据采集精度的提高和速度的提高,点数据量急剧增加。三维激光扫描仪每秒产生数千个点,这已经成为计算和存储数据的负担。因此,在保证精度的前提下,减少采集点数据的数量,并将其转换为重建过程所需的格式是非常重要的。在本文中,我们提出了一种简便的解决方法。首先对分散的点云数据进行八叉树结构的正则化和压缩,然后根据曲率规则进行进一步的约简。与其他约简方法相比,本文提出的方法不仅降低了算法在空间和时间上的复杂度,而且保留了原始目标的特征,快速完成了数据约简。提出了一种基于八叉树结构和曲率规则的点云约简方法。该方法不仅减少了点数据量和计算复杂度,而且使点云数据具有组织性,便于在重建过程中遍历和搜索。将所提出的方法应用于不同类型的表面,并对结果进行了讨论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信