Approximation of graph edit distance based on Hausdorff matching.
Andreas FischerChing Y. SuenVolkmar FrinkenKaspar RiesenHorst BunkePublished in: Pattern Recognit. (2015)
Keyphrases
- graph matching
- maximum cardinality
- matching algorithm
- maximum matching
- bipartite graph
- hausdorff distance
- graph theory
- distance measure
- association graph
- graph representation
- directed graph
- subgraph isomorphism
- image matching
- matching scheme
- matching process
- minimal spanning tree
- attributed relational graph
- approximation algorithms
- random walk
- pattern matching
- keypoints
- euclidean distance
- error bounds
- probabilistic model
- feature points
- stable set
- structured data
- graph based algorithm
- outlier detection
- graph model
- feature matching
- multiscale
- graph structure
- graph theoretic
- approximation error
- adjacency matrix
- maximum weight
- graph partitioning
- link analysis
- search algorithm