.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Subgraph matching
Edit dstance
Error-tolerant
Binary linear programing
Symbol spotting
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
引用论文
分享收藏Intravenous Sodium Bicarbonate Verifies Intravenous Position of Catheters in Ventilated PatientsOAAI
OAAI分享收藏
An integer linear program for substitution-tolerant subgraph isomorphism and its use for symbol spotting in technical drawings.png)
PATTERN RECOGNITIONOAAI
PATTERN RECOGNITIONIF7.6
OAAI分享收藏Mineralogy and crystal chemistry of Mn, Fe, Co, Ni, and Cu in a deep-sea Pacific polymetallic noduleOAAI
OAAI分享收藏Improving bipartite graph edit distance approximation using various search strategies使用各种搜索策略改进二部图编辑距离近似PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
查看更多内容