Orthonormal Kernel Kronecker Product Graph Mdatching
- First Online:
- Cite this paper as:
- Wyk B.J.., Wyk M.A.. (2003) Orthonormal Kernel Kronecker Product Graph Mdatching. In: Hancock E., Vento M. (eds) Graph Based Representations in Pattern Recognition. GbRPR 2003. Lecture Notes in Computer Science, vol 2726. Springer, Berlin, Heidelberg
This paper introduces a novel algorithm for performing Attributed Graph Matching (AGM). The Orthonormal Kernel Kronecker Product Graph Matching (OKKPGM) algorithm is based on the recently introduced Kronecker Product Graph Matching (KPGM) formulation. However, unlike previous algorithms based on the KPGM formulation which avoided explicit compatibility calculations, the OKKPGM algorithm obtains an estimate to the Kronecker Match Matrix (KMM) using kernel function evaluations. A permutation sub-matrix (match matrix), is then inferred from the KMM using a summation procedure.
Unable to display preview. Download preview PDF.