The Community for Technology Leaders
Green Image
<p>In this paper, we present a novel algorithm for performing attributed graph matching. This algorithm is derived from a generalized framework for describing functionally expanded interpolators which is based on the theory of reproducing kernel Hilbert spaces. The algorithm incorporates a general approach to a wide class of graph matching problems based on attributed graphs, allowing the structure of the graphs to be based on multiple sets of attributes. No assumption is made about the adjacency structure of the graphs to be matched.</p>
Graph matching, attributed relational graphs, reproducing kernel Hilbert space theory, combinatorial optimization, neural networks, pattern matching, image processing.

M. A. van Wyk, T. S. Durrani and B. J. van Wyk, "A RKHS Interpolator-Based Graph Matching Algorithm," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 24, no. , pp. 988-995, 2002.
91 ms
(Ver 3.3 (11022016))