Computing Optimal Assignments in Linear Time for Approximate Graph Matching.
Nils M. KriegePierre-Louis GiscardFranka BauseRichard C. WilsonPublished in: ICDM (2019)
Keyphrases
- graph matching
- error tolerant
- graph matching algorithm
- pairwise
- object recognition
- worst case
- inexact graph matching
- pattern recognition
- computer vision and machine learning
- graph edit distance
- point sets
- edit distance
- pattern matching
- image matching
- matching algorithm
- matching accuracy
- optimal solution
- replicator dynamics
- dynamic programming
- attributed graphs
- nearest neighbor
- neural network
- minimum cost
- subgraph isomorphism
- image processing