Multiresolution Polygonal Approximation of Digital Curves

Authors:
Alexander Kolesnikov;Pasi Franti;Xiaolin Wu
Affiliations:
University of Joensuu, Finland;University of Joensuu, Finland;McMaster University, Canada
Venue:
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
Year:
2004

Citing 0
Cited 2

Polygonal approximation of closed discrete curves

Pattern Recognition
Tabu split and merge for the simplification of polygonal curves

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose optimal split algorithm for multiresolution polygonal approximation of digital curves. Instead of using a sequence of heuristic split steps as in the previous methods, we apply optimal approximation to obtain the next (higher) resolution levels using the previous (lower) resolution level as starting point. We compare the proposed approach against fast heuristic multiresolution algorithm based on a merge strategy under the L驴 error measure.