Pixel Intensity Clustering Algorithm for Multilevel Image Segmentation

Abstract EN

Image segmentation is an important problem that has received significant attention in the literature.

Over the last few decades, a lot of algorithms were developed to solve image segmentation problem; prominent amongst these are the thresholding algorithms.

However, the computational time complexity of thresholding exponentially increases with increasing number of desired thresholds.

A wealth of alternative algorithms, notably those based on particle swarm optimization and evolutionary metaheuristics, were proposed to tackle the intrinsic challenges of thresholding.

In codicil, clustering based algorithms were developed as multidimensional extensions of thresholding.

While these algorithms have demonstrated successful results for fewer thresholds, their computational costs for a large number of thresholds are still a limiting factor.

We propose a new clustering algorithm based on linear partitioning of the pixel intensity set and between-cluster variance criterion function for multilevel image segmentation.

The results of testing the proposed algorithm on real images from Berkeley Segmentation Dataset and Benchmark show that the algorithm is comparable with state-of-the-art multilevel segmentation algorithms and consistently produces high quality results.

The attractive properties of the algorithm are its simplicity, generalization to a large number of clusters, and computational cost effectiveness.