Van Wyk, M.A. and Durrani, T.S. and Van Wyk, B. (2002) A RKHS interpolator-based graph matching algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24 (7). pp. 988-995. ISSN 0162-8828Full text not available in this repository. (Request a copy from the Strathclyde author)
We present an 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 (RKHS). 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.
|Keywords:||Hilbert spaces, graph theory, interpolation, pattern matching, Electrical engineering. Electronics Nuclear engineering, Artificial Intelligence, Computational Theory and Mathematics, Software, Applied Mathematics, Computer Vision and Pattern Recognition|
|Subjects:||Technology > Electrical engineering. Electronics Nuclear engineering|
|Department:||Faculty of Engineering > Electronic and Electrical Engineering|
|Depositing user:||Strathprints Administrator|
|Date Deposited:||18 Jun 2007|
|Last modified:||22 Mar 2017 09:09|