Abstract
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the lazy 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 to be effective.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30(1–7), 107–117 (1998)
Chung, F.R.K.: Spectral Graph Theory. In: American Mathmatical Society (Ed.). CBMS series, vol. 92 (1997)
Chung, F.R.K., Yau, S.-T.: Discrete green’s functions. J. Combin. Theory Ser., 191–214 (2000)
Gori, M., Maggini, M., Sarti, L.: Graph matching using random walks. In: ICPR 2004, pp. III: 394–397 (2004)
Kondor, R., Lafferty, J.: Diffusion kernels on graphs and other discrete structures. In: 19th Intl. Conf. on Machine Learning (ICML) [ICM02]. (2002)
Lovász, L.: Random walks on graphs: A survey. Combinatorics, Paul Erds is eighty 2, 353–397 (1996)
Luo, B., Hancock, E.R.: Structural graph matching using the em algorithm and singular value decomposition. IEEE PAMI 23(10), 1120–1136 (2001)
Meila, M., Shi, J.: A random walks view of spectral segmentation. In: NIPS, pp. 873–879 (2000)
Pelillo, M.: Replicator equations, maximal cliques, and graph isomorphism. Neural Computation 11, 1933–1955 (1999)
Pelillo, M., Siddiqi, K., Zucker, S.W.: Attributed tree matching and maximum weight cliques. In: ICIAP 1999-10th Int. Conf. on Image Analysis and Processing, pp. 1154–1159. IEEE Computer Society Press, Los Alamitos (1999)
Prim, R.C.: Shortest connection networks and some generalisations. The Bell System Technical Journal 36, 1389–1401 (1957)
Qiu, H., Hancock, E.R.: Spectral simplification of graphs. In: Pajdla, T., Matas, J(G.) (eds.) ECCV 2004. LNCS, vol. 3024, pp. 114–126. Springer, Heidelberg (2004)
Robles-Kelly, A., Hancock, E.R.: Graph edit distance from spectral seriation. IEEE TPAMI 27, 365–378 (2005)
Robles-Kelly, A., Hancock, E.R.: String edit distance, random walks and graph matching. IJPRAI 18, 315–327 (2005)
Saerens, M., Fouss, F., Yen, L., Dupont, P.E.: The principal components analysis of a graph, and its relationships to spectral clustering. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS, vol. 3201, pp. 371–383. Springer, Heidelberg (2004)
Sood, V., Redner, S., ben-Avraham, D.: First-passage properties of the erdoscrenyi random graph. J. Phys. A: Math. Gen., 109–123 (2005)
Torsello, A., Hancock, E.R.: Computing approximate tree edit distance using relaxation labelling. In: 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 125–136 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qiu, H., Hancock, E.R. (2006). Spanning Trees from the Commute Times of Random Walks on Graphs. In: Campilho, A., Kamel, M. (eds) Image Analysis and Recognition. ICIAR 2006. Lecture Notes in Computer Science, vol 4142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11867661_34
Download citation
DOI: https://doi.org/10.1007/11867661_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44894-5
Online ISBN: 978-3-540-44896-9
eBook Packages: Computer ScienceComputer Science (R0)