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 条
  • [31] Effectiveness of Representation and Length Variation of Shortest Paths in Graph Classification
    Salim, Asif
    Shiju, S. S.
    Sumitra, S.
    PATTERN RECOGNITION AND MACHINE INTELLIGENCE, PREMI 2017, 2017, 10597 : 509 - 516
  • [32] Map-Matching Using Shortest Paths
    Chambers, Erin
    Fasy, Brittany Terese
    Wang, Yusu
    Wenk, Carola
    ACM TRANSACTIONS ON SPATIAL ALGORITHMS AND SYSTEMS, 2020, 6 (01)
  • [33] Map-Matching Using Shortest Paths
    Chambers, Erin
    Fasy, Brittany Terese
    Wang, Yusu
    Wenk, Carola
    PROCEEDINGS OF THE 3RD INTERNATIONAL WORKSHOP ON INTERACTIVE AND SPATIAL COMPUTING (IWISC 18), 2018, : 44 - 51
  • [34] Non-crossing shortest paths lengths in planar graphs in linear time
    Balzotti, Lorenzo
    Franciosa, Paolo G.
    DISCRETE APPLIED MATHEMATICS, 2024, 346 : 183 - 191
  • [35] Planar graphs, negative weight edges, shortest paths, and near linear time
    Fakcharoenphol, Jittat
    Rao, Satish
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2006, 72 (05) : 868 - 889
  • [36] On the Utilization of Shortest Paths in Complex Networks
    Alrasheed, Hend
    IEEE ACCESS, 2021, 9 : 110989 - 111004
  • [37] Image classification based on color and texture analysis
    Acha, B
    Serrano, C
    IWISPA 2000: PROCEEDINGS OF THE FIRST INTERNATIONAL WORKSHOP ON IMAGE AND SIGNAL PROCESSING AND ANALYSIS, 2000, : 95 - 99
  • [38] All-Pairs Shortest Paths for Unweighted Undirected Graphs in o(mn) Time
    Chan, Timothy M.
    ACM TRANSACTIONS ON ALGORITHMS, 2012, 8 (04)
  • [39] Apple disease classification using color, texture and shape features from images
    Dubey, Shiv Ram
    Jalal, Anand Singh
    SIGNAL IMAGE AND VIDEO PROCESSING, 2016, 10 (05) : 819 - 826
  • [40] ON THE CLASSIFICATION OF IMAGE REGIONS BY COLOR, TEXTURE AND SHAPE
    CAELLI, T
    REYE, D
    PATTERN RECOGNITION, 1993, 26 (04) : 461 - 470