A Non-heuristic Dominant Point Detection Based on Suppression of Break Points

This paper presents a non-heuristic and control parameter independent dominant point detection method. It is based on the suppression of break points and provides a more balanced performance than the recent break point suppression methods. It is made non-heuristic using an analytical error bound for digitizing a line segment. It provides a good combination of compression ratio and error metrics by avoiding both over-fitting and under-fitting.

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

[2]  Maylor K. H. Leung,et al.  Reliability / precision uncertainity in shape fitting problems , 2010, 2010 IEEE International Conference on Image Processing.

[3]  Thomas K. Peucker,et al.  2. Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or its Caricature , 2011 .

[4]  Nirwan Ansari,et al.  Non-parametric dominant point detection , 1991, Pattern Recognition.

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

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

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

[8]  Alexander Kolesnikov,et al.  Data reduction of large vector graphics , 2005, Pattern Recognit..

[9]  Murray Shanahan,et al.  A fast evaluation criterion for the recognition of occluded shapes , 2007, Robotics Auton. Syst..

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

[11]  Hiok Chai Quek,et al.  A parameter independent line fitting method , 2011, The First Asian Conference on Pattern Recognition.

[12]  Alexandre Faure,et al.  Tangential cover for thick digital curves , 2009, Pattern Recognit..

[13]  Alexander Kolesnikov,et al.  Polygonal approximation of closed discrete curves , 2007, Pattern Recognit..

[14]  James H. Elder,et al.  Image Editing in the Contour Domain , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

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

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

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

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

[19]  Paul L. Rosin.  Assessing the behaviour of polygonal approximation algorithms , 2003, Pattern Recognit..

[20]  Thanh Phuong Nguyen,et al.  A discrete geometry approach for dominant point detection , 2011, Pattern Recognit..

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

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

[23]  Dilip K. Prasad,et al.  Polygonal Representation of Digital Curves , 2012 .

[24]  Farzin Mokhtarian,et al.  Scale-Based Description and Recognition of Planar Curves and Two-Dimensional Shapes , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[25]  Bimal Kumar Ray,et al.  An algorithm for detection of dominant points and polygonal approximation of digitized curves , 1992, Pattern Recognit. Lett..

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

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