Map segmentation by colour cube genetic K-mean clustering

Abstract

In this work, a method is described for evolving adaptive procedures for colour image segmentation. We formulate the segmentation problem as an optimisation problem and adopt evolutionary strategy of Genetic Algorithms (GA) for the clustering of small regions in colour feature space. The present approach uses k-Means unsupervised clustering methods into GA, namely for guiding this last Evolutionary Algorithm in his search for finding the optimal or sub-optimal data partition, task that as we know, requires a non-trivial search because of its intrinsic NP-complete nature. To solve this task, the appropriate genetic coding is also discussed, since this is a key aspect in the implementation. Our purpose is to demonstrate the efficiency of GA to automatic and unsupervised texture segmentation. Some examples in Colour Maps are presented and overall results discussed.