A Fast Near-Optimal Algorithm for Approximation of Polygonal Curves.
Alexander KolesnikovPasi FräntiPublished in: ICPR (4) (2002)
Keyphrases
- learning algorithm
- cost function
- worst case
- computational complexity
- high accuracy
- experimental evaluation
- computational cost
- times faster
- optimization algorithm
- significant improvement
- minimum length
- monte carlo
- segmentation algorithm
- computationally efficient
- simulated annealing
- probabilistic model
- dynamic programming
- np hard
- search space
- search algorithm
- k means
- theoretical analysis
- optimal solution
- clustering method
- objective function
- matching algorithm
- closed form
- similarity measure
- error bounds
- genetic algorithm