Unsupervised Texture Segmentation by Spectral-Spatial-Independent Clustering

A novel color texture unsupervised segmentation algorithm is presented which processes independently the spectral and spatial information. The algorithm is composed of two parts. The former provides an over-segmentation of the image, such that basic components for each of the textures which are present are extracted. The latter is a region growing algorithm which reduces drastically the number of regions, and provides a region-hierarchical texture clustering. The over-segmentation is achieved by means of a color-based clustering (CBC) followed by a spatial-based clustering (SBC). The SBC, as well as the subsequent growing algorithm, make use of a characterization of the regions based on shape and context. Experimental results are very promising in case of textures which are quite regular

[1]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[2]  David A. Clausi,et al.  Design-based texture feature fusion using Gabor filters and co-occurrence probabilities , 2005, IEEE Transactions on Image Processing.

[3]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Michal Haindl,et al.  Colour Texture Segmentation Using Modelling Approach , 2005, ICAPR.

[5]  Giuseppe Scarpa,et al.  A tree-structured Markov random field model for Bayesian image segmentation , 2003, IEEE Trans. Image Process..

[6]  Philippe Andrey,et al.  Unsupervised Segmentation of Markov Random Field Modeled Textured Images Using Selectionist Relaxation , 1998, IEEE Trans. Pattern Anal. Mach. Intell..