An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Spectral Algorithm for Seriation and the Consecutive Ones Problem
SIAM Journal on Computing
Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Normalized Cuts and Image Segmentation
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Laplacian Eigenmaps for dimensionality reduction and data representation
Neural Computation
Pattern Vectors from Algebraic Graph Theory
IEEE Transactions on Pattern Analysis and Machine Intelligence
Trace formula analysis of graphs
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Feature-based dissimilarity space classification
ICPR'10 Proceedings of the 20th International conference on Recognizing patterns in signals, speech, images, and videos
From points to nodes: inverse graph embedding through a lagrangian formulation
CAIP'11 Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part I
Pattern analysis with graphs: Parallel work at Bern and York
Pattern Recognition Letters
Laplacian eigenimages in discrete scale space
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
wFEM heat kernel: Discretization and applications to shape analysis and retrieval
Computer Aided Geometric Design
SMI 2013: Heat diffusion kernel and distance on surface meshes and point sets
Computers and Graphics
Surface- and volume-based techniques for shape modeling and analysis
SIGGRAPH Asia 2013 Courses
| Hi-index | 0.00 |
In this paper, we investigate the use of heat kernels as a means of embedding the individual nodes of a graph in a vector space. The reason for turning to the heat kernel is that it encapsulates information concerning the distribution of path lengths and hence node affinities on the graph. The heat kernel of the graph is found by exponentiating the Laplacian eigensystem over time. In this paper, we explore how graphs can be characterized in a geometric manner using embeddings into a vector space obtained from the heat kernel. We explore two different embedding strategies. The first of these is a direct method in which the matrix of embedding co-ordinates is obtained by performing a Young-Householder decomposition on the heat kernel. The second method is indirect and involves performing a low-distortion embedding by applying multidimensional scaling to the geodesic distances between nodes. We show how the required geodesic distances can be computed using parametrix expansion of the heat kernel. Once the nodes of the graph are embedded using one of the two alternative methods, we can characterize them in a geometric manner using the distribution of the node co-ordinates. We investigate several alternative methods of characterization, including spatial moments for the embedded points, the Laplacian spectrum for the Euclidean distance matrix and scalar curvatures computed from the difference in geodesic and Euclidean distances. We experiment with the resulting algorithms on the COIL database.