A Fast and Accurate Plane Detection Algorithm for Large Noisy Point Clouds Using Filtered Normals and Voxel Growing

With the improvement of 3D scanners, we produce point clouds with more and more points often exceeding millions of points. Then we need a fast and accurate plane detection algorithm to reduce data size. In this article, we present a fast and accurate algorithm to detect planes in unorganized point clouds using filtered normals and voxel growing. Our work is based on a first step in estimating better normals at the data points, even in the presence of noise. In a second step, we compute a score of local plane in each point. Then, we select the best local seed plane and in a third step start a fast and robust region growing by voxels we call voxel growing. We have evaluated and tested our algorithm on different kinds of point cloud and compared its performance to other algorithms.

[1]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[2]  Tony DeRose,et al.  Surface reconstruction from unorganized points , 1992, SIGGRAPH.

[3]  Andrew W. Fitzgibbon,et al.  An Experimental Comparison of Range Image Segmentation Algorithms , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Craig M. Shakarji,et al.  Least-Squares Fitting Algorithms of the NIST Algorithm Testing System , 1998, Journal of research of the National Institute of Standards and Technology.

[5]  Luciano Silva,et al.  Range image segmentation by surface extraction using an improved robust estimator , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[6]  Markus H. Gross,et al.  Shape modeling with point-sampled geometry , 2003, ACM Trans. Graph..

[7]  K. Schindler,et al.  Segmentation of building models from dense 3 D point-clouds , 2003 .

[8]  Martin Isenburg,et al.  Large mesh simplification using processing sequences , 2003, IEEE Visualization, 2003. VIS 2003..

[9]  G. Sithole,et al.  Recognising structure in laser scanning point clouds , 2004 .

[10]  Tamal K. Dey,et al.  Eurographics Symposium on Point-based Graphics (2005) Normal Estimation for Point Clouds: a Comparison Study for a Voronoi Based Method , 2022 .

[11]  Alireza Bab-Hadiashar,et al.  Range image segmentation using surface selection criterion , 2006, IEEE Transactions on Image Processing.

[12]  F. Goulette,et al.  An integrated on-board laser range sensing system for on-the-way city and road modelling , 2006 .

[13]  George Vosselman,et al.  Segmentation of point clouds using smoothness constraints , 2006 .

[14]  Wolfgang Straßer,et al.  Bayesian Point Cloud Reconstruction , 2006, Comput. Graph. Forum.

[15]  T. Rabbani,et al.  SEGMENTATION OF POINT CLOUDS USING SMOOTHNESS CONSTRAINT , 2006 .

[16]  Sebastian Thrun,et al.  A Bayesian method for probable surface reconstruction and decimation , 2006, TOGS.

[17]  Michael Wand Rendering of Very Large Models , 2007 .

[18]  Reinhard Klein,et al.  Efficient RANSAC for Point‐Cloud Shape Detection , 2007, Comput. Graph. Forum.

[19]  Ioannis Stamos,et al.  Range Image Segmentation for Modeling and Object Detection in Urban Scenes , 2007, Sixth International Conference on 3-D Digital Imaging and Modeling (3DIM 2007).

[20]  F. Tarsha-Kurdi,et al.  Hough-Transform and Extended RANSAC Algorithms for Automatic Detection of 3D Building Roof Planes from Lidar Data , 2007 .

[21]  Tania Landes,et al.  AUTOMATIC SEGMENTATION OF BUILDING FACADES USING TERRESTRIAL LASER DATA , 2007 .

[22]  Ioannis Stamos,et al.  Think Globally, Cluster Locally: A Unied Framework for Range Segmentation , 2008 .

[23]  Andreas Birk,et al.  Fast plane detection and polygonalization in noisy 3D range images , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.