Minimum cost subgraph matching using a binary linear program - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Pattern Recognition Letters Année : 2016

Minimum cost subgraph matching using a binary linear program

Résumé

This paper presents a binary linear program for the Minimum Cost Subgraph Matching (MCSM) problem. MCSM is an extension of the subgraph isomorphism problem where the matching tolerates substitutions of attributes and modifications of the graph structure. The objective function proposed in the formulation can take into account rich attributes (e.g. vectors mixing nominal and numerical values) on both vertices and edges. Some experimental results obtained on an application-dependent dataset concerning the spotting of symbols on technical drawings show that the approach obtains better performance than a previous approach which is only substitution-tolerant.
Fichier principal
Vignette du fichier
author-version.pdf (546.38 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02110355 , version 1 (27-05-2019)

Identifiants

Citer

Julien Lerouge, Maroua Hammami, Pierre Héroux, Sébastien Adam. Minimum cost subgraph matching using a binary linear program. Pattern Recognition Letters, 2016, 71, pp.45-51. ⟨10.1016/j.patrec.2015.11.026⟩. ⟨hal-02110355⟩
68 Consultations
382 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More