A linear time randomized approximation algorithm for Euclidean matching.
Mahdi ImanparastSeyed Naser HashemiPublished in: J. Supercomput. (2019)
Keyphrases
- matching algorithm
- detection algorithm
- cost function
- worst case
- learning algorithm
- improved algorithm
- search space
- theoretical analysis
- dynamic programming
- optimal solution
- preprocessing
- similarity measure
- recognition algorithm
- times faster
- high accuracy
- significant improvement
- clustering method
- tree structure
- image matching
- objective function
- computational cost
- multi objective
- pattern matching
- k means
- computational complexity
- search algorithm
- square root
- simple polygon