An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Edge-Labeling Using Dictionary-Based Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Feature-based correspondence: an eigenvector approach
Image and Vision Computing - Special issue: BMVC 1991
Illumination Planning for Object Recognition Using Parametric Eigenspaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Active shape models—their training and application
Computer Vision and Image Understanding
Structural Matching by Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Matching With a Dual-Step EM Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural matching with active triangulations
Computer Vision and Image Understanding
Error Correcting Graph Matching: On the Influence of the Underlying Cost Function
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shock Graphs and Shape Matching
International Journal of Computer Vision
Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Structural Matching in Computer Vision Using Probabilistic Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Laplacian Eigenmaps for dimensionality reduction and data representation
Neural Computation
Correspondence Matching with Modal Clusters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Analysis of Planar Shapes Using Geodesic Paths on Shape Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Central Clustering of Attributed Graphs
Machine Learning
Diffusion Kernels on Statistical Manifolds
The Journal of Machine Learning Research
Pattern Vectors from Algebraic Graph Theory
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning Shape-Classes Using a Mixture of Tree-Unions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering
International Journal of Computer Vision
A spectral approach to learning structural variations in graphs
Pattern Recognition
Graph clustering using the weighted minimum common supergraph
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
ACM attributed graph clustering for learning classes of images
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Trace formula analysis of graphs
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Graph descriptors from B-matrix representation
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
High efficiency and quality: large graphs matching
Proceedings of the 20th ACM international conference on Information and knowledge management
Discriminative features for image classification and retrieval
Pattern Recognition Letters
Pattern analysis with graphs: Parallel work at Bern and York
Pattern Recognition Letters
Invariants of distance k-graphs for graph embedding
Pattern Recognition Letters
High efficiency and quality: large graphs matching
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient geometric graph matching using vertex embedding
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Hi-index | 0.00 |
This paper shows how to construct a generative model for graph structure through the embedding of the nodes of the graph in a vector space. We commence from a sample of graphs where the correspondences between nodes are unknown ab initio. We also work with graphs where there may be structural differences present, i.e. variations in the number of nodes in each graph and their edge structure. We characterise the graphs using the heat-kernel, and this is obtained by exponentiating the Laplacian eigensystem with time. The idea underpinning the method is to embed the nodes of the graphs into a vector space by performing a Young-Householder decomposition of the heat-kernel into an inner product of node co-ordinate matrices. The co-ordinates of the nodes are determined by the eigenvalues and eigenvectors of the Laplacian matrix, together with a time-parameter which can be used to scale the embedding. Node correspondences are located by applying Scott and Longuet-Higgins algorithm to the embedded nodes. We capture variations in graph structure using the covariance matrix for corresponding embedded point positions. We construct a point-distribution model for the embedded node positions using the eigenvalues and eigenvectors of the covariance matrix. We show how to use this model to both project individual graphs into the eigenspace of the point position covariance matrix and how to fit the model to potentially noisy graphs to reconstruct the Laplacian matrix. We illustrate the utility of the resulting method for shape analysis using data from the Caltech-Oxford and COIL databases.