Iterative closest point for accurate plane detection in unorganized point clouds

被引:35
|
作者
Fotsing, Cedrique [1 ]
Menadjou, Nareph [2 ]
Bobda, Christophe [3 ]
机构
[1] Brandenburg Univ Technol Cottbus Senftenberg, Chair Graph Syst, Konrad Wachsmann Allee 5, D-03046 Cottbus, Germany
[2] Camertronix Sarl, Blvd Reunificat, Yaounde 8487, Cameroon
[3] Univ Florida, Dept Elect & Comp Engn, Gainesville, FL 32611 USA
关键词
Plane detection; Unorganized point clouds; Region growing; HOUGH TRANSFORM; SEGMENTATION; CLASSIFICATION; INDUSTRY; RANSAC;
D O I
10.1016/j.autcon.2021.103610
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
Plane detection is an important step in the reconstruction of 3D models of buildings from point clouds. The results of plane detection methods based on the region growing approach mainly depend on the choice of seed points. In this study, we introduce a novel region growing-based method for plane detection in unorganized point clouds. Our method uses the Iterative Closest Point (ICP) algorithm to extract reliable seeds. To enhance the performance and the quality of the results, we used voxel grids representation of the point clouds in the growing process. The classification of the candidate planes is improved by using the number of voxel cells covering accumulated segments. The method is deterministic, runs in O(nlog(n)), and does not take into account the orientation of the point clouds. The results of plane detection using the proposed method on a benchmark consisting of 9 point clouds of buildings show a better precision of extracted planes compared to those obtained with 3-D KHT and PCL-RANSAC. Although slower than 3-D KHT, our method requires an execution time (3 x times) shorter than PCL-RANSAC.
引用
收藏
页数:11
相关论文
共 50 条
  • [31] Extraction of Reliable Primitives from Unorganized Point Clouds
    Tran, Trung-Thien
    Cao, Van-Toan
    Laurendeau, Denis
    3D RESEARCH, 2015, 6 (04) : 1 - 12
  • [32] Registration of unorganized point clouds by inheriting and optimizing algorithm
    Mechanical and Electrical Engineering School, Nanchang University, Nanchang 330031, China
    不详
    Guangxue Jingmi Gongcheng, 2009, 4 (825-831): : 825 - 831
  • [33] FINDING THE CLOSEST LATTICE POINT BY ITERATIVE SLICING
    Sommer, Naftali
    Feder, Meir
    Shalvi, Ofir
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2009, 23 (02) : 715 - 731
  • [34] Automated trimmed Iterative Closest Point algorithm
    Synave, R.
    Desbarats, P.
    Gueorguieva, S.
    ADVANCES IN VISUAL COMPUTING, PROCEEDINGS, PT 2, 2007, 4842 : 489 - 498
  • [35] Morphological techniques in the iterative closest point algorithm
    Kapoutsis, CA
    Vavoulidis, CP
    Pitas, I
    1998 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING - PROCEEDINGS, VOL 1, 1998, : 808 - 812
  • [36] Robust iterative closest point algorithm for registration of point sets with outliers
    Du, Shaoyi
    Zhu, Jihua
    Zheng, Nanning
    Liu, Yuehu
    Li, Ce
    OPTICAL ENGINEERING, 2011, 50 (08)
  • [37] An Iterative Closest Point Framework for Ultrasound Calibration
    Chen, Elvis C. S.
    McLeod, A. Jonathan
    Baxter, John S. H.
    Peters, Terry M.
    AUGMENTED ENVIRONMENTS FOR COMPUTER-ASSISTED INTERVENTIONS, AE-CAI 2015, 2015, 9365 : 69 - 79
  • [38] Mahalanobis distance based iterative closest point
    Hansena, Mads Fogtmann
    Blas, Morten Rufus
    Larsen, Rasmus
    MEDICAL IMAGING 2007: IMAGE PROCESSING, PTS 1-3, 2007, 6512
  • [39] Sparse mixture iterative closest point registration
    Liu, Yue-Sheng
    Chen, Xin-Du
    Wu, Lei
    Huang, Yun-Bao
    Li, Hai Yan
    Guangxue Jingmi Gongcheng/Optics and Precision Engineering, 2021, 29 (09): : 2255 - 2267
  • [40] Adaptive weighted robust iterative closest point
    Guo, Yu
    Zhao, Luting
    Shi, Yan
    Zhang, Xuetao
    Du, Shaoyi
    Wang, Fei
    NEUROCOMPUTING, 2022, 508 : 225 - 241