Graph Matching using Commute Time Spanning Trees

This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kernel of the graph and can be computed from the spectrum of the graph Laplacian. We characterise the random walk using the commute time between nodes, and show how this quantity may be computed from the Laplacian spectrum using the discrete Green's function. We use the commute-time to locate the minimum spanning tree of the graph. The spanning trees located using commute time prove to be stable to structural variations. We match the graphs by applying a tree-matching method to the spanning trees. We experiment with the method on synthetic and real-world image data, where it proves to be effective.

• Type: Conference
• Year: 2006
• Where: ICPR
• Authors: Edwin R. Hancock, Huaijun Qiu
• Keywords: Commute Time, Computer Vision, Graph Laplacian, Graph Matching, ICPR 2006