A direction Change-based algorithm for polygonal approximation

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.

[1]  Asif Masood,et al.  Dominant point detection by reverse polygonization of digital curves , 2008, Image Vis. Comput..

[2]  Urs Ramer,et al.  An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..

[3]  Paul L. Rosin.  Techniques for Assessing Polygonal Approximations of Curves , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Juan Carlos Pérez-Cortes,et al.  Optimum polygonal approximation of digitized curves , 1994, Pattern Recognit. Lett..

[5]  David G. Lowe,et al.  Three-Dimensional Object Recognition from Single Two-Dimensional Images , 1987, Artif. Intell..

[6]  Trevor J. Davis.  Fast Decomposition of Digital Curves into Polygons Using the Haar Transform , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Thanh Phuong Nguyen,et al.  Fast and robust dominant points detection on digital curves , 2009, 2009 16th IEEE International Conference on Image Processing (ICIP).

[8]  Partha Bhowmick,et al.  Fast Polygonal Approximation of Digital Curves Using Relaxed Straightness Properties , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Thanh Phuong Nguyen,et al.  A Multi-scale Approach to Decompose a Digital Curve into Meaningful Parts , 2010, 2010 20th International Conference on Pattern Recognition.

[10]  Roland T. Chin,et al.  On the Detection of Dominant Points on Digital Curves , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  A. Tsybakov,et al.  Optimal change-point estimation from indirect observations , 2004, math/0407396.

[12]  Pepe Siy,et al.  A new algorithm for dominant points detection and polygonization of digital curves , 2003, Pattern Recognit..

[13]  Debranjan Sarkar.  A simple algorithm for detection of significant vertices for polygonal approximation of chain-coded curves , 1993, Pattern Recognit. Lett..

[14]  D. J. Wheeler,et al.  A Block-sorting Lossless Data Compression Algorithm , 1994 .