Paper:
Language: English:

Arbitrary-Shaped Cluster Separation Using One-Dimensional Data Mapping and Histogram Segmentation

Seiji Hotta^*, Senya Kiyasu^, and Sueharu Miyahara^

^*Tokyo University of Agriculture and Technology, 2-24-16 Naka-cho, Koganei, Tokyo 184-8588, Japan
^**Department of Computer and Information Sciences, Nagasaki University
1-14 Bunkyo-machi, Nagasaki-shi, Nagasaki 852-8521, Japan

Received: October 2, 2006

Accepted: August 16, 2007

Keywords: clustering, arbitrarily shaped cluster, one-dimensional data mapping, histogram segmentation, discriminant threshold selection

Journal ref: Journal of Advanced Computational Intelligence and Intelligent Informatics, Vol.11, No.9 pp. 1136-1143, 2007

Abstract

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.

[Notice]
* "Preview" is the first 2 pages of the article. You don't need the registration.
* To read the PDF file you will then need to download and install the Adobe Reader.
Adobe Reader is free and available for download here: