A New Clustering Method Based on Morphological Operations

05/25/2019
by   Zhenzhou Wang, et al.
0

With the booming development of data science, many clustering methods have been proposed. All clustering methods have inherent merits and deficiencies. Therefore, they are only capable of clustering some specific types of data robustly. In addition, the accuracies of the clustering methods rely heavily on the characteristics of the data. In this paper, we propose a new clustering method based on the morphological operations. The morphological dilation is used to connect the data points based on their adjacency and form different connected domains. The iteration of the morphological dilation process stops when the number of connected domains equals the number of the clusters or when the maximum number of iteration is reached. The morphological dilation is then used to label the connected domains. The Euclidean distance between each data point and the points in each labeled connected domain is calculated. For each data point, there is a labeled connected domain that contains a point that yields the smallest Euclidean distance. The data point is assigned with the same labeling number as the labeled connected domain. We evaluate and compare the proposed method with state of the art clustering methods with different types of data. Experimental results show that the proposed method is more robust and generic for clustering two-dimensional or three-dimensional data.

READ FULL TEXT
research
11/02/2018

Multilayer Graph Signal Clustering

Multilayer graphs are commonly used to model relationships of different ...
research
05/12/2023

Rethinking k-means from manifold learning perspective

Although numerous clustering algorithms have been developed, many existi...
research
12/24/2019

An Entropy-based Variable Feature Weighted Fuzzy k-Means Algorithm for High Dimensional Data

This paper presents a new fuzzy k-means algorithm for the clustering of ...
research
07/25/2022

Orthogonalization of data via Gromov-Wasserstein type feedback for clustering and visualization

In this paper we propose an adaptive approach for clustering and visuali...
research
06/19/2021

A Generic Distributed Clustering Framework for Massive Data

In this paper, we introduce a novel Generic distributEd clustEring frame...
research
07/16/2018

Note on minimal number of skewed unit cells for periodic distance calculation

How many copies of a parallelepiped are needed to ensure that for every ...
research
06/23/2018

Variational Wasserstein Clustering

We propose a new clustering method based on optimal transportation. We s...

Please sign up or login with your details

Forgot password? Click here to reset