Blossom V: a new implementation of a minimum cost perfect matching algorithm.
Vladimir KolmogorovPublished in: Math. Program. Comput. (2009)
Keyphrases
- matching algorithm
- minimum cost
- image matching
- np hard
- template matching
- spanning tree
- matching process
- hausdorff distance
- approximation algorithms
- feature matching
- capacity constraints
- network flow
- network simplex algorithm
- graph matching
- network flow problem
- shape matching
- voting scheme
- point matching
- partial matching
- pairwise
- pattern matching
- upper bound
- mobile robot
- pattern matching algorithm
- graph matching algorithm