一种距离图像分割的几何方法

Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062) Pub Date : 1999-10-04 DOI:10.1109/IM.1999.805356

M. Bock, C. Guerra

{"title":"一种距离图像分割的几何方法","authors":"M. Bock, C. Guerra","doi":"10.1109/IM.1999.805356","DOIUrl":null,"url":null,"abstract":"We present a novel geometric approach to extract planes from sets of 3D points. For a set with n points the algorithm has an O(n/sup 3/ log n) time complexity. We also discuss an implementation of the algorithm for range image segmentation. The performance of the new range image segmentation algorithm is compared to other existing methods.","PeriodicalId":110347,"journal":{"name":"Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"A geometric approach to the segmentation of range images\",\"authors\":\"M. Bock, C. Guerra\",\"doi\":\"10.1109/IM.1999.805356\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a novel geometric approach to extract planes from sets of 3D points. For a set with n points the algorithm has an O(n/sup 3/ log n) time complexity. We also discuss an implementation of the algorithm for range image segmentation. The performance of the new range image segmentation algorithm is compared to other existing methods.\",\"PeriodicalId\":110347,\"journal\":{\"name\":\"Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062)\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IM.1999.805356\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IM.1999.805356","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

提出了一种从三维点集合中提取平面的几何方法。对于有n个点的集合，算法的时间复杂度为O(n/sup 3/ log n)。我们还讨论了距离图像分割算法的实现。并与现有的距离图像分割方法进行了性能比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A geometric approach to the segmentation of range images

We present a novel geometric approach to extract planes from sets of 3D points. For a set with n points the algorithm has an O(n/sup 3/ log n) time complexity. We also discuss an implementation of the algorithm for range image segmentation. The performance of the new range image segmentation algorithm is compared to other existing methods.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062)

自引率

0.00%

发文量