Arbitrary-Shaped Cluster Separation Using One-Dimensional Data Mapping and Histogram Segmentation
Seiji Hotta, Senya Kiyasu, Sueharu Miyahara · Journal of Advanced Computational Intelligence and Intelligent Informatics · 2007
Of the many clustering methods proposed for separating arbitrarily shaped clusters, most had drawbacks in parameter sensitivity and high-computational cost requiring large amounts of memory. We propose one-dimensional (1D) mapping for separating arbitrarily shaped clusters using a list of neighbors. After mapping, we apply a discriminant threshold selection to the histogram of the data distribution in 1D space. We verified the feasibility of performance in experiments on synthetic toy data, image, and video segmentation.