Login / Signup
An efficient algorithm for the optimal polygonal approximation of digitized curves.
Marc Salotti
Published in:
Pattern Recognit. Lett. (2001)
Keyphrases
</>
polygonal approximation
optimal solution
worst case
dynamic programming
computationally efficient
matching algorithm
distance metric
computer vision
image segmentation
three dimensional
object recognition
expectation maximization
graph cuts
energy function
minimum length