A RKHS interpolator-based graph matching algorithm

M.A. Van Wyk, T.S. Durrani, B. Van Wyk

Research output: Contribution to journalArticlepeer-review

44 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)988-995
Number of pages7
JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
Issue number7
Publication statusPublished - 2002


  • Hilbert spaces
  • graph theory
  • interpolation
  • pattern matching


Dive into the research topics of 'A RKHS interpolator-based graph matching algorithm'. Together they form a unique fingerprint.

Cite this