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.
|Number of pages||7|
|Journal||IEEE Transactions on Pattern Analysis and Machine Intelligence|
|Publication status||Published - 2002|
- Hilbert spaces
- graph theory
- pattern matching