Multiresolution Polygonal Approximation of Digital Curves

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Alexander Kolesnikov Articles by Pasi Fr?nti Articles by Xiaolin Wu

17th International Conference on Pattern Recognition (ICPR'04) - Volume 2

Cambridge UK

August 23-August 26

ISBN: 0-7695-2128-2

	ASCII Text	x
	Alexander Kolesnikov, Pasi Fr?nti, Xiaolin Wu, "Multiresolution Polygonal Approximation of Digital Curves," Pattern Recognition, International Conference on, vol. 2, pp. 855-858, 17th International Conference on Pattern Recognition (ICPR'04) - Volume 2, 2004.

	BibTex	x
	@article{ 10.1109/ICPR.2004.1334393, author = {Alexander Kolesnikov and Pasi Fr?nti and Xiaolin Wu}, title = {Multiresolution Polygonal Approximation of Digital Curves}, journal ={Pattern Recognition, International Conference on}, volume = {2}, year = {2004}, issn = {1051-4651}, pages = {855-858}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICPR.2004.1334393}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Pattern Recognition, International Conference on TI - Multiresolution Polygonal Approximation of Digital Curves SN - 1051-4651 SP855 EP858 A1 - Alexander Kolesnikov, A1 - Pasi Fr?nti, A1 - Xiaolin Wu, PY - 2004 KW - null VL - 2 JA - Pattern Recognition, International Conference on ER -

Alexander Kolesnikov, University of Joensuu, Finland

Pasi Fr?nti, University of Joensuu, Finland

Xiaolin Wu, McMaster University, Canada

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2004.1334393

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.