An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Replicator equations, maximal cliques, and graph isomorphism
Neural Computation
Journal of Combinatorial Theory Series A
Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Diffusion Kernels on Graphs and Other Discrete Input Spaces
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Attributed Tree Matching and Maximum Weight Cliques
ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
Graph matching using Random Walks
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 3 - Volume 03
Graph Edit Distance from Spectral Seriation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Vectors from Algebraic Graph Theory
IEEE Transactions on Pattern Analysis and Machine Intelligence
Indexing Hierarchical Structures Using Graph Spectra
IEEE Transactions on Pattern Analysis and Machine Intelligence
Polytopal Graph Complexity, Matrix Permanents, and Embedding
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
A robust Graph Transformation Matching for non-rigid registration
Image and Vision Computing
Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Pattern analysis with graphs: Parallel work at Bern and York
Pattern Recognition Letters
Hi-index | 0.01 |
This paper exploits the properties of the commute time for the purposes of graph simplification and 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. In this paper, we explore two different, but essentially dual, simplified graph representations delivered by the commute time. The first representation decomposes graphs into concentric layers. To do this we augment the graph with an auxiliary node which acts as a heat source. We use the pattern of commute times from this node to decompose the graph into a sequence of layers. Our second representation is based on the minimum spanning tree of the commute time matrix. 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.