Hierarchical graph representation for symbol spotting in graphical document images

Authors:
Klaus Broelemann;Anjan Dutta;Xiaoyi Jiang;Josep Lladós
Affiliations:
Institute for Computer Science, University of Münster, Germany;Computer Vision Center, Universitat Autonoma de Barcelona, Spain;Institute for Computer Science, University of Münster, Germany;Computer Vision Center, Universitat Autonoma de Barcelona, Spain
Venue:
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Year:
2012

Citing 8
Cited 0

Segmentation of edges into lines and arcs

Image and Vision Computing
Building Synthetic Graphical Documents for Performance Evaluation

Graphics Recognition. Recent Advances and New Opportunities
Pattern Recognition Methods for Querying and Browsing Technical Documentation

CIARP '08 Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications
A performance evaluation protocol for symbol spotting systems in terms of recognition and location indices

International Journal on Document Analysis and Recognition
From region based image representation to object discovery and recognition

SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Subgraph Spotting through Explicit Graph Embedding: An Application to Content Spotting in Graphic Document Images

ICDAR '11 Proceedings of the 2011 International Conference on Document Analysis and Recognition
Symbol Spotting in Line Drawings through Graph Paths Hashing

ICDAR '11 Proceedings of the 2011 International Conference on Document Analysis and Recognition
Approximating the maximum weight clique using replicator dynamics

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.