Polygonal approximation of digital planar curves through vertex betweenness

Contour polygonal approximation is usually defined as a set of selected points, which describes a polygon and best represents the original contour. This paper presents a novel graph based approach to compute a polygonal approximation of a shape contour. In a graph, such points correspond to a high transitivity region of the graph. We use the vertex betweenness to measure the importance of each vertice in a graph according to the number of shortest paths where each vertice occurs. By selecting the vertices with higher vertex betweenness, a polygon which retains the main characteristics of the contour is achieved. By using benchmark curves, a comparative experiment with other commonly used algorithms is presented. Results indicate that the proposed approach produced efficient and effective polygonal approximations for digital planar curves.

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

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

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

[4]  Peng-Yeng Yin,et al.  Ant colony search algorithms for optimal polygonal approximation of plane curves , 2003, Pattern Recognit..

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

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

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

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

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

[10]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[11]  Azriel Rosenfeld,et al.  Angle Detection on Digital Curves , 1973, IEEE Transactions on Computers.

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

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

[14]  Narendra Ahuja,et al.  Matching Point Features with Ordered Geometric, Rigidity, and Disparity Constraints , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

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

[16]  Andrew V. Goldberg,et al.  Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

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

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

[19]  Alexander Kolesnikov,et al.  Polygonal Approximation of Closed Contours , 2003, SCIA.

[20]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[21]  BIMAL KUMAR RAY,et al.  Determination of optimal polygon from digital curve using L1 norm , 1993, Pattern Recognit..

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

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

[24]  Shinn-Ying Ho,et al.  An efficient evolutionary algorithm for accurate polygonal approximation , 2001, Pattern Recognit..

[25]  C. V. Jawahar,et al.  Polygonal Approximation of Closed Curves across Multiple Views , 2002, ICVGIP.

[26]  Peng-Yeng Yin,et al.  A discrete particle swarm algorithm for optimal polygonal approximation of digital curves , 2004, J. Vis. Commun. Image Represent..

[27]  Jia-Guu Leu,et al.  Polygonal approximation of 2-D shapes through boundary merging , 1988, Pattern Recognit. Lett..

[28]  Ninad Thakoor,et al.  Hidden Markov Model-Based Weighted Likelihood Discriminant for 2-D Shape Classification , 2007, IEEE Transactions on Image Processing.

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