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

Abstract : 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.
Type de document :
Communication dans un congrès
International Worksop on Graph-based Representation in Pattern Recognition, 2015, Pékin, China. pp.128-137, 2015, 〈10.1007/978-3-319-18224-7_13〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01249506
Contributeur : Pierre Héroux <>
Soumis le : lundi 4 janvier 2016 - 10:17:16
Dernière modification le : mercredi 11 octobre 2017 - 11:18:01
Document(s) archivé(s) le : jeudi 7 avril 2016 - 17:05:13

Fichier

GEM++.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Julien Lerouge, Pierre Le Bodic, Pierre Héroux, Sébastien Adam. GEM++: A Tool for Solving Substitution-Tolerant Subgraph Isomorphism. International Worksop on Graph-based Representation in Pattern Recognition, 2015, Pékin, China. pp.128-137, 2015, 〈10.1007/978-3-319-18224-7_13〉. 〈hal-01249506〉

Partager

Métriques

Consultations de
la notice

60

Téléchargements du document

78