Abstract
Graph representation of graphical documents often suffers from noise such as spurious nodes and edges, and their discontinuity. In general these errors occur during the low-level image processing viz. binarization, skeletonization, vectorization etc. Hierarchical graph representation is a nice and efficient way to solve this kind of problem by hierarchically merging node-node and node-edge depending on the distance. But the creation of hierarchical graph representing the graphical information often uses hard thresholds on the distance to create the hierarchical nodes (next state) of the lower nodes (or states) of a graph. As a result, the representation often loses useful information. This paper introduces plausibilities to the nodes of hierarchical graph as a function of distance and proposes a modified algorithm for matching subgraphs of the hierarchical graphs. The plausibility-annotated nodes help to improve the performance of the matching algorithm on two hierarchical structures. To show the potential of this approach, we conduct an experiment with the SESYD dataset.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Ahuja, N., Todorovic, S.: From region based image representation to object discovery and recognition. In: Hancock, E.R., Wilson, R.C., Windeatt, T., Ulusoy, I., Escolano, F. (eds.) SSPR & SPR 2010. LNCS, vol. 6218, pp. 1–19. Springer, Heidelberg (2010)
Bomze, I., Pelillo, M., Stix, V.: Approximating the maximum weight clique using replicator dynamics. IEEE TNN 11(6), 1228–1241 (2000)
Broelemann, K., Dutta, A., Jiang, X., Lladós, J.: Hierarchical graph representation for symbol spotting in graphical document images. In: Gimel’farb, G., Hancock, E., Imiya, A., Kuijper, A., Kudo, M., Omachi, S., Windeatt, T., Yamada, K. (eds.) SSPR & SPR 2012. LNCS, vol. 7626, pp. 529–538. Springer, Heidelberg (2012)
Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. IJPRAI 18(3), 265–298 (2004)
Delalandre, M., Pridmore, T.P., Valveny, E., Locteau, H., Trupin, É.: Building synthetic graphical documents for performance evaluation. In: Liu, W., Lladós, J., Ogier, J.-M. (eds.) GREC 2007. LNCS, vol. 5046, pp. 288–298. Springer, Heidelberg (2008)
Dutta, A., Lladós, J., Bunke, H., Pal, U.: A product graph based method for dual subgraph matching applied to symbol spotting. In: Proceedings of the International Workshop on Graphics Recognition (GREC), pp. 7–11 (2013)
Dutta, A., Lladós, J., Pal, U.: A symbol spotting approach in graphical documents by hashing serialized graphs. Pattern Recogn. 46(3), 752–768 (2013)
Pelillo, M., Siddiqi, K., Zucker, S.: Matching hierarchical structures using association graphs. IEEE TPAMI 21(11), 1105–1120 (1999)
Rosin, P.L., West, G.A.W.: Segmentation of edges into lines and arcs. Image Vis. Comput. 7(2), 109–114 (1989)
Acknowledgement
This work has been partially supported by the Spanish projects TIN2009-14633-C03-03, TIN2011-24631, TIN2012-37475-C02-02, the PhD scholarship 2013FI_B2 00074, the International Research Training Group 1498 “Semantic Integration of Geospatial Information” funded by DFG (German Research Foundation), and the Doctoral Scholarship of the University of Münster.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Broelemann, K., Dutta, A., Jiang, X., Lladós, J. (2014). Hierarchical Plausibility-Graphs for Symbol Spotting in Graphical Documents. In: Lamiroy, B., Ogier, JM. (eds) Graphics Recognition. Current Trends and Challenges. GREC 2013. Lecture Notes in Computer Science(), vol 8746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44854-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-44854-0_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44853-3
Online ISBN: 978-3-662-44854-0
eBook Packages: Computer ScienceComputer Science (R0)