An interpolator-based network for graph matching

An interpolator-based network for image matching is presented. Network weights are determined using a generalized framework for describing functionally expanded interpolators which is based on the theory of reproducing kernel Hilbert spaces (RKHS). The algorithm implicitly assumes that images can be represented using attributed undirected relational graphs, thereby reducing the matching problem to the inference of a permutation sub-matrix from the interpolator-based network. The algorithm incorporates a general approach to a wide class of graph-based matching problems.