A direction Change-based algorithm for polygonal approximation

Han Liu*, Xiangliang Zhang, Alyn Rockwood

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish (US)
Title of host publicationICPR 2012 - 21st International Conference on Pattern Recognition
Pages3586-3589
Number of pages4
StatePublished - 2012
Event21st International Conference on Pattern Recognition, ICPR 2012 - Tsukuba, Japan
Duration: Nov 11 2012Nov 15 2012

Publication series

NameProceedings - International Conference on Pattern Recognition
ISSN (Print)1051-4651

Other

Other21st International Conference on Pattern Recognition, ICPR 2012
Country/TerritoryJapan
CityTsukuba
Period11/11/1211/15/12

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition

Fingerprint

Dive into the research topics of 'A direction Change-based algorithm for polygonal approximation'. Together they form a unique fingerprint.

Cite this