Texture analysis using graphs generated by deterministic partially self-avoiding walks

• Published in: Pattern recognition 2011-08, Vol.44 (8), p.1684-1689
• Main Authors: Backes, André R., Martinez, Alexandre S., Bruno, Odemir M.
• Format: Article
• Language: English
• Subjects: Applied sciences; Deterministic partially self-avoiding walk; Dispersions; Entropy; Exact sciences and technology; Graph theory; Graphs; Image analysis; Information, signal and communications theory; Pattern recognition; Signal and communications theory; Signal processing; Signal representation. Spectral analysis; Signal, noise; Surface layer; Telecommunications and information theory; Texture; Texture analysis; Visual
• ISSN: 0031-3203; 1873-5142
• DOI: 10.1016/j.patcog.2011.01.018

Texture is one of the most important visual attributes for image analysis. It has been widely used in image analysis and pattern recognition. A partially self-avoiding deterministic walk has recently been proposed as an approach for texture analysis with promising results. This approach uses walkers (called tourists) to exploit the gray scale image contexts in several levels. Here, we present an approach to generate graphs out of the trajectories produced by the tourist walks. The generated graphs embody important characteristics related to tourist transitivity in the image. Computed from these graphs, the statistical position (degree mean) and dispersion (entropy of two vertices with the same degree) measures are used as texture descriptors. A comparison with traditional texture analysis methods is performed to illustrate the high performance of this novel approach. [Display omitted] ► Create a graph containing only vertices and no edges. ► For each pixel of the image, perform the deterministic partially self-avoiding walk. ► For each transition of the walk, create an edge connecting their respective nodes in the graph. ► Texture classification is performed using graph properties.