Non-bayesian Graph Matching without Explicit Compatibility Calculations.
Barend J. van WykMichaël A. van WykPublished in: SSPR/SPR (2002)
Keyphrases
- graph matching
- error tolerant
- pattern recognition
- graph matching algorithm
- pairwise
- object recognition
- edit distance
- matching algorithm
- tree matching
- matching accuracy
- graph edit distance
- subgraph isomorphism
- inexact graph matching
- replicator dynamics
- vector space
- computer vision and machine learning
- image matching
- pattern matching
- bipartite graph matching
- feature matching
- point sets
- attributed graphs
- neural network
- computer vision
- object representation
- multiscale