Multiresolution polygonal approximation of digital curves

Alexander Kolesnikov, Pasi Fränti, Xiaolin Wu · Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004. · 2004

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

Read the paper · More papers on PaperTik