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 条
  • [21] Color texture classification based on gravitational collapse
    de Mesquita Sa Junior, Jarbas Joaci
    Backes, Andre Ricardo
    Cortez, Paulo Cesar
    PATTERN RECOGNITION, 2013, 46 (06) : 1628 - 1637
  • [22] Single source shortest paths in H-minor free graphs
    Yuster, Raphael
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (34-36) : 3042 - 3047
  • [23] Shortest Paths with Shortest Detours
    Torchiani, Carolin
    Ohst, Jan
    Willems, David
    Ruzika, Stefan
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2017, 174 (03) : 858 - 874
  • [24] SOLVING THE SHORTEST-PATHS PROBLEM ON BIPARTITE PERMUTATION GRAPHS EFFICIENTLY
    CHEN, L
    INFORMATION PROCESSING LETTERS, 1995, 55 (05) : 259 - 264
  • [25] Matrices, shortest paths, minimal cuts and Euclidian metric for undirected graphs
    Rusakov, Victor A.
    POSTPROCEEDINGS OF THE 9TH ANNUAL INTERNATIONAL CONFERENCE ON BIOLOGICALLY INSPIRED COGNITIVE ARCHITECTURES (BICA 2018), 2018, 145 : 444 - 447
  • [26] Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs
    Mihalak, Matus
    Sramek, Rastislav
    Widmayer, Peter
    THEORY OF COMPUTING SYSTEMS, 2016, 58 (01) : 45 - 59
  • [27] MORE ALGORITHMS FOR ALL-PAIRS SHORTEST PATHS IN WEIGHTED GRAPHS
    Chan, Timothy M.
    SIAM JOURNAL ON COMPUTING, 2010, 39 (05) : 2075 - 2089
  • [28] More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
    Chan, Timothy M.
    STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 590 - 598
  • [29] Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs
    Matúš Mihalák
    Rastislav Šrámek
    Peter Widmayer
    Theory of Computing Systems, 2016, 58 : 45 - 59
  • [30] Color Fractal Descriptors for Adaxial Epidermis Texture Classification
    Backes, Andre R.
    de Mesquita Sa Junior, Jarbas Joaci
    Kolb, Rosana Marta
    PROGRESS IN PATTERN RECOGNITION, IMAGE ANALYSIS, COMPUTER VISION, AND APPLICATIONS, CIARP 2015, 2015, 9423 : 51 - 58