Datasets for the Evaluation of Substitution-Tolerant Subgraph Isomorphism
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.
- 1.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)Google Scholar
- 2.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) Google Scholar
- 3.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)Google Scholar
- 4.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) Google Scholar
- 5.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) CrossRefGoogle Scholar
- 6.Foggia, P., Sansone, C., Vento, M.: A database of graphs for isomorphism and sub-graph isomorphism benchmarking. In: CoRR, pp. 176–187 (2001)Google Scholar
- 9.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)Google Scholar