.png){kind=icon}
.png){kind=icon}
Return
Color Texture Classification Using Shortest Paths in Graphs
.png){kind=icon}
PRE
AI
DOI：10.1109/TIP.2014.2333655.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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:
Texture analysis
shortest paths
graphs
color
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W