快速简化与尖锐的特征保留三维点云

H. Benhabiles, O. Aubreton, H. Barki, Hedi Tabia
{"title":"快速简化与尖锐的特征保留三维点云","authors":"H. Benhabiles, O. Aubreton, H. Barki, Hedi Tabia","doi":"10.1109/ISPS.2013.6581492","DOIUrl":null,"url":null,"abstract":"This paper presents a fast point cloud simplification method that allows to preserve sharp edge points. The method is based on the combination of both clustering and coarse-to-fine simplification approaches. It consists to firstly create a coarse cloud using a clustering algorithm. Then each point of the resulting coarse cloud is assigned a weight that quantifies its importance, and allows to classify it into a sharp point or a simple point. Finally, both kinds of points are used to refine the coarse cloud and thus create a new simplified cloud characterized by high density of points in sharp regions and low density in flat regions. Experiments show that our algorithm is much faster than the last proposed simplification algorithm [1] which deals with sharp edge points preserving, and still produces similar results.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"Fast simplification with sharp feature preserving for 3D point clouds\",\"authors\":\"H. Benhabiles, O. Aubreton, H. Barki, Hedi Tabia\",\"doi\":\"10.1109/ISPS.2013.6581492\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a fast point cloud simplification method that allows to preserve sharp edge points. The method is based on the combination of both clustering and coarse-to-fine simplification approaches. It consists to firstly create a coarse cloud using a clustering algorithm. Then each point of the resulting coarse cloud is assigned a weight that quantifies its importance, and allows to classify it into a sharp point or a simple point. Finally, both kinds of points are used to refine the coarse cloud and thus create a new simplified cloud characterized by high density of points in sharp regions and low density in flat regions. Experiments show that our algorithm is much faster than the last proposed simplification algorithm [1] which deals with sharp edge points preserving, and still produces similar results.\",\"PeriodicalId\":222438,\"journal\":{\"name\":\"2013 11th International Symposium on Programming and Systems (ISPS)\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-04-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 11th International Symposium on Programming and Systems (ISPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPS.2013.6581492\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 11th International Symposium on Programming and Systems (ISPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPS.2013.6581492","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28

摘要

本文提出了一种快速的点云简化方法,可以保留尖锐的边缘点。该方法结合了聚类和粗精简化两种方法。它包括首先使用聚类算法创建粗云。然后,生成的粗云的每个点都被赋予一个量化其重要性的权重,并允许将其分类为尖锐点或简单点。最后,利用这两种点对粗云进行细化,从而形成一个新的简化云,其特征是尖锐区域的点密度高,平坦区域的点密度低。实验表明,我们的算法比最后提出的简化算法[1]要快得多,并且仍然产生相似的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fast simplification with sharp feature preserving for 3D point clouds
This paper presents a fast point cloud simplification method that allows to preserve sharp edge points. The method is based on the combination of both clustering and coarse-to-fine simplification approaches. It consists to firstly create a coarse cloud using a clustering algorithm. Then each point of the resulting coarse cloud is assigned a weight that quantifies its importance, and allows to classify it into a sharp point or a simple point. Finally, both kinds of points are used to refine the coarse cloud and thus create a new simplified cloud characterized by high density of points in sharp regions and low density in flat regions. Experiments show that our algorithm is much faster than the last proposed simplification algorithm [1] which deals with sharp edge points preserving, and still produces similar results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信