Stable and Informative Spectral Signatures for Graph Matching
Stable and Informative Spectral Signatures for Graph Matching
In this paper, we consider the approximate weighted graph matching problem and introduce stable and informative first and second order compatibility terms suitable for inclusion into the popular integer quadratic program formulation. Our approach relies on a rigorous analysis of stability of spectral signatures based on the graph Laplacian. In …