Polygonal representation of digital planar curves through dominant point detection - a nonparametric algorithm

We describe a new algorithm that detects a set of feature points on the boundary of an 8-connected shape that constitute the vertices of a polygonal approximation of the shape itself. The set of feature points (nodes) is a ranked subset of the original shape points whose connected left and right arm extents cover the entire shape. Nodes are ranked based on their strength (in terms of their importance to other boundary points), length of support region, and distance from the centroid. The polygon obtained by linking the detected nodes approximates the contour in an intuitive way. The proposed algorithm does not require an input parameter and works well for shapes with features of multiple sizes.

[1]  Ioannis Pitas,et al.  Digital Image Processing Algorithms , 1993 .

[2]  Luciano da Fontoura Costa,et al.  Shape Analysis and Classification: Theory and Practice , 2000 .

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

[4]  Cristina Urdiales,et al.  Corner detection by means of contour local vectors , 2002 .

[5]  T. Pavlidis.  Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.

[6]  Azriel Rosenfeld,et al.  An Improved Method of Angle Detection on Digital Curves , 1975, IEEE Transactions on Computers.

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

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

[9]  Du-Ming Tsai,et al.  Curve fitting approach for tangent angle and curvature measurements , 1994, Pattern Recognit..

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

[11]  Bimal Kumar Ray,et al.  ACORD--an adaptive corner detector for planar curves , 2003, Pattern Recognit..

[12]  Dmitry Chetverikov,et al.  A Simple and Efficient Algorithm for Detection of High Curvature Points in Planar Curves , 2003, CAIP.

[13]  Keiichi Abe,et al.  Towards a Hierarchical Contour Description via Dominant Point Detection , 1994, IEEE Trans. Syst. Man Cybern. Syst..

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

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

[16]  F. Arrebola,et al.  Corner detection by means of adaptively estimated curvature function , 2000 .

[17]  A. Melkman,et al.  On Polygonal Chain Approximation , 1988 .

[18]  S. Marshall,et al.  Review of shape coding techniques , 1989, Image Vis. Comput..

[19]  Cristina Urdiales,et al.  Non-parametric planar shape representation based on adaptive curvature functions , 2002, Pattern Recognit..

[20]  Martin A. Fischler,et al.  Locating Perceptually Salient Points on Planar Curves , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

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

[22]  Richard Neumann,et al.  Extraction of dominant points by estimation of the contour fluctuations , 2002, Pattern Recognit..

[23]  James C. Bezdek,et al.  Curvature and Tangential Deflection of Discrete Arcs: A Theory Based on the Commutator of Scatter Matrix Pairs and Its Application to Vertex Detection in Planar Shape Data , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

[26]  C. P. Chau,et al.  New nonparametric dominant point detection algorithm , 2001 .

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

[28]  Joon Hee Han,et al.  Chord-to-point distance accumulation and planar curvature: a new approach to discrete curvature , 2001, Pattern Recognit. Lett..

[29]  Larry S. Davis,et al.  A Corner-Finding Algorithm for Chain-Coded Curves , 1977, IEEE Transactions on Computers.

[30]  Mohan S. Kankanhalli.  An adaptive dominant point detection algorithm for digital curves , 1993, Pattern Recognit. Lett..

[31]  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.

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

[33]  Hong Yan,et al.  A curve bend function based method to characterize contour shapes , 1997, Pattern Recognit..

[34]  Mark H. Singer,et al.  Reduced resolution and scale space for dominant feature detection in contours , 2001, Pattern Recognit..

[35]  Azriel Rosenfeld,et al.  A method of curve partitioning using arc-chord distance , 1987, Pattern Recognit. Lett..