Picture of scraped petri dish

Scrape below the surface of Strathprints...

Explore world class Open Access research by researchers at the University of Strathclyde, a leading technological university.

Explore

A RKHS interpolator-based graph matching algorithm

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-8828

Full text not available in this repository. (Request a copy from the Strathclyde author)

Abstract

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.