.png){kind=icon}
.png){kind=icon}
Return
Minimum cost subgraph matching using a binary linear program
.png){kind=icon}
OA
AI
DOI：10.1016/j.patrec.2015.11.026.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C)2015 Elsevier B.V. All rights reserved.
Keywords:
Subgraph matching
Edit dstance
Error-tolerant
Binary linear programing
Symbol spotting
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
7.9K
Citations:
1.6W