Color Texture Classification Using Shortest Paths in Graphs

被引:34
|
作者
de Mesquita Sa Junior, Jarbas Joaci [1 ]
Cortez, Paulo Cesar [1 ]
Backes, Andre Ricardo [2 ]
机构
[1] Univ Fed Ceara, Dept Engn Teleinformat, BR-60020181 Fortaleza, Ceara, Brazil
[2] Univ Fed Uberlandia, Fac Comp, BR-38408100 Uberlandia, MG, Brazil
关键词
Texture analysis; shortest paths; graphs; color;
D O I
10.1109/TIP.2014.2333655
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:3751 / 3761
页数:11
相关论文
共 50 条
  • [1] Texture analysis and classification using shortest paths in graphs
    de Mesquita Sa, Jarbas Joaci Junior
    Backes, Andre Ricardo
    Cortez, Paulo Cesar
    PATTERN RECOGNITION LETTERS, 2013, 34 (11) : 1314 - 1319
  • [2] Plant species identification using shortest paths in graphs applied to color images of palisade parenchyma
    de Mesquita Sa Junior, Jarbas Joaci
    Cortez, Paulo Cesar
    Kolb, Rosana Marta
    Backes, Andre Ricardo
    ECOLOGICAL INFORMATICS, 2017, 39 : 119 - 122
  • [3] Reconfiguration graphs of shortest paths
    Asplund, John
    Edoh, Kossi
    Haas, Ruth
    Hristova, Yulia
    Novick, Beth
    Werner, Brett
    DISCRETE MATHEMATICS, 2018, 341 (10) : 2938 - 2948
  • [4] ON GRAPHS COVERABLE BY k SHORTEST PATHS
    Dumas, Mael
    Foucaud, Florent
    Perez, Anthony
    Todinca, Ioan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2024, 38 (02) : 1840 - 1862
  • [5] Parametric Shortest Paths in Planar Graphs
    Gajjar, Kshitij
    Radhakrishnan, Jaikumar
    2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019), 2019, : 876 - 895
  • [6] Spanning trees and shortest paths in Monge graphs
    Dudas, T
    Rudolf, R
    COMPUTING, 1998, 60 (02) : 109 - 119
  • [7] Shortest Two Disjoint Paths in Conservative Graphs
    Schlotter, Ildiko
    41ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, STACS 2024, 2024, 289
  • [8] Spanning trees and shortest paths in monge graphs
    T. Dudás
    R. Rudolf
    Computing, 1998, 60 : 109 - 119
  • [9] Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs
    Roditty, Liam
    Zwick, Uri
    ACM TRANSACTIONS ON ALGORITHMS, 2012, 8 (04)
  • [10] The Number of Shortest Paths in the (n, k)-Star Graphs
    Cheng, Eddie
    Qiu, Ke
    Shen, Zhi Zhang
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT 1, 2010, 6508 : 222 - +