DocumentCode
595498
Title
A direction Change-based algorithm for polygonal approximation
Author
Han Liu ; Xiangliang Zhang ; Rockwood, A.
fYear
2012
fDate
11-15 Nov. 2012
Firstpage
3586
Lastpage
3589
Abstract
A linear-time algorithm is proposed for polygonal approximation of digital curves. The direction changes of the x- and y-coordinates are traced to generate a new, compact representation of curves. The algorithm, Direction Change-based Polygonal Approximation (DCPA), has two advantages: linear time complexity and insensitivity to parameter setting. Benchmark results demonstrate the competitive performance of DCPA using standard assessment techniques.
Keywords
computational complexity; geometry; image representation; polynomial approximation; DCPA; digital curves; direction change-based algorithm; direction change-based polygonal approximation; insensitivity; linear time complexity; linear-time algorithm; parameter setting; x-coordinates; y-coordinates; Algorithm design and analysis; Approximation algorithms; Approximation methods; Benchmark testing; Shape; Time complexity;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition (ICPR), 2012 21st International Conference on
Conference_Location
Tsukuba
ISSN
1051-4651
Print_ISBN
978-1-4673-2216-4
Type
conf
Filename
6460940
Link To Document