An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
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
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
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
A generative model for graph matching and embedding
Computer Vision and Image Understanding
Spectral edit distance method for image clustering
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Hierarchical vibrations for part-based recognition of complex objects
Pattern Recognition
Entropy versus heterogeneity for graphs
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Learning generative graph prototypes using simplified von neumann entropy
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Characterizing graphs using approximate von Neumann entropy
IbPRIA'11 Proceedings of the 5th Iberian conference on Pattern recognition and image analysis
Supervised learning of graph structure
SIMBAD'11 Proceedings of the First international conference on Similarity-based pattern recognition
An information theoretic approach to learning generative graph prototypes
SIMBAD'11 Proceedings of the First international conference on Similarity-based pattern recognition
Pattern analysis with graphs: Parallel work at Bern and York
Pattern Recognition Letters
Graph characterizations from von Neumann entropy
Pattern Recognition Letters
Two new graphs kernels in chemoinformatics
Pattern Recognition Letters
| Hi-index | 0.01 |
This paper shows how to construct a linear deformable model for graph structure by performing principal components analysis (PCA) on the vectorised adjacency matrix. We commence by using correspondence information to place the nodes of each of a set of graphs in a standard reference order. Using the correspondences order, we convert the adjacency matrices to long-vectors and compute the long-vector covariance matrix. By projecting the vectorised adjacency matrices onto the leading eigenvectors of the covariance matrix, we embed the graphs in a pattern-space. We illustrate the utility of the resulting method for shape-analysis.