TY - GEN
T1 - A direction Change-based algorithm for polygonal approximation
AU - Liu, Han
AU - Zhang, Xiangliang
AU - Rockwood, Alyn
N1 - KAUST Repository Item: Exported on 2020-04-23
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84874570307&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84874570307
SN - 9784990644109
T3 - Proceedings - International Conference on Pattern Recognition
SP - 3586
EP - 3589
BT - ICPR 2012 - 21st International Conference on Pattern Recognition
T2 - 21st International Conference on Pattern Recognition, ICPR 2012
Y2 - 11 November 2012 through 15 November 2012
ER -