Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort.
Fred W. DePieroPublished in: ICPR (3) (2004)
Keyphrases
- graph matching
- worst case
- upper bound
- average case
- lower bound
- error bounds
- graph matching algorithm
- pairwise
- error tolerant
- object recognition
- graph edit distance
- pattern recognition
- edit distance
- np hard
- tree matching
- worst case bounds
- matching algorithm
- mistake bound
- inexact graph matching
- approximation algorithms
- point sets
- matching accuracy
- image matching
- pattern matching
- computer vision and machine learning
- subgraph isomorphism
- attributed graphs
- replicator dynamics
- bipartite graph matching
- vc dimension
- perceptron algorithm
- image features
- image processing
- neural network