Product graph-based higher order contextual similarities for inexact subgraph matching
نویسندگان
چکیده
منابع مشابه
Product graph-based higher order contextual similarities for inexact subgraph matching
Many algorithms formulate graph matching as an optimization of an objective function of pairwise quantification of nodes and edges of two graphs to be matched. Pairwise measurements usually consider local attributes but disregard contextual information involved in graph structures. We address this issue by proposing contextual similarities between pairs of nodes. This is done by considering the...
متن کاملA Product Graph Based Method for Dual Subgraph Matching Applied to Symbol Spotting
Product graph has been shown as a way for matching subgraphs. This paper reports the extension of the product graph methodology for subgraph matching applied to symbol spotting in graphical documents. Here we focus on the two major limitations of the previous version of the algorithm: (1) spurious nodes and edges in the graph representation and (2) inefficient node and edge attributes. To deal ...
متن کاملInexact graph recognition matching for structural pattern
This paper is concerned with the inexact matching of attributed, relational graphs for structural pattern recognition. The matching procedure is based on a state space search utilizing heuristic information. Some experimental results are reported.
متن کاملExact Probabilistic Inference for Inexact Graph Matching
Inexact graph matching is a fundamental problem in computer vision applications. It crops up whenever a correspondence between two structures must be determined in the presence of structural and attribute noise. Despite the importance of the problem, graph matching techniques in computer vision tend to be extremely task specific, and sometimes lack the power a general approach would have. For e...
متن کاملA New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact graph matching is the process of finding the best possible matching between two graphs when exact matching is impossible. In this paper, we propose a new algorithm for the inexact matching problem. The new algorithm dec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2018
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2017.12.003