Login / Signup
Improved quadratic time approximation of graph edit distance by combining Hausdorff matching and greedy assignment.
Andreas Fischer
Kaspar Riesen
Horst Bunke
Published in:
Pattern Recognit. Lett. (2017)
Keyphrases
</>
graph edit distance
graph matching
pairwise
edit distance
pattern matching
matching algorithm
closed form
greedy algorithm
object recognition
string edit distance
dynamic programming
feature points
image matching
approximate matching
feature selection
knn