A unified formulation of a class of graph matching techniques

In this paper, we show that graph matching methods based on relaxation labeling, spectral graph theory and tensor theory have the same mathematical form by employing power iteration technique. Besides, the differences among these methods are also fully discussed and can be proven that distinctions have little impact on the final matching result. Moreover, we propose a fast compatibility building procedure to accelerate the preprocessing speed which is considered to be the main time consuming part of graph matching. Finally, several experiments are conducted to verify our findings.