GEM++: A Tool for Solving Substitution-Tolerant Subgraph Isomorphism - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

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

Résumé

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.
Fichier principal
Vignette du fichier
GEM++.pdf (286.76 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01249506 , version 1 (04-01-2016)

Identifiants

Citer

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, ⟨10.1007/978-3-319-18224-7_13⟩. ⟨hal-01249506⟩
67 Consultations
170 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More