GEM++: A Tool for Solving Substitution-Tolerant Subgraph Isomorphism

• Published in: Graph-Based Representations in Pattern Recognition pp. 128 - 137
• Main Authors: Lerouge, Julien, Le Bodic, Pierre, Héroux, Pierre, Adam, Sébastien
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing 2015
• Series: Lecture Notes in Computer Science
• Subjects: Binary linear programming; Graph datasets; Graph matching toolkit; Subgraph isomorphism
• ISBN: 3319182234; 9783319182230
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-18224-7_13

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.