Fast polygonal approximation of digital curves

In this paper, we have extended the approach defined in to a multiorder analysis. The approach is based on the arithmetical definition of discrete lines with variable thickness. We provide a framework to analyse a digital curve at different levels of thickness. The extremities points of a segment provided at a high resolution are tracked at lower resolution in order to refine their locations. The high resolution level is automatically defined from the stability of the number of segments between two consecutive levels. The method is threshold-free and automatically provides a partitioning of a digital curve into its meaningful parts.

[1]  Andrew P. Witkin,et al.  Scale-space filtering: A new approach to multi-scale description , 1984, ICASSP.

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

[3]  Karin Wall,et al.  Abstract of papers accepted for publication PaperA fast sequential method for polygonal approximation of digitized curves , 1984 .

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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