• DocumentCode
    72978
  • Title

    Color Texture Classification Using Shortest Paths in Graphs

  • Author

    de Mesquita Sa Junior, Jarbas Joaci ; Cortez, P.C. ; Backes, Andre Ricardo

  • Author_Institution
    Dept. de Eng. de Teleinformatica, Univ. Fed. do Ceara, Fortaleza, Brazil
  • Volume
    23
  • Issue
    9
  • fYear
    2014
  • fDate
    Sept. 2014
  • Firstpage
    3751
  • Lastpage
    3761
  • Abstract
    Color textures are among the most important visual attributes in image analysis. This paper presents a novel method to analyze color textures by modeling a color image as a graph in two different and complementary manners (each color channel separately and the three color channels altogether) and by obtaining statistical moments from the shortest paths between specific vertices of this graph. Such an approach allows to create a set of feature vectors, which were extracted from VisTex, USPTex, and TC00013 color texture databases. The best classification results were 99.07%, 96.85%, and 91.54% (LDA with leave-one-out), 87.62%, 66.71%, and 88.06% (1NN with holdout), and 98.62%, 96.16%, and 91.34% (LDA with holdout) of success rate (percentage of samples correctly classified) for these three databases, respectively. These results prove that the proposed approach is a powerful tool for color texture analysis to be explored.
  • Keywords
    graph theory; image classification; image colour analysis; image texture; LDA; TC00013; USPTex; VisTex; color channels; color image; color texture analysis; color texture classification; feature vectors; graph; image analysis; statistical moments; Databases; Equations; Feature extraction; Image analysis; Image color analysis; Image edge detection; Vectors; Texture analysis; color; graphs; shortest paths;
  • fLanguage
    English
  • Journal_Title
    Image Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1057-7149
  • Type

    jour

  • DOI
    10.1109/TIP.2014.2333655
  • Filename
    6845341