Texel Identification Using K-Means Clustering Method

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (volume 167)

Abstract

Identifying the smallest portion of the image that represents the entire image is a basic need for its efficient storage. Texture can be defined as a pattern that is repeated in a specific manner. The basic pattern that is repeated is called as Texel(Texture Element). This paper describes a method of extracting a Texel from the given textured image using K means clustering algorithm and validating it with the entire image. The number of gray levels in an image is reduced using a linear transformation function. The image is then divided in to sub windows of certain size. These sub windows are clustered together using K-means algorithm. Finally a heuristic algorithm is applied on the cluster labels to identify the Texel, which results in more than one candidate for Texel. The best among them is then chosen based on its similarity with the overall image. The similarity between the Texel and the image is calculated based on then Normalized Gray level co-occurrence matrix in the maximum gradient direction. Experiments are conducted on various texture images for various block sizes and the results are summarized.

Keywords

Gray Level Input Image Texture Image Gabor Filter Texture Representation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Gose, E., Johnsonbaugh, R., Jost, S.: Pattern Recognition and Image Analysis, pp. 199–215. Prentice HallGoogle Scholar
  2. 2.
    Lee, B.: A New Method for Classification of Structural Textures. IEEE Transactions on International Journal of Control, Automation, and Systems 2(1) (March 2004)Google Scholar
  3. 3.
    Tuceryan, M., Jain, A.K.: Texture Analysis. IEEE Transactions on Systems, Man, and Cybernetics 2 (March 1998)Google Scholar
  4. 4.
    Veksler, O.: Lecture notes on Pattern Recognition, http://www.csd.uwo.ca/~olga/Courses//Winter2006//CS434.../index.html
  5. 5.
    Hartigan, J.A.: Clustering Algorithm. Wiley (1975)Google Scholar
  6. 6.
  7. 7.
    Soh, L.-K., Tsatsoulis, C.: Texture Representation of SAR Sea Ice Imagery Using Multi-Displacement Co-Occurrence Matrices, http://www.ittc.ku.edu/publications/documents/Soh1996_igarss96-6.pdf
  8. 8.
    Kruizinga, P., Petkov, N.: Grating cell operator features of oriented texture segmentation. Appeared in Proc. of the 14th Int. Conf. on Pattern Recognition, Brisbane, Australia, August 16-20, pp. 1010–1014 (1998)Google Scholar
  9. 9.
    Clausi, D.A., Deng, H.: Fusion of Gabor Filter and Co-occurrence Probability Features for Texture Recognition, http://www.eng.uwaterloo.ca/~dclausi/Papers/Clausi
  10. 10.
    Hosseini Aria, E., Saradjian, M.R., Amini, J., Lucas, C.: Generalized Co-occurrence Matrix to classify IRS-1D Images using Neural Network, http://www.isprs.org/istanbul2004/comm7/papers/23.pdf
  11. 11.
  12. 12.
    Bourke, P.: Tiling textures on the plane, http://www.paulbourke.net/texture_colour/tiling
  13. 13.
    Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: A review, http://www.nd.edu/~flynn/papers/Jain-CSUR99.pdf

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Amrita School of EngineeringCoimbatoreIndia

Personalised recommendations