loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
15th International Conference on Pattern Recognition (ICPR'00) - Volume 3
Graph-Based Features for Texture Discrimination
Barcelona, Spain
September 03-September 08
ISBN: 0-7695-0750-6
Cosmin Grigorescu, University of Groningen
Nikolay Petkov, University of Groningen
Graph-based features, such as the number of connected components, edges of a given orientation and vertices per unit area, and the number of vertices and pixels per connected component, are proposed for the analysis of textures, which consist of structural elements. The proposed set of features is compared with features obtained by a typical filter-based scheme, which makes use of Gabor filters. The discrimination properties of the two types of features are assessed by evaluating the separability of sets of feature vectors, which are derived from different types of texture using the Mahalanobis distance. The graph-based features are shown to be superior to the filter-based features for the class of concerned textures. They are particularly suited for discrimination between textures, which have the same spatial and orientation regularity but consist of elements of different form.
Index Terms:
texture features, graph representation, discrimination, Mahalanobis distance, Gabor filters
Citation:
Cosmin Grigorescu, Nikolay Petkov, "Graph-Based Features for Texture Discrimination," icpr, vol. 3, pp.7088, 15th International Conference on Pattern Recognition (ICPR'00) - Volume 3, 2000
Usage of this product signifies your acceptance of the Terms of Use.