Independent Method for Selecting Radius of FPFH Neighborhood in 3D Point Cloud Registration

被引:7
|
作者
Zhao Mingfu [1 ,2 ]
Cao Libo [1 ,3 ]
Song Tao [1 ,2 ]
Liu Shuai [1 ]
Luo Yuhang [1 ]
Yang Xin [1 ]
机构
[1] Chongqing Univ Technol, Coll Elect & Elect Engn, Chongqing 400054, Peoples R China
[2] Chongqing Univ, Engn Ctr Elevator Intelligent Operat & Maintenanc, Chongqing 402260, Peoples R China
[3] Chongqing Key Lab Opt Fiber Sensing & Photoelect, Chongqing 400054, Peoples R China
关键词
image processing; neighborhood radius; fast point feature histogram; point cloud registration; sampling consistency algorithm; polynomial fitting;
D O I
10.3788/LOP202158.0610002
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A preset fixed value is adopted as the neighborhood radius based on the features of a three-dimensional (3D) point cloud fast point feature histogram (FPFH) , resulting in some problems such as arbitrariness, incompleteness, and inefficiency in feature description. Thus, the entire process of point cloud registration becomes less automated and requires more time. To solve these problems, an algorithm is proposed in this study to automatically select the radius of the FPFH neighborhood in 3D point cloud registration. First, the circumferential density of a multipair point cloud was calculated and the maximum circumference radius was retained. Second, the number of iterations was established and the single neighborhood radius was automatically divided according to the number of iterations and the maximum circumference radius of each pair of point cloud. The features of FPFH were extracted based on the divided neighborhood radius and used for registration in the sampling consistency initial registration algorithm. Finally, the circumferential density of the multipair point cloud and the corresponding optimal neighborhood radius were estimated. Further, the mapping function was obtained using the polynomial fitting method; thus, the FPFH feature extraction optimization algorithm was developed. Results show that the proposed algorithm can automatically adapt to the optimal neighborhood radius according to the circumferential density of the point cloud, effectively reduce the incompleteness and redundancy associated with point cloud description, and improve the speed and accuracy of point cloud registration while improving the degree of automation associated with point cloud registration.
引用
收藏
页数:9
相关论文
共 15 条
  • [1] A METHOD FOR REGISTRATION OF 3-D SHAPES
    BESL, PJ
    MCKAY, ND
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (02) : 239 - 256
  • [2] Target Segmentation Method for Three-Dimensional LiDAR Point Cloud Based on Depth Image
    Fan Xiaohui
    Xu Guoliang
    Li Wanlin
    Wang Qianzhu
    Chang Liangliang
    [J]. CHINESE JOURNAL OF LASERS-ZHONGGUO JIGUANG, 2019, 46 (07):
  • [3] [郭小英 Guo Xiaoying], 2020, [电子学报, Acta Electronica Sinica], V48, P819
  • [4] LiDAR-Based Three-Dimensional Modeling and Volume Calculation for Space Objects
    Hu Yanwei
    Wang Jianjun
    Fan Yuanyuan
    Lu Yunpeng
    Bai Chongyue
    Zhang Jiyun
    [J]. CHINESE JOURNAL OF LASERS-ZHONGGUO JIGUANG, 2020, 47 (05):
  • [5] Detecting Objects in Scene Point Cloud: A Combinational Approach
    Huang, Jing
    You, Suya
    [J]. 2013 INTERNATIONAL CONFERENCE ON 3D VISION (3DV 2013), 2013, : 175 - 182
  • [6] 一种时序数据多项式拟合加速方法
    计卫星
    张露露
    陈娟
    邹天刚
    罗辉
    郭静
    高志伟
    [J]. 北京理工大学学报, 2018, 38 (05) : 519 - 524
  • [7] JieZ X., 2010, J PERIODICAL OCEAN U, V40, P99
  • [8] Ke Ying-lin, 2005, Journal of Zhejiang University, V39, P761
  • [9] Point Cloud Registration Based on Neighborhood Characteristic Point Extraction and Matching
    Li Xin-chun
    Yan Zhen-yu
    Lin Sen
    Jia Di
    [J]. ACTA PHOTONICA SINICA, 2020, 49 (04)
  • [10] Nasab SE, 2014, IRAN CONF ELECTR ENG, P1119, DOI 10.1109/IranianCEE.2014.6999703