|
In this thesis, a fast segmentation algorithm for color images based on analytical clustering techniques is presented. A two-class analytical clustering technique which clusters a multi-dimensional input data set into two classes by preserving some invariant features is proposed first.The technique is then applied repeatedly to handle multi-class case using split-merge concept. In the splitting phase, the quantized colors of the input image are clustered and the number of cluster is detected roughly. In the merging phase, two kinds of similarity measures are used to decide whether the merging should be taken or not. When clusters have been formed, cluster centroids are then used as prototypes. Each color pixel is then classified according to its color difference to the generated prototypes. Region connectivity is also used in classifying pixels. Attempts have also been made to compare the performance of the proposed algorithm with other existing algorithms. Experimental results indicate that the proposed algorithm with is fast and it segments images well in many color coordinate systems.
|