An Improved RANSAC Algorithm for Point Cloud Segmentation of Complex Building Roofs

被引:0
|
作者
Liu Y. [1 ]
Li Y. [1 ]
Liu H. [1 ]
Sun D. [2 ]
Zhao S. [1 ]
机构
[1] School of Surveying and Land Information Engineering, Henan Polytechnic University, Jiaozuo
[2] Port area branch of Taicang natural resources and Planning Bureau, Jiangsu Province, Taicang
基金
中国博士后科学基金; 中国国家自然科学基金;
关键词
Airborne LiDAR; Judging the point of misclassification; Patch optimization; Point cloud redistribution; RANSAC algorithm; Roof point cloud; Roof point cloud segmentation; Seed selection;
D O I
10.12082/dqxxkx.2021.200742
中图分类号
学科分类号
摘要
Roof model reconstruction affects the quality of building complete model reconstruction, and the segmentation quality of roof point cloud is of great significance for roof model reconstruction. Aiming at the problems of wrong segmentation and over segmentation in the traditional RANSAC algorithm, this paper proposes an improved RANSAC algorithm to redistribute the point cloud, considering the location information of the point cloud. The algorithm eliminates the non planar points temporarily, and selects three points from the planar points set as the initial samples in the way of R radius neighborhood to fit them. The distance between the remaining points in the neighborhood and the fitting plane is calculated, and the neighborhood meeting the threshold requirements is classified as an effective neighborhood, three points with the minimum standard deviation are selected as the initial model, RANSAC algorithm is used to segment the roof point cloud. Aiming at the misclassification phenomenon in segmentation results, the distance between misclassification points and patches is calculated by k-nearest neighbor algorithm, and then the misclassification points are reclassified, at the same time, the angle θ and the distance d between patches are considered to merge the over segmented patches, the Euclidean distance based clustering segmentation algorithm is used to analyze the connectivity of the merged patches. By using the distance from a point to a plane and the consistency of the normal vectors between the point and the plane, the non planar points are redistributed. In order to verify the effectiveness of the algorithm, three independent roofs of complex buildings in Helsinki area of Finland and six roofs of buildings in a residential area of Shanghai are selected as experimental data. In the first group of experiments data, the average accuracy of the segmentation of roof patch is 92.17%, and the highest accuracy is 93.18%. In the second group of experiments data, the average accuracy of the segmentation of the roof patch is 87.82%, and the highest accuracy is 94.44%. The average standard deviation of the distance between the points on all the segmentation patches and the corresponding best fitting plane is 0.030 m. According to the above two groups of experiments data, 78% of the buildings have no over segmentation, and the average accuracy is 90%. The experimental results show that the algorithm has a high accuracy in extracting the roof plane slice, which can suppress the over segmentation and has a good anti noise ability. © 2021, Science Press. All right reserved.
引用
收藏
页码:1497 / 1507
页数:10
相关论文
共 33 条
  • [11] Li X R, Liu G S, Sun S., Efficient point cloud segmentation approach using energy optimization with geometric features for 3D scene understanding, Optical Society of American, 38, pp. 60-70, (2021)
  • [12] Dang J S, Yang J., 3D model recognition and segmentation based on multi feature fusion, Journal of XiDian University, 47, 4, pp. 149-157, (2020)
  • [13] Hou L L., Research on 3D point cloud segmentation algorithm based on geometric features, (2019)
  • [14] Saglam A, Makineci H B, Baykan O K, Et al., Clusteringbased plane refitting of non-planar patches for voxelbased 3D point cloud segmentation using K-means clustering, International Information and Engineering Technology Association, 37, 6, pp. 1019-1027, (2020)
  • [15] Tang Z Y., Point cloud simplification algorithm based on poisson distribution K-means clustering, (2019)
  • [16] Wu Y X, Li F, Liu F, Et al., Smoothness European clustering algorithm segmentation point cloud data, Measurement and Control Technology, 35, 3, pp. 36-38, (2016)
  • [17] Gao G, Ma H C, Zhang L., Extraction of roof surface from LiDAR data by synthetic algorithm, Journal of Wuhan University (Information Science Edition), 39, 10, pp. 1225-1230, (2014)
  • [18] Yuan H, Sun W, Xiang T., Line laser point cloud segmentation based on the combination of RANSAC and region growing, 2020 39th Chinese Control Conference (CCC), pp. 6324-6328, (2020)
  • [19] Shi A J, Bai R L, Tian Q H, Et al., ICP algorithm based on genetic algorithm combined with adaptive threshold constraint, Optical Technology, 44, 1, (2016)
  • [20] Chen F X, Wang R S., Rapid random sampling consistency algorithm based on pre-test, Journal of Software, 8, pp. 1431-1437, (2005)