Combination of Product Graph and Random Walk Kernel for Symbol Spotting in Graphical Documents
Anjan Dutta
author
Jaume Gibert
author
Josep Llados
author
Horst Bunke
author
Umapada Pal
author
2012
This paper explores the utilization of product graph for spotting symbols on graphical documents. Product graph is intended to find the candidate subgraphs or components in the input graph containing the paths similar to the query graph. The acute angle between two edges and their length ratio are considered as the node labels. In a second step, each of the candidate subgraphs in the input graph is assigned with a distance measure computed by a random walk kernel. Actually it is the minimum of the distances of the component to all the components of the model graph. This distance measure is then used to eliminate dissimilar components. The remaining neighboring components are grouped and the grouped zone is considered as a retrieval zone of a symbol similar to the queried one. The entire method works online, i.e., it doesn't need any preprocessing step. The present paper reports the initial results of the method, which are very encouraging.
DAG
exported from refbase (http://refbase.cvc.uab.es/show.php?record=2125), last updated on Thu, 13 Mar 2014 10:34:29 +0100
text
http://refbase.cvc.uab.es/files/DGL2012b.pdf
Admin @ si @ DGL2012
21st International Conference on Pattern Recognition
ICPR
2012
conference publication
1663
1666
978-1-4673-2216-4
1051-4651