An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Recognition
Feature-based correspondence: an eigenvector approach
Image and Vision Computing - Special issue: BMVC 1991
Active shape models—their training and application
Computer Vision and Image Understanding
On-line planar graph embedding
Journal of Algorithms
A Graduated Assignment Algorithm for Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Development and Comparison of Robust Methodsfor Estimating the Fundamental Matrix
International Journal of Computer Vision
Quantitative measures of change based on feature organization: eigenvalues and eigenvectors
Computer Vision and Image Understanding
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Structural Matching in Computer Vision Using Probabilistic Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Properties of Embedding Methods for Similarity Searching in Metric Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fundamentals of spherical parameterization for 3D meshes
ACM SIGGRAPH 2003 Papers
An Eigenspace Projection Clustering Method for Inexact Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Diffusion Kernels on Statistical Manifolds
The Journal of Machine Learning Research
From graphs to manifolds – weak and strong pointwise consistency of graph laplacians
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Towards a theoretical foundation for laplacian-based manifold methods
COLT'05 Proceedings of the 18th annual conference on Learning Theory
A study of graph spectra for comparing graphs and trees
Pattern Recognition
Reducing the Dimensionality of Vector Space Embeddings of Graphs
MLDM '07 Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition
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
Graph Classification Based on Dissimilarity Space Embedding
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Graph-Based Representations in Pattern Recognition and Computational Intelligence
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
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
Dissimilarity Based Vector Space Embedding of Graphs Using Prototype Reduction Schemes
MLDM '09 Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
Graph classification by means of Lipschitz embedding
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Classifier ensembles for vector space embedding of graphs
MCS'07 Proceedings of the 7th international conference on Multiple classifier systems
Spherical embedding and classification
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Finding semantic structures in image hierarchies using Laplacian graph energy
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part IV
Graph embedding using constant shift embedding
ICPR'10 Proceedings of the 20th International conference on Recognizing patterns in signals, speech, images, and videos
Graph attribute embedding via Riemannian submersion learning
Computer Vision and Image Understanding
A generic framework for median graph computation based on a recursive embedding approach
Computer Vision and Image Understanding
Dimensionality reduction for graph of words embedding
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Entropy versus heterogeneity for graphs
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Vocabulary selection for graph of words embedding
IbPRIA'11 Proceedings of the 5th Iberian conference on Pattern recognition and image analysis
Characterizing graphs using approximate von Neumann entropy
IbPRIA'11 Proceedings of the 5th Iberian conference on Pattern recognition and image analysis
Multiple classifiers for graph of words embedding
MCS'11 Proceedings of the 10th international conference on Multiple classifier systems
An information theoretic approach to learning generative graph prototypes
SIMBAD'11 Proceedings of the First international conference on Similarity-based pattern recognition
Towards the unification of structural and statistical pattern recognition
Pattern Recognition Letters
Hypergraph-based image retrieval for graph-based representation
Pattern Recognition
Similarity-Based Retrieval With Structure-Sensitive Sparse Binary Distributed Representations
Computational Intelligence
Graph characterizations from von Neumann entropy
Pattern Recognition Letters
Feature selection on node statistics based embedding of graphs
Pattern Recognition Letters
From maximum common submaps to edit distances of generalized maps
Pattern Recognition Letters
Discriminative prototype selection methods for graph embedding
Pattern Recognition
Graph Kernels from the Jensen-Shannon Divergence
Journal of Mathematical Imaging and Vision
Optimized dissimilarity space embedding for labeled graphs
Information Sciences: an International Journal
| Hi-index | 0.01 |
In this paper, we make use of the relationship between the Laplace-Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. To embark on this study, we review some of the basics of Riemannian geometry and explain the relationship between the Laplace-Beltrami operator and the graph Laplacian. Using the properties of Jacobi fields, we show how to compute an edge-weight matrix in which the elements reflect the sectional curvatures associated with the geodesic paths on the manifold between nodes. For the particular case of a constant sectional curvature surface, we use the Kruskal coordinates to compute edge weights that are proportional to the geodesic distance between points. We use the resulting edge-weight matrix to embed the nodes of the graph onto a Riemannian manifold. To do this, we develop a method that can be used to perform double centring on the Laplacian matrix computed from the edge-weights. The embedding coordinates are given by the eigenvectors of the centred Laplacian. With the set of embedding coordinates at hand, a number of graph manipulation tasks can be performed. In this paper, we are primarily interested in graph-matching. We recast the graph-matching problem as that of aligning pairs of manifolds subject to a geometric transformation. We show that this transformation is Pro-crustean in nature. We illustrate the utility of the method on image matching using the COIL database.