An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Normalized String Editing Problem Revisited
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Graduated Assignment Algorithm for Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Matching by Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
On a relation between graph edit distance and maximum common subgraph
Pattern Recognition Letters
An Algorithm for Finding the Largest Approximately Common Substructures of Two Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
An energy function and continuous edit process for graph matching
Neural Computation
The String-to-String Correction Problem
Journal of the ACM (JACM)
Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Procrustes Alignment with the EM Algorithm
CAIP '99 Proceedings of the 8th International Conference on Computer Analysis of Images and Patterns
Polyhedral object recognition by indexing
Pattern Recognition
Organization of Relational Models for Scene Analysis
IEEE Transactions on Pattern Analysis and Machine Intelligence
A graph-spectral method for surface height recovery
Pattern Recognition
Tree edit distance from information theory
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Reweighted random walks for graph matching
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
| Hi-index | 0.00 |
This paper shows how the eigenstructure of the adjacency matrix can be used for the purposes of robust graph-matching. We commence from the observation that the leading eigenvector of a transition probability matrix is the steady state of the associated Markov chain. When the transition matrix is the normalised adjacency matrix of a graph, then the leading eigenvector gives the sequence of nodes of the steady state random walk on the graph. We use this property to convert the nodes in a graph into a string where the node-order is given by the sequence of nodes visited in the random walk. We match graphs represented in this way, by finding the sequence of string edit operations which minimise edit distance.