45 search results - page 1 / 9 » Layered Graph Match with Graph Editing |
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
ICPR
2006
IEEE
14 years 6 months ago
2006
IEEE
General graph matching methods often suffer from the lack of mathematical structure in the space of graphs. Using kernel functions to evaluate structural graph similarity allows u...
GBRPR
2007
Springer
13 years 11 months ago
2007
Springer
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
ISCI
2007
13 years 4 months ago
2007
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
ICIAP
1999
ACM
13 years 9 months ago
1999
ACM
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...