Topological graph theory
An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Stereo Correspondence Through Feature Grouping and Maximal Cliques
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Recognition
Introduction to statistical pattern recognition (2nd ed.)
Introduction to statistical pattern recognition (2nd ed.)
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
A Graduated Assignment Algorithm for Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
A decision-theoretic generalization of on-line learning and an application to boosting
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Structural Matching by Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Development and Comparison of Robust Methodsfor Estimating the Fundamental Matrix
International Journal of Computer Vision
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
Shape Matching and Object Recognition Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence
2D-Object Tracking Based on Projection-Histograms
ECCV '98 Proceedings of the 5th European Conference on Computer Vision-Volume I - Volume I
Shock-Based Indexing into Large Shape Databases
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Fundamentals of spherical parameterization for 3D meshes
ACM SIGGRAPH 2003 Papers
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
An Eigenspace Projection Clustering Method for Inexact Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning associative Markov networks
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Graph Edit Distance from Spectral Seriation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Bayesian Hierarchical Model for Learning Natural Scene Categories
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Effciently Solving Dynamic Markov Random Fields Using Graph Cuts
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
A Riemannian approach to graph embedding
Pattern Recognition
On the relation between multi-instance learning and semi-supervised learning
Proceedings of the 24th international conference on Machine learning
Shape matching and modeling using skeletal context
Pattern Recognition
Optimization Algorithms on Matrix Manifolds
Optimization Algorithms on Matrix Manifolds
Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Metric for Comparing Relational Descriptions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hi-index | 0.00 |
In this paper, we tackle the problem of embedding a set of relational structures into a metric space for purposes of matching and categorisation. To this end, we view the problem from a Riemannian perspective and make use of the concepts of charts on the manifold to define the embedding as a mixture of class-specific submersions. Formulated in this manner, the mixture weights are recovered using a probability density estimation on the embedded graph node coordinates. Further, we recover these class-specific submersions making use of an iterative trust-region method so as to minimise the L2 norm between the hard limit of the graph-vertex posterior probabilities and their estimated values. The method presented here is quite general in nature and allows tasks such as matching, categorisation and retrieval. We show results on graph matching, shape categorisation and digit classification on synthetic data, the MNIST dataset and the MPEG-7 database.