4.7 Article

Geometrical Segmentation of Multi-Shape Point Clouds Based on Adaptive Shape Prediction and Hybrid Voting RANSAC

期刊

REMOTE SENSING
卷 14, 期 9, 页码 -

出版社

MDPI
DOI: 10.3390/rs14092024

关键词

point cloud; segmentation; RANSAC; point voxel; adaptive threshold; building reconstruction

资金

  1. National Natural Science Foundation of China [41901408, 41871291, 41871314]
  2. Open Fund of Key Laboratory of Urban Land Resources Monitoring and Simulation, Ministry of Natural Resources [KF2021-06-015]
  3. Sichuan Science and Technology Program [2020YJ0010]
  4. Open Innovative Fund of Marine Environment Guarantee [HHB002]
  5. Fundamental Research Funds for the Central Universities [2682021CX062]

向作者/读者索取更多资源

This work proposes a robust geometrical segmentation algorithm for detecting inherent shapes from dense point clouds. The algorithm divides the points into voxels based on connectivity and normal consistency, classifies the voxels into different shapes, and extracts multiple shapes including spheres, cylinders, and cones. A hybrid voting RANSAC algorithm is then used to separate the point clouds into corresponding segments. The proposed method also considers point-shape distance, normal difference, and voxel size as weight terms for evaluating the proposed shape. Graph-cut-based optimization is adopted to handle competition among different segments. Experimental results show that the proposed method achieves reliable segmentation results and outperforms benchmark methods.
This work proposes the use of a robust geometrical segmentation algorithm to detect inherent shapes from dense point clouds. The points are first divided into voxels based on their connectivity and normal consistency. Then, the voxels are classified into different types of shapes through a multi-scale prediction algorithm and multiple shapes including spheres, cylinders, and cones are extracted. Next, a hybrid voting RANSAC algorithm is adopted to separate the point clouds into corresponding segments. The point-shape distance, normal difference, and voxel size are all considered as weight terms when evaluating the proposed shape. Robust voxels are weighted as a whole to ensure efficiency, while single points are considered to achieve the best performance in the disputed region. Finally, graph-cut-based optimization is adopted to deal with the competition among different segments. Experimental results and comparisons indicate that the proposed method can generate reliable segmentation results and provide the best performance compared to the benchmark methods.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据