An improved method for segmentation of point cloud using Minimum Spanning Tree

M. Geetha, R. Rakendu
{"title":"An improved method for segmentation of point cloud using Minimum Spanning Tree","authors":"M. Geetha, R. Rakendu","doi":"10.1109/ICCSP.2014.6949960","DOIUrl":null,"url":null,"abstract":"With the development of low-cost 3D sensing hardware such as the Kinect, three dimensional digital images have become popular in medical diagnosis, robotics etc. One of the difficult task in image processing is image segmentation. The problem become simpler if we add the depth channel along with height and width. The proposed algorithm uses Minimum Spanning Tree (MST) for the segmentation of point cloud. As a pre processing step, first level clustering is done which gives group of cluttered objects. Each of this cluttered group is subjected to more finite level of segmentation using MST based on distance and normal. In our method, we build a weighted planar graph of each of the clustered cloud and construct the MST of the corresponding graph. By taking the advantage of normal, we can separate the surface from the object. The proposed method is applied to different 3D scenes and the results are discussed.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Communication and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSP.2014.6949960","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

With the development of low-cost 3D sensing hardware such as the Kinect, three dimensional digital images have become popular in medical diagnosis, robotics etc. One of the difficult task in image processing is image segmentation. The problem become simpler if we add the depth channel along with height and width. The proposed algorithm uses Minimum Spanning Tree (MST) for the segmentation of point cloud. As a pre processing step, first level clustering is done which gives group of cluttered objects. Each of this cluttered group is subjected to more finite level of segmentation using MST based on distance and normal. In our method, we build a weighted planar graph of each of the clustered cloud and construct the MST of the corresponding graph. By taking the advantage of normal, we can separate the surface from the object. The proposed method is applied to different 3D scenes and the results are discussed.
一种改进的最小生成树点云分割方法
随着Kinect等低成本3D传感硬件的发展,三维数字图像在医疗诊断、机器人等领域得到了广泛应用。图像分割是图像处理的难点之一。如果我们将深度通道与高度和宽度一起添加,问题就会变得简单。该算法采用最小生成树(MST)对点云进行分割。作为预处理步骤,首先进行一级聚类,得到一组杂乱的对象。使用基于距离和法线的MST对每个杂乱组进行更有限的分割。在我们的方法中,我们建立了每个聚类云的加权平面图,并构造了相应图的MST。利用法线的优势,我们可以把表面和物体分开。将该方法应用于不同的三维场景,并对结果进行了讨论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信