Comparison of K-means and fuzzy C-means algorithms on simplification of 3D point cloud based on entropy estimation

7Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

In this article we will present a method simplifying 3D point clouds. This method is based on the Shannon entropy. This technique of simplification is a hybrid technique where we use the notion of clustering and iterative computation. In this paper, our main objective is to apply our method on different clouds of 3D points. In the clustering phase we will use two different algorithms; K-means and Fuzzy C-means. Then we will make a comparison between the results obtained.

Author supplied keywords

Cite

CITATION STYLE

APA

Mahdaoui, A., Bouazi, A., Hsaini, A. M., & Sbai, E. H. (2017). Comparison of K-means and fuzzy C-means algorithms on simplification of 3D point cloud based on entropy estimation. Advances in Science, Technology and Engineering Systems, 2(5), 38–44. https://doi.org/10.25046/aj020508

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free