An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing.
Evgeny LipovetskyNira DynPublished in: Adv. Comput. Math. (2007)
Keyphrases
- image registration
- cost function
- np hard
- experimental evaluation
- objective function
- computational cost
- convex hull
- preprocessing
- dynamic programming
- high accuracy
- significant improvement
- simulated annealing
- search space
- computational complexity
- optimal solution
- detection algorithm
- learning algorithm
- convergence rate
- hardware implementation
- piecewise linear
- optimization algorithm
- distance function
- tree structure
- distance metric
- times faster
- computationally efficient
- k means
- recognition algorithm
- high dimensional
- genetic algorithm
- parallel implementation
- globally optimal
- memory efficient