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 条
  • [41] A COMBINED UNIFORM AND HEURISTIC SEARCH ALGORITHM FOR MAINTAINING SHORTEST PATHS ON FULLY DYNAMIC GRAPHS
    Castronovo, Sandro
    Kunz, Bjoern
    Mueller, Christian
    ICAART: PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 1, 2012, : 119 - 126
  • [42] DAWN: Matrix Operation-Optimized Algorithm for Shortest Paths Problem on Unweighted Graphs
    Feng, Yelai
    Wang, Huaixi
    Zhu, Yining
    Liu, Xiandong
    Lu, Hongyi
    Liu, Qing
    PROCEEDINGS OF THE 38TH ACM INTERNATIONAL CONFERENCE ON SUPERCOMPUTING, ACM ICS 2024, 2024, : 1 - 13
  • [43] AN OPTIMAL ALGORITHM FOR SHORTEST PATHS ON WEIGHTED INTERVAL AND CIRCULAR-ARC GRAPHS, WITH APPLICATIONS
    ATALLAH, MJ
    CHEN, DZ
    LEE, DT
    ALGORITHMICA, 1995, 14 (05) : 429 - 441
  • [44] An optimal algorithm for L1 shortest paths in unit-disk graphs
    Wang, Haitao
    Zhao, Yiming
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2023, 110
  • [45] Apple disease classification using color, texture and shape features from images
    Shiv Ram Dubey
    Anand Singh Jalal
    Signal, Image and Video Processing, 2016, 10 : 819 - 826
  • [46] TEXTURE CLASSIFICATION USING TEXTURE SPECTRUM
    WANG, L
    HE, DC
    PATTERN RECOGNITION, 1990, 23 (08) : 905 - 910
  • [47] A graph based approach for color texture classification in HSV color space
    El Moutaouakkil, Mohammed
    Drissi El Maliani, Ahmed
    El Hassouni, Mohammed
    2017 INTERNATIONAL CONFERENCE ON WIRELESS NETWORKS AND MOBILE COMMUNICATIONS (WINCOM), 2017, : 396 - 400
  • [48] Shortest Paths with Shortest DetoursA Biobjective Routing Problem
    Carolin Torchiani
    Jan Ohst
    David Willems
    Stefan Ruzika
    Journal of Optimization Theory and Applications, 2017, 174 : 858 - 874
  • [49] A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs
    Attiratanasunthron, Nattapat
    Fakcharcienphol, Jittat
    INFORMATION PROCESSING LETTERS, 2008, 105 (03) : 88 - 92
  • [50] On Dynamic Shortest Paths Problems
    Roditty, Liam
    Zwick, Uri
    ALGORITHMICA, 2011, 61 (02) : 389 - 401