Symbol Spotting in Line Drawings through Graph Paths Hashing

—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can be efficiently represented by graphs, which ease the accurate localization of the model symbol. Graph paths are the factorized substructures of graphs which enable robust recognition even in the presence of noise and distortion. In our framework, the entire database of the graphical documents is indexed in hash tables by the locality sensitive hashing (LSH) of shape descriptors of the paths. The hashing data structure aims to execute an approximate k-NN search in a sub-linear time. The spotting method is formulated by a spatial voting scheme to the list of locations of the paths that are decided during the hash table lookup process. We perform detailed experiments with various dataset of line drawings and the results demonstrate the effectiveness and efficiency of the technique. Keywords-Symbol spotting, Gr...

• Type: Journal
• Year: 2011
• Where: ICDAR
• Authors: Anjan Dutta, Josep Lladós, Umapada Pal
• Keywords: Document Analysis, Hash Table Lookup, Hash Tables, ICDAR 2011, Shape Descriptors