160 search results - page 1 / 32 » A New Algorithm for Inexact Graph Matching |
ICPR
2002
IEEE
14 years 5 months ago
2002
IEEE
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 g...
EMMCVPR
2001
Springer
13 years 9 months ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
GBRPR
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacia...
FLAIRS
2006
13 years 6 months ago
2006
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...