Home Articles A new unsupervised algorithm for texture segmentation

A new unsupervised algorithm for texture segmentation


Dr. V. Vijaya Kumar
Associate Professor, SIT, IPGS&R, JNT University
Masab Tank, Hyderabad-500 028
Email: [email protected]

A. Nagaraja Rao
esearch scholar, MGNIRSA, Hyderabad

V. V. Krishna
Head Dept of CS & IT, MGIT, Hyderabad

Dr. A. Damodaram
Associate Professor, SIT, IPGS&R, JNT University
Masab Tank, Hyderabad-500 028
Email: [email protected]

A new unsupervised algorithm for texture segmentation is proposed in this paper. The new scheme is based on the idea that texture features changes abruptly near boundaries. The image is first looked as regions of 5 x 5 masks and an edge detection algorithm based on all four directions with respect to central pixel is applied and primitive morphological concepts are proposed to change the central pixel. The validity of the proposed method is also considered by experimental results.

Texture segmentation is the first step in natural texture analysis. It plays an important part in image interpretation and understanding. Most natural image textures do not consist of only one type of texture. Texture segmentation is defined as a division of the whole image into homogeneous regions characterized by the same texture. In general the number of texture types present in an image is not known in advance. An unsupervised or an automatic segmentation method is therefore preferred.

Texture segmentation can be performed in two ways- as grey level segmentation or as feature segmentation. The former usually deals with the so-called object identification[1-3] or object extraction from a textured background. In this case, abrupt changes in an image are interpreted as grey level changes which usually appear near the boundaries between the objects and the background. The latter[4,5]deals with the identification of different textural regions using their textural feature differences and not the grey level differences. In this paper the more general feature segmentation method is addressed on a 5 x 5 neighborhood mask.

A 5 x 5 neighbor hood mask is shown in the Table1. The absolute difference of central pixel value Pi,j , with its vertical pixels P3, P8, P18, P23, , with its horizontal pixels P11, P12, P14, P15, and , with its two diagonal sets are calculated. From these 4 values, 4 new sets of images can be obtained by substituting a new value for central pixel, which can be maximum, minimum, average and difference of maximum and minimum of these sets. Out of these, the difference of maximum and minimum resulting as a good segmentation algorithm. And this process is applied on the entire texture by convolution. The original textures and the resultant textures after the segmentation are shown in the following figures.

Table 1. 5 x 5 neighborhood mask.

P1 P2 P3 P4 P5
P6 P7 P8 P9 P10
P11 P12 P13 P14 P15
P16 P17 P18 P19 P20
P21 P22 P23 P24 P25

Fig. 1. The original image

Fig. 2. Segmented image of the original image.

Fig. 3. Original image of leaf texture.

Fig. 4. Segmented image of leaf texture.
The experimental results and their analysis given above prove that our new segmentation method is quite efficient for the segmentation of texture features. This method uses all 4 direction measures i.e. Vertical, horizontal, and two diagonal directions. And that’s why the proposed segmentation scheme is a more general one. This method is unsupervised, and it is also based on primitive grey level morphological operations dilation and erosion. The experimental results on the above figures shows the validity of the algorithm.


  • J.L.C.Sanz, Fast object segmentation in textural background, IEEE Proc. Int. Conf. ASSP, pp. 905-908(1985).
  • L.S.Davis, Region extracting by averaging the thresholding, IEEE Trans. Mach. Man. Cybern. 5, 383-388(1975).
  • Kan-Min Chen, Shu-Yuan Chen, Color texture segmentation using feature distributions, Pattern Recognition Letters 23, pp. 755-771 (2002).
  • R.L.Kashyap, A stochastic model based technique for texture segmentation, Proc. Int. Conf. Pattern Recognition. Pp. 1202-1205(1984).
  • W.B. Thompson, Textural boundary analysis, IEEE Trans. Comput. C-26, 272-276(1977).