Local Binary Patterns for Graph Characterization

摘要

In this paper we propose a novel approach for defining Local Binary Patterns (LBP) to directly encode graph structure. LBP is a simple and widely used technique for texture analysis in static 2D images, and there is no work in the literature describing its generalisation to graphs. The proposed method (GraphLBP) is efficient and yet effective as a noise-tolerant graph-based representation. We compute the new feature representation for graphs by combining LBP with Galois Fields, using irreducible polynomials. The proposed method is scalable as it preserves the local and global properties of the graph. Experimental results show that GraphLBP can both increase the recognition accuracy and is both simpler and more computationally efficient when compared with state of the art techniques.