The computation of polygonal approximations for 2D contours based on a concavity tree

A proposal to improve methods to obtain polygonal approximations is proposed.The required levels of detail are achieved using the concavity tree.The local Measurement ISE/CR is used as stop condition.The proposed algorithm improves the methods tested. In this work, a new proposal to improve some methods based on the merge approach to obtain polygonal approximations in 2D contours is presented. These methods use a set of candidate dominant points (CDPs) to obtain a polygonal approximation. Then, redundant candidate dominant points of the set of CDPs are deleted, and the remaining dominant points will be the polygonal approximation of the original contour. The main drawback of most of these methods is that they use all breakpoints as CDPs and most of these breakpoints depict only the noise of the original contour.Our proposal, based on a concavity tree, obtains a more reduced and significant set of CDPs. When this proposal is used by some methods based on the merge approach (the Masood methods and the Carmona method), their computation times are reduced. The experimental results show that the new proposal is efficient and improves the tested methods.

[1]  Sabri A. Mahmoud,et al.  Polygonal approximation of digital planar curves through adaptive optimizations , 2010, Pattern Recognit. Lett..

[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]  Huazhong Shu,et al.  A Mutation-Particle Swarm Algorithm for Error-Bounded Polygonal Approximation of Digital Curves , 2008, ICIC.

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

[5]  Ángel Carmona Poyato,et al.  On stop conditions about methods to obtain polygonal approximations relied on break point suppression , 2012, Image Vis. Comput..

[6]  Its'hak Dinstein,et al.  An algorithm for polygonal approximation based on iterative point elimination , 1995, Pattern Recognit. Lett..

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

[8]  Peng-Yeng Yin.  Polygonal Approximation of Digital Curves Using the State-of-the-art Metaheuristics , 2007 .

[9]  B. G. Batchelor.  Shape Descriptors for Labeling Concavity Trees , 1980, Cybern. Syst..

[10]  Gisela Klette.  Recursive computation of minimum-length polygons , 2013, Comput. Vis. Image Underst..

[11]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[12]  Its'hak Dinstein,et al.  Optimal polygonal approximation of digital curves , 1995, Pattern Recognit..

[13]  B. G. Batchelor,et al.  Hierarchical Shape Description Based upon Convex Hulls of Concavities , 1980, Cybern. Syst..

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

[15]  Huazhong Shu,et al.  A genetic algorithm with chromosome-repairing for min - # and min - epsilon polygonal approximation of digital curves , 2009, J. Vis. Commun. Image Represent..

[16]  Longin Jan Latecki,et al.  Convexity Rule for Shape Decomposition Based on Discrete Contour Evolution , 1999, Comput. Vis. Image Underst..

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

[18]  Asif Masood,et al.  Optimized polygonal approximation by dominant point deletion , 2008, Pattern Recognit..

[19]  Mohamed S. Kamel,et al.  Hierarchical representation of 2-D shapes using convex polygons: a contour-based approach , 2005, Pattern Recognit. Lett..

[20]  Marc Salotti,et al.  Optimal polygonal approximation of digitized curves using the sum of square deviations criterion , 2002, Pattern Recognit..

[21]  Francisco José Madrid-Cuevas,et al.  Dominant point detection: A new proposal , 2005, Image Vis. Comput..

[22]  Jack Sklansky,et al.  Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.

[23]  Asif Masood,et al.  A novel approach to polygonal approximation of digital curves , 2007, J. Vis. Commun. Image Represent..

[24]  PENG-YENG YIN.  Genetic Algorithms for Polygonal Approximation of Digital Curves , 1999, Int. J. Pattern Recognit. Artif. Intell..

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

[26]  Bimal Kumar Ray,et al.  A non-parametric sequential method for polygonal approximation of digital curves , 1994, Pattern Recognit. Lett..

[27]  Gabriella Sanniti di Baja,et al.  Analyzing Nonconvex 2D and 3D Patterns , 1996, Comput. Vis. Image Underst..

[28]  Isabelle Sivignon,et al.  Faithful polygonal representation of the convex and concave parts of a digital curve , 2011, Pattern Recognit..

[29]  Jianning Xu.  Hierarchical representation of 2-D shapes using convex polygons: A morphological approach , 1997, Pattern Recognit. Lett..

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

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

[32]  Theodosios Pavlidis,et al.  Segmentation of Plane Curves , 1974, IEEE Transactions on Computers.

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

[34]  M. Iri,et al.  Polygonal Approximations of a Curve — Formulations and Algorithms , 1988 .

[35]  Hong Yan,et al.  An adaptive split-and-merge method for binary image contour data compression , 2001, Pattern Recognit. Lett..

[36]  P. Nagabhushan,et al.  Boundary based corner detection and localization using new 'cornerity' index: a robust approach , 2004, First Canadian Conference on Computer and Robot Vision, 2004. Proceedings..

[37]  Yung-Nien Sun,et al.  Polygonal approximation using genetic algorithms , 1999, Pattern Recognit..

[38]  Francisco José Madrid-Cuevas,et al.  Polygonal approximation of digital planar curves through break point suppression , 2010, Pattern Recognit..

[39]  Yalan Zhou,et al.  Discrete particle swarm optimization based on estimation of distribution for polygonal approximation problems , 2009, Expert Syst. Appl..

[40]  Wu-Chih Hu,et al.  A rotationally invariant two-phase scheme for corner detection , 1996, Pattern Recognit..

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

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

[43]  Bernard A. Galler,et al.  The internal organization of the MAD translator , 1961, CACM.

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

[45]  Pepe Siy,et al.  Polygonal representation of digital planar curves through dominant point detection - a nonparametric algorithm , 2004, Pattern Recognit..

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