A Product Graph Based Method for Dual Subgraph Matching Applied to Symbol Spotting

Product graph has been shown as a way for matching subgraphs. This paper reports the extension of the product graph methodology for subgraph matching applied to symbol spotting in graphical documents. Here we focus on the two major limitations of the previous version of the algorithm: (1) spurious nodes and edges in the graph representation and (2) inefficient node and edge attributes. To deal with noisy information of vectorized graphical documents, we consider a dual edge graph representation on the original graph representing the graphical information and the product graph is computed between the dual edge graphs of the pattern graph and the target graph. The dual edge graph with redundant edges is helpful for efficient and tolerating encoding of the structural information of the graphical documents. The adjacency matrix of the product graph locates the pair of similar edges of two operand graphs and exponentiating the adjacency matrix finds similar random walks of greater lengths. Nodes joining similar random walks between two graphs are found by combining different weighted exponentials of adjacency matrices. An experimental investigation reveals that the recall obtained by this approach is quite encouraging.

[1]  A. Terras,et al.  Zeta functions of finite graphs and coverings, III , 1996 .

[2]  Ming-Kuei Hu,et al.  Visual pattern recognition by moment invariants , 1962, IRE Trans. Inf. Theory.

[3]  Tatsuya Akutsu,et al.  Graph Kernels for Molecular Structure-Activity Relationship Analysis with Support Vector Machines , 2005, J. Chem. Inf. Model..

[4]  A. Terras,et al.  Zeta Functions of Finite Graphs and Coverings , 1996 .

[5]  Ernest Valveny,et al.  Symbol Recognition: Current Advances and Perspectives , 2001, GREC.

[6]  Edwin R. Hancock,et al.  Backtrackless Walks on a Graph , 2013, IEEE Transactions on Neural Networks and Learning Systems.

[7]  Tony P. Pridmore,et al.  Building Synthetic Graphical Documents for Performance Evaluation , 2007, GREC.

[8]  Thomas Gärtner,et al.  On Graph Kernels: Hardness Results and Efficient Alternatives , 2003, COLT.

[9]  Volkmar Frinken,et al.  A Fast Matching Algorithm for Graph-Based Handwriting Recognition , 2013, GbRPR.

[10]  Umapada Pal,et al.  A symbol spotting approach in graphical documents by hashing serialized graphs , 2013, Pattern Recognit..

[11]  Umapada Pal,et al.  Combination of product graph and random walk kernel for symbol spotting in graphical documents , 2012, Proceedings of the 21st International Conference on Pattern Recognition (ICPR2012).

[12]  Bernhard Schölkopf,et al.  Learning Theory and Kernel Machines , 2003, Lecture Notes in Computer Science.

[13]  Francisco Escolano,et al.  Graph-Based Representations in Pattern Recognition, 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007, Proceedings , 2007, GbRPR.

[14]  J. Skilling,et al.  Algorithms and Applications , 1985 .