%0 Conference Proceedings
%T A Bag-of-Paths Based Serialized Subgraph Matching for Symbol Spotting in Line Drawings
%A Anjan Dutta
%A Josep Llados
%A Umapada Pal
%E Jordi Vitria
%E Joao Miguel Raposo
%E Mario Hernandez
%B 5th Iberian Conference on Pattern Recognition and Image Analysis
%D 2011
%V 6669
%I Springer Berlin Heidelberg
%C Berlin
%@ 0302-9743
%@ 978-3-642-21256-7
%F Anjan Dutta2011
%O DAG
%O exported from refbase (http://refbase.cvc.uab.es/show.php?record=1738), last updated on Thu, 06 Mar 2014 15:51:35 +0100
%X In this paper we propose an error tolerant subgraph matching algorithm based on bag-of-paths for solving the problem of symbol spotting in line drawings. Bag-of-paths is a factorized representation of graphs where the factorization is done by considering all the acyclic paths between each pair of connected nodes. Similar paths within the whole collection of documents are clustered and organized in a lookup table for efficient indexing. The lookup table contains the index key of each cluster and the corresponding list of locations as a single entry. The mean path of each of the clusters serves as the index key for each table entry. The spotting method is then formulated by a spatial voting scheme to the list of locations of the paths that are decided in terms of search of similar paths that compose the query symbol. Efficient indexing of common substructures helps to reduce the computational burden of usual graph based methods. The proposed method can also be seen as a way to serialize graphs which allows to reduce the complexity of the subgraph isomorphism. We have encoded the paths in terms of both attributed strings and turning functions, and presented a comparative results between them within the symbol spotting framework. Experimentations for matching different shape silhouettes are also reported and the method has been proved to work in noisy environment also.
%U http://dx.doi.org/10.1007/978-3-642-21257-4_77
%P 620-627