Symbol spotting can be defined as locating given query symbol in a large collection of graphical documents. In this paper we present a hierarchical graph representation for symbols. This representation allows graph matching methods to deal with low-level vectorization errors and, thus, to perform a robust symbol spotting. To show the potential of this approach, we conduct an experiment with the SESYD dataset. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Broelemann, K., Dutta, A., Jiang, X., & Lladós, J. (2012). Hierarchical graph representation for symbol spotting in graphical document images. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7626 LNCS, pp. 529–538). https://doi.org/10.1007/978-3-642-34166-3_58
Mendeley helps you to discover research relevant for your work.