Geometry and complexity of O'Hara's algorithm.
Matjaz KonvalinkaIgor PakPublished in: Adv. Appl. Math. (2009)
Keyphrases
- computational complexity
- space complexity
- experimental evaluation
- worst case
- matching algorithm
- computational cost
- times faster
- detection algorithm
- optimization algorithm
- recognition algorithm
- particle swarm optimization
- np hard
- complexity analysis
- preprocessing
- high accuracy
- configuration space
- tree structure
- improved algorithm
- convex hull
- linear complexity
- theoretical analysis
- structure from motion
- segmentation algorithm
- genetic algorithm
- computationally efficient
- dynamic programming
- lower bound
- similarity measure
- image sequences