Abstract
Due to their representative power, structural descriptions have gained a great interest in the community working on graphics recognition. Indeed, graph based representations have successful been used for isolated symbol recognition. New challenges in this research field have focused on symbol recognition, symbol spotting or symbol based indexing of technical drawing.
When they are based on structural descriptions, these tasks can be expressed by means of a subgraph isomorphism search. Indeed, it consists in locating the instance of a pattern graph representing a symbol in a target graph representing the whole document image. However, there is a lack of publicly available datasets allowing to evaluate the performance of subgraph isomorphism approaches in presence of noisy data.
In this paper, we present five datasets that can be used to evaluate the performance of algorithms on several tasks involving subgraph isomorphism. Four of these datasets have been synthetically generated and allow to evaluate the search of a single instance of the pattern with or without perturbed labels. The fifth dataset corresponds to the structural description of architectural plans and allows to evaluate the search of multiple occurrences of the pattern. These datasets are made available for download. We also propose several measures to qualify each of the tasks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In the remaining of the paper, the term graph denotes a directed attributed multigraph.
- 2.
This dataset is now listed on the website of the IAPR Technical Committee #15.
- 3.
As \(n_\mathcal {S} \le n_\mathcal {G}\), if the constraint given by Eq. 8 is satisfied for \(n_\mathcal {S}\), it is also satisfied for \(n_\mathcal {G}\).
References
Le Bodic, P., Locteau, H., Adam, S., Héroux, P., Lecourtier, Y., Knippel, A.: Symbol detection using region adjacency graphs and integer linear programming. In: Proceedings of the International Conference on Document Analysis and Recognition (ICDAR’09), pp. 1320–1324 (2009)
Qureshi, R.J., Ramel, J.-Y., Barret, D., Cardot, H.: Spotting symbols in line drawing images using graph representations. In: Liu, W., Lladós, J., Ogier, J.-M. (eds.) GREC 2007. LNCS, vol. 5046, pp. 91–103. Springer, Heidelberg (2008)
Locteau, H., Adam, S., Trupin, E., Labiche, J., Héroux, P.: Symbol spotting using full visibility graph representation. In: Proceedings of the Seventh International Workshop on Graphics Recognition, pp. 49–50 (2007)
Valveny, E., Delalandre, M., Raveaux, R., Lamiroy, B.: Report on the symbol recognition and spotting contest. In: Kwon, Y.-B., Ogier, J.-M. (eds.) GREC 2011. LNCS, vol. 7423, pp. 198–207. Springer, Heidelberg (2013)
Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) SSPR&SPR 2008. LNCS, vol. 5342, pp. 287–297. Springer, Heidelberg (2008)
Foggia, P., Sansone, C., Vento, M.: A database of graphs for isomorphism and sub-graph isomorphism benchmarking. In: CoRR, pp. 176–187 (2001)
Le Bodic, P., Héroux, P., Adam, S., Lecourtier, Y.: An integer linear program for substitution-tolerant subgraph isomorphism and its use for symbol spotting in technical drawings. Pattern Recogn. 45(12), 4214–4224 (2012)
Erdös, P., Rényi, A.: On random graphs. Publicationes Math. 6, 290–297 (1959)
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 10th IAPR Workshop on Graphics Recognition, pp. 7–11 (2013)
Delalandre, M., Valveny, E., Pridmore, T., Karatzas, D.: Generation of synthetic documents for performance evaluation of symbol recognition; spotting systems. Int. J. Doc. Anal. Recogn. 13, 187–207 (2010)
di Baja, G.S., Thiel, E.: Skeltonization algorithm running on path-based distance maps. Image Vis. Comput. 14, 47–57 (1996)
Teague, M.: Image analysis via the general theory of moments. Journal of the Optical Society of America 70(8), 920–930 (1980)
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
Héroux, P., Le Bodic, P., Adam, S. (2014). Datasets for the Evaluation of Substitution-Tolerant Subgraph Isomorphism. 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_19
Download citation
DOI: https://doi.org/10.1007/978-3-662-44854-0_19
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)