k-MS: A novel clustering algorithm based on morphological reconstruction

Abstract

This work proposes a clusterization algorithm called k-Morphological Sets (k-MS), based on morphological reconstruction and heuristics. k-MS is faster than the CPU-parallel k-Means in worst case scenarios and produces enhanced visualizations of the dataset as well as very distinct clusterizations. It is also faster than similar clusterization methods that are sensitive to density and shapes such as Mitosis and TRICLUST. In addition, k-MS is deterministic and has an intrinsic sense of maximal clusters that can be created for a given input sample and input parameters, differing from k-Means and other clusterization algorithms. In other words, given a constant k, a structuring element and a dataset, k-MS produces k or less clusters without using random/ pseudo-random functions. Finally, the proposed algorithm also provides a straightforward means for removing noise from images or datasets in general.

Cited by in corpus (10)

• Combining Minkowski and Chebyshev: New distance proposal and survey of distance metrics using k-nearest neighbours classifier
• Adaptive Morphological Reconstruction for Seeded Image Segmentation
• ELEMENT: Multi-Modal Retinal Vessel Segmentation Based on a Coupled Region Growing and Machine Learning Approach
• Automated recognition of the pericardium contour on processed CT images using genetic algorithms
• Morphological classifiers
• Fractal triangular search: a metaheuristic for image content search
• ROI Extraction in Thermographic Breast Images Using Genetic Algorithms
• X-Ray cardiac angiographic vessel segmentation based on pixel classification using machine learning and region growing
• Machine learning applied to emerald gemstone grading: framework proposal and creation of a public dataset
• Line Art Colorization of Fakemon using Generative Adversarial Neural Networks