loading...
Multiresolution Polygonal Approximation of Digital Curves
Cambridge UK August 23-August 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2004.133439317th International Conference on Patt ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Alexander Kolesnikov, University of Joensuu, Finland
Pasi Fr?nti, University of Joensuu, Finland
Xiaolin Wu, McMaster University, Canada
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.
Citation:
Alexander Kolesnikov, Pasi Fr?nti, Xiaolin Wu, "Multiresolution Polygonal Approximation of Digital Curves," icpr, vol. 2, pp.855-858, 17th International Conference on Pattern Recognition (ICPR'04) - Volume 2, 2004
Usage of this product signifies your acceptance of the Terms of Use.