Journal of System Simulation ›› 2016, Vol. 28 ›› Issue (10): 2329-2335.

Previous Articles     Next Articles

Algorithm for RGBD Point Cloud Denoising and Simplification Based on K-means Clustering

Su Benyue1,2, Ma Jinyu1,2, Peng Yusheng2,3, Sheng Min2,3   

  1. 1. School of Computer and Information, Anqing Normal University, Anqing 246133, China;
    2. The University Key Laboratory of Intelligent Perception and Computing of Anhui Province, Anqing 246133, China;
    3. School of Mathematics and Computational Science, Anqing Normal University, Anqing 246133, China
  • Received:2016-06-10 Revised:2016-07-14 Online:2016-10-08 Published:2020-08-13

Abstract: Aiming at the problem that the point cloud data scanned by Kinect or other depth camera have a huge number and more noise, a feature preserving method for point cloud denoising and simplification was proposed. This algorithm classified the point cloud rapidly by K-D tree; find The corresponding surface curvature values were obtained using curvature estimation algorithm; The K-means clustering algorithm for point cloud clustering was used. For each point in the cluster, the Euclidean distance was depended on between the point and center of the cluster and the change of the near points curvature to determine whether the noise points. The point cloud data was simplified by the feature preserving method. The experimental results show that the denoising and feature preserving point cloud simplification method is quickly and efficiently, for the removal of a large number of external noise has a positive effect, and the streamline point cloud data have the retention of original point cloud features.

Key words: K-means clustering, point cloud denoising, point cloud simplification, RGBD data

CLC Number: