Piecewise polygonal approximation of digital curves

In this paper, we present a recursive algorithm for piecewise polygonal approximation of a digital curves. The idea behind is to look for an optimal solution while approximating the given curve segment with a set of longest and minimum line segments such that the maximum squared error is less than the given threshold. The given curve is divided into pieces and parallel processing can be applied to each piece of curve thus making it computationally more efficient. Experimental results show that the proposed method has promising results.

[1]  Nirwan Ansari,et al.  Nonparametric dominant point detection , 1991, Other Conferences.

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

[3]  Paul L. Rosin.  Assessing the Behaviour of Polygonal Approximation Algorithms , 1998, BMVC.

[4]  Yukio Sato,et al.  Piecewise linear approximation of plane curves by perimeter optimization , 1992, Pattern Recognit..

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

[6]  Peng-Yeng Yin,et al.  Ant colony search algorithms for optimal polygonal approximation of plane curves , 2003, Pattern Recognit..

[7]  F. Attneave.  Some informational aspects of visual perception. , 1954, Psychological review.

[8]  Herbert Freeman,et al.  On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

[9]  James George Dunham,et al.  Optimum Uniform Piecewise Linear Approximation of Planar Curves , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Wen-Yen Wu,et al.  Corner detection using bending value , 1995, Pattern Recognit. Lett..

[11]  Yoshisuke Kurozumi,et al.  Polygonal approximation by the minimax method , 1982, Comput. Graph. Image Process..

[12]  Terence M. Cronin,et al.  A boundary concavity code to support dominant point detection , 1999, Pattern Recognit. Lett..

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

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

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

[16]  Kumar S. Ray,et al.  Detection of significant points and polygonal approximation of digitized curves , 1992, Pattern Recognit. Lett..

[17]  Jack Sklansky,et al.  Fast polygonal approximation of digitized curves , 1980, Pattern Recognit..

[18]  Carlo Arcelli,et al.  Finding contour-based abstractions of planar patterns , 1993, Pattern Recognit..

[19]  Wen-Yen Wu,et al.  An adaptive method for detecting dominant points , 2003, Pattern Recognit..

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

[21]  Yoshisuke Kurozumi,et al.  Polygonal approximation by the minimax method , 1982, Computer Graphics and Image Processing.