期刊名称：International Journal of Hybrid Information Technology
印刷版ISSN：1738-9968
出版年度：2015
卷号：8
期号：9
页码：157-170
DOI：10.14257/ijhit.2015.8.9.16
出版社：SERSC
摘要：With development of 3D scanner, it becomes more convenient to access point data. However, for processing the large-scale point cloud, it raised a new challenge for computer graphics. This paper places an emphasis on the point data own characteristics, and then the point data have been divided into certain point sets by clustering algorithm, that is will be divided into different clusters. In order to suit for the point data organization or space division, the clustering algorithm would be improved. This paper provided a new Kmeans algorithm with density constraints. Before processing the point cloud by Kmeans algorithm with density constraints, the density of the point cloud have been defined in this paper, the density of the point cloud can be used for quantification of the convergence. Finally, the Kmeans algorithm with density constraints is verified by the experiment results. Our experiment showed that the improved Kmeans can reduce the processing time, especially, As the increase of the value of K, that is number of cluster, the calculating time of the clustering algorithm can be decreased greatly. In addition, w ith the increases of the the scale of data size, the stability of the improved Kmeans algorithm has been verified.
关键词：Clustering Algorithm; Kmeans; Point Cloud; Contour Estimation
