Multiorder polygonal approximation of digital curves

In this paper, we propose a quick threshold-free algorithm, which computes the angular shape of a 2D object from the points of its contour. For that, we have extended the method defined in [4, 5] to a multiorder analysis. It is based on the arithmetical definition of discrete lines [11] with variable thickness. We provide a framework to analyse a digital curve at different levels of thickness. The extremities of a segment provided at a high resolution are tracked at lower resolution in order to refine their location. The method is thresholdfree and automatically provides a partitioning of a digital curve into its meaningful parts.

[1]  Isabelle Debled-Rennesson.  Estimation of tangents to a noisy discrete curve , 2004, IS&T/SPIE Electronic Imaging.

[2]  Bimal Kumar Ray,et al.  A new split-and-merge technique for polygonal approximation of chain coded curves , 1995, Pattern Recognit. Lett..

[3]  Peng-Yeng Yin.  A Tabu Search Approach to Polygonal Approximation of Digital Curves , 2000, Int. J. Pattern Recognit. Artif. Intell..

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

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

[6]  Jean-Pierre Reveillès.  Géométrie discrète, calcul en nombres entiers et algorithmique , 1991 .

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

[8]  Edward J. Delp,et al.  On detecting dominant points , 1991, Pattern Recognit..

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

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

[11]  Isabelle Debled-Rennesson,et al.  Segmentation of Discrete Curves into Fuzzy Segments , 2003, Electron. Notes Discret. Math..

[12]  Geoff A. W. West,et al.  Segmentation of edges into lines and arcs , 1989, Image Vis. Comput..

[13]  Andrew P. Witkin,et al.  Scale-Space Filtering , 1983, IJCAI.

[14]  P. Danielsson.  Euclidean distance mapping , 1980 .

[15]  Karin Wall,et al.  A fast sequential method for polygonal approximation of digitized curves , 1984, Comput. Vis. Graph. Image Process..

[16]  Alexander Kolesnikov,et al.  Reduced-search dynamic programming for approximation of polygonal curves , 2003, Pattern Recognit. Lett..

[17]  Marc Salotti.  An efficient algorithm for the optimal polygonal approximation of digitized curves , 2001, Pattern Recognit. Lett..

[18]  Wen-Yen Wu,et al.  Detecting the Dominant Points by the Curvature-Based Polygonal Approximation , 1993, CVGIP Graph. Model. Image Process..