Graphical models for graph matching: Approximate models and optimal algorithms
- 1 February 2005
- journal article
- Published by Elsevier BV in Pattern Recognition Letters
- Vol. 26 (3), 339-346
- https://doi.org/10.1016/j.patrec.2004.10.022
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- An eigenspace projection clustering method for inexact graph matchingIEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- A RKHS interpolator-based graph matching algorithmIEEE Transactions on Pattern Analysis and Machine Intelligence, 2002
- Multiscale Bayesian segmentation using a trainable context modelIEEE Transactions on Image Processing, 2001
- Matching hierarchical structures using association graphsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1999
- A graph distance metric based on the maximal common subgraphPattern Recognition Letters, 1998
- A graduated assignment algorithm for graph matchingIEEE Transactions on Pattern Analysis and Machine Intelligence, 1996
- Structural matching in computer vision using probabilistic relaxationIEEE Transactions on Pattern Analysis and Machine Intelligence, 1995
- Feature-based correspondence: an eigenvector approachImage and Vision Computing, 1992
- A tutorial on hidden Markov models and selected applications in speech recognitionProceedings of the IEEE, 1989
- Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern AnalysisIEEE Transactions on Systems, Man, and Cybernetics, 1979