78 search results - page 6 / 16 » Graph Matching Based on Node Signatures |
SIBGRAPI
2005
IEEE
14 years 1 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
ICDAR
2009
IEEE
14 years 2 months ago
2009
IEEE
There are a number of established products on the market for wrapping—semi-automatic navigation and extraction of data—from web pages. These solutions make use of the inherent...
EMMCVPR
2005
Springer
14 years 1 months ago
2005
Springer
We consider the use of medial surfaces to represent symmetries of cts. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree o...
BMVC
2000
13 years 9 months ago
2000
We address the problem of object recognition in computer vision. We represent each model and the scene in the form of Attributed Relational Graph. A multiple region representation...
ICCV
2007
IEEE
14 years 2 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...