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 条
  • [41] DICP: Doppler Iterative Closest Point Algorithm
    Hexsel, Bruno
    Vhavle, Heethesh
    Chen, Yi
    ROBOTICS: SCIENCE AND SYSTEM XVIII, 2022,
  • [42] Finding the closest lattice point by iterative slicing
    Sommer, Naftali
    Feder, Meir
    Shalvi, Ofir
    2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 206 - 210
  • [43] Mirrored Iterative Closest Point Algorithm for Missing Point Cloud Registration
    Xu W.
    Jin L.
    Han X.
    Cheng H.
    Tian X.
    Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University, 2023, 57 (07): : 201 - 212+220
  • [44] Point cloud registration based on improved iterative closest point method
    Wang, Xin
    Zhang, Ming-Ming
    Yu, Xiao
    Zhang, Ming-Chao
    Guangxue Jingmi Gongcheng/Optics and Precision Engineering, 2012, 20 (09): : 2068 - 2077
  • [45] Iterative Closest Point Based Volume Analysis on UAV Made Time-series Large-scale Point Clouds
    Stojcsics, Daniel
    Domozi, Zsolt
    Molnar, Andras
    2018 IEEE 16TH INTERNATIONAL SYMPOSIUM ON INTELLIGENT SYSTEMS AND INFORMATICS (SISY 2018), 2018, : 69 - 74
  • [46] Visual Odometry With Loop Closing Detection Using Iterative Closest SURF Point
    Chaib, Khaoula
    Hamerlain, Mustapha
    Achour, Nouara
    Nemra, Abdelkrim
    2017 6TH INTERNATIONAL CONFERENCE ON SYSTEMS AND CONTROL (ICSC' 17), 2017, : 503 - 508
  • [47] Feature line extraction from unorganized noisy point clouds
    Liu, X. (liuxs@dlut.edu.cn), 1600, Binary Information Press (10):
  • [48] Functional Surface Reconstruction from Unorganized Noisy Point Clouds
    Dalian University of Technology, China
    Comput.-Aided Des. Appl., 3 (366-372):
  • [49] The medial scaffold of 3D unorganized point clouds
    Leymarie, Frederic F.
    Kimia, Benjamin B.
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2007, 29 (02) : 313 - 330
  • [50] Finding Good Configurations of Planar Primitives in Unorganized Point Clouds
    Yu, Mulin
    Lafarge, Florent
    2022 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2022), 2022, : 6357 - 6366