Welcome to Journal of Graphics share: 

Journal of Graphics ›› 2022, Vol. 43 ›› Issue (4): 599-607.DOI: 10.11996/JG.j.2095-302X.2022040599

• Image Processing and Computer Vision • Previous Articles     Next Articles

A scattered point cloud simplification algorithm based on FPFH feature extraction

  

  1. School of Information Science and Engineering, Yunnan University, Kunming Yunnan 650500, China
  • Online:2022-08-31 Published:2022-08-15
  • Contact: XU Dan (1968), professor, Ph.D. Her main research interests cover computer graphics, computer vision, artificial intelligence, cultural computing, etc
  • About author:LI Hai-peng (1997), master student. His main research interests cover image processing and computer vision
  • Supported by:
    National Natural Science Foundation of China (61761046, 62061049, 62162068); Yunnan Province “Ten Thousand Talents Program”
    Yunling Scholars Special Project (YNWR-YLXZ-2018-022); Yunnan Provincial Science and Technology Department-Yunnan University “Double First Class” Construction Joint Fund Project (2019FY003012); Graduate Research and Innovation Foundation of Yunnan University (Y2000211)

Abstract:

To address the large amount of redundant data in the original point cloud, a point cloud simplification algorithm based on fast point feature histograms (FPFH) feature extraction was proposed, effectively taking into account the retention of feature information and overall integrity. Firstly, the algorithm sought and retained the boundary points of the original model. Then, the FPFH value of non-boundary points were calculated, thus producing the feature value of the point cloud. After sorting the feature values, the non-boundary points were divided into the feature region and the non-feature region, retaining the points in the feature region. Finally, the non-feature region was divided into k sub-intervals, and the improved farthest point sampling algorithm was employed to sample each sub-interval. The proposed algorithm was compared with the farthest point sampling algorithm, non-uniform grid method, k-means algorithm, and adaptive curvature entropy algorithm, and the simplified point cloud was evaluated by the standardized information entropy evaluation method. Experimental results show that the proposed algorithm outperforms other simplification algorithms. In addition, the visualization results indicate that the proposed algorithm can not only ensure the integrity of the simplified model but also retain most of the feature information of the point cloud.


Key words: point cloud simplification, fast point feature histograms, farthest point sampling, boundary reservation; standardized information entropy

CLC Number: