GEM++: A Tool for Solving Substitution-Tolerant Subgraph Isomorphism
The substitution-tolerant subgraph isomorphism is a particular error-tolerant subgraph matching that allows label substitutions for both vertices and edges. Such a matching is often required in pattern recognition applications since graphs extracted from images are generally labeled with features vectors computed from raw data which are naturally subject to noise. This paper describes an extended version of a Binary Linear Program (BLP) for solving this class of graph matching problem. The paper also presents GEM++, a software framework that implements the BLP and that we have made available for the research community. GEM++ allows the processing of different sub-problems (induced isomorphism or not, directed graphs or not) with complex labelling of vertices and edges. We also present some datasets available for evaluating future contributions in this field.
KeywordsBinary linear programming Subgraph isomorphism Graph matching toolkit Graph datasets
Unable to display preview. Download preview PDF.
- 1.Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: Performance evaluation of the VF graph matching algorithm. In: Proc. of the Int’l Conf. on Image Analys. and Proc., pp. 1172–1177 (1999)Google Scholar
- 6.Foggia, P., Sansone, C., Vento, M.: A database of graphs for isomorphism and sub-graph isomorphism benchmarking. In: Proc. Third IAPR TC-15 Int’l Workshop Graph Based Representations, pp. 176–187 (2001)Google Scholar
- 7.Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman & Co. (1979)Google Scholar
- 10.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: Proc. of the Int’l Conf. on Doc. Analys. and Recog., pp. 1320–1324 (2009)Google Scholar