The Community for Technology Leaders
RSS Icon
Issue No.08 - Aug. (2013 vol.35)
pp: 1985-1993
Dan Raviv , Technion, Israel Institute of Technology, Haifa
Ron Kimmel , Technion, Israel Institute of Technology, Haifa
Alfred M. Bruckstein , Technion, Israel Institute of Technology, Haifa
An isomorphism between two graphs is a connectivity preserving bijective mapping between their sets of vertices. Finding isomorphisms between graphs, or between a graph and itself (automorphisms), is of great importance in applied sciences. The inherent computational complexity of this problem is as yet unknown. Here, we introduce an efficient method to compute such mappings using heat kernels associated with the graph Laplacian. While the problem is combinatorial in nature, in practice we experience polynomial runtime in the number of vertices. As we demonstrate, the proposed method can handle a variety of graphs and is competitive with state-of-the-art packages on various important examples.
Laplace equations, Heating, Eigenvalues and eigenfunctions, Kernel, Shape, Complexity theory, Equations, heat kernel signatures, Graph isomorphism, graph symmetries, graph automorphisms, graph Laplacian, heat kernel maps
Dan Raviv, Ron Kimmel, Alfred M. Bruckstein, "Graph Isomorphisms and Automorphisms via Spectral Signatures", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.35, no. 8, pp. 1985-1993, Aug. 2013, doi:10.1109/TPAMI.2012.260
[1] J. Murrell, S. Kettle, and J.M. Tedder, The Chemical Bond. Wiley, 1988.
[2] L. Babai, W.M. Kantor, and E.M. Luks, "Computational Complexity and the Classification of Finite Simple Groups," Proc. Symp. Foundations of Computer Science, pp. 162-171, 1983.
[3] E.M. Lukas, "Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time," J. Computer and System Sciences, vol. 25, pp. 42-65, 1982.
[4] L. Babai and P. Codenotti, "Isomorphism of Hypergraphs of Low Rank in Moderately Exponential Time," Proc. Symp. Foundations of Computer Science, pp. 667-676, 2008.
[5] G.S. Lueker and S.K. Booth, "A Linear Time Algorithm for Deciding Interval Graph Isomorphism," J. ACM, vol. 26, no. 2, pp. 183-195, 1979.
[6] J.E. Hopcroft and J.K. Wong, "Linear Time Algorithm for Isomorphism of Planar Graphs," Proc. ACM Symp. Theory of Computing, pp. 172-184, 1974.
[7] L. Babai, D.Y. Grigoryev, and D.M. Mount, "Isomorphism of Graphs with Bounded Eigenvalue Multiplicity," Proc. ACM Symp. Theory of Computing, pp. 310-324, 1982.
[8] M. You and A.K.C. Wong, "An Algorithm for Graph Optimal Isomorphism," Proc. Int'l Conf. Pattern Recognition, pp. 316-319, 1984.
[9] X. Jiang, J. Sun, and L. Guibas, "A Fourier-Theoretic Approach for Inferring Symmetries," Proc. Canadian Conf. Computational Geometry, 2011.
[10] M. Gori, M. Maggini, and L. Sarti, "Exact and Approximate Graph Matching Using Random Walks," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 7, pp. 1100-1111, July 2005.
[11] S. Umeyama, "An Eigendecomposition Approach to Weighted Graph Matching Problems," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 5, pp. 695-703, Sept. 1988.
[12] J.R. Ullmann, "An Algorithm for Subgraph Isomorphism," J. ACM, vol. 23, no. 1, pp. 31-42, 1976.
[13] L.P. Cordella, P. Foggia, C. Sansone, and M. Vento, "Performance Evaluation of the VF Graph Matching Algorithm," Proc. Int'l Conf. Image Analysis and Processing, 1999.
[14] L.P. Cordella, P. Foggia, C. Sansone, and M. Vento, "A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 10, pp. 1367-1372, Oct. 2004.
[15] T. Junttila and P. Kaski, "Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs," Proc. Workshop Algorithm Eng. and Workshop Algorithm Eng. and Experiments, 2007.
[16] B. McKay, "Practical Graph Isomorphism," Proc. 10th Manitoba Conf. Numerical Math. and Computing, pp. 45-87, 1981.
[17] P.T. Darga, K.A. Sakallah, and I.L. Markov, "Faster Symmetry Discovery Using Sparsity of Symmetries," Proc. 45th Ann. Design Automation Conf., pp. 149-154, 2008.
[18] P. Bérard, G. Besson, and S. Gallot, "Embedding Riemannian Manifolds by Their Heat Kernel," Geometric and Functional Analysis, vol. 4, no. 4, pp. 373-398, 1994.
[19] R.M. Rustamov, "Laplace-Beltrami Eigenfunctions for Deformation Invariant Shape Representation," Proc. Symp. Geometry Processing, pp. 225-233, 2007.
[20] A. Sharma, R.P. Horaud, and D. Mateus, "3D Shape Registration Using Spectral Graph Embedding and Probabilistic Matching," Image Processing and Analysing with Graphs: Theory and Practice, pp. 441-474, CRC Press, 2012.
[21] J. Sun, M. Ovsjanikov, and L.J. Guibas, "A Concise and Provably Informative Multi-Scale Signature Based on Heat Diffusion," Proc. Symp. Geometry Processing, 2009.
[22] M. Ovsjanikov, Q. Mérigot, F. Mémoli, and L.J. Guibas, "One Point Isometric Matching with the Heat Kernel," Computer Graphics Forum, vol. 29, no. 5, pp. 1555-1564, July 2010.
[23] B. Xiao, R. Wilson, and E. Hancock, "Graph Characteristics from the Heat Kernel Trace," Pattern Recognition, vol. 42, no. 11, pp. 2589-2606, 2009.
[24] D. Raviv, A.M. Bronstein, M.M. Bronstein, and R. Kimmel, "Full and Partial Symmetries of Non-Rigid Shapes," Int'l J. Computer Vision, vol. 89, pp. 18-39, 2010.
[25] F.R.K. Chung, Spectral Graph Theory. Am. Math. Soc., 1997.
50 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool