Improving fitting quality of polygonal approximation by using the dynamic programming technique

The dynamic programming technique is applied to improve the fitting quality of polygonal approximation. The dominant points of a digital curve are detected by applying a scale-based approach. Then, a polygonal approximation of the digital curve can be obtained by connecting its dominant points. The fitting quality of the polygonal approximation is improved by using a novel dynamic programming algorithm. The combination of the dominant point detection and the dynamic programming can produce a description that has high geometric importance and good fitting quality. Experimental results are provided and compared with several existing methods to show the excellence of the proposed method.

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

[2]  Geok Soon Hong,et al.  A scale-space filtering approach for visual feature extraction , 1995, Pattern Recognit..

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

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

[5]  Philippe Cornic,et al.  Another look at the dominant point detection of digital curves , 1997, Pattern Recognit. Lett..

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

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

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

[9]  Nicolas Pérez de la Blanca,et al.  Boundary simplification using a multiscale dominant-point detection algorithm , 1998, Pattern Recognit..

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

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

[12]  Soo-Chang Pei,et al.  The detection of dominant points on digital curves by scale-space filtering , 1992, Pattern Recognit..

[13]  Kumar S. Ray,et al.  An algorithm for polygonal approximation of digitized curves , 1992, Pattern Recognit. Lett..

[14]  Ji-Hwei Horng,et al.  An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves , 2002, Pattern Recognit. Lett..

[15]  Roland T. Chin,et al.  Scale-Based Detection of Corners of Planar Curves , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Hong Yan,et al.  An effective algorithm for the segmentation of digital plane curves - The isoparametric formulation , 1998, Pattern Recognit. Lett..

[17]  Pengfei Zhu,et al.  On Critical Point Detection of Digital Shapes , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Kumar S. Ray,et al.  A new approach to polygonal approximation , 1991, Pattern Recognit. Lett..

[19]  Azriel Rosenfeld,et al.  Frequency Domain Analysis and Synthesis of Image Pyramid Generating Kernels , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  José Manuel Iñesta Quereda,et al.  Reliable polygonal approximations of imaged real objects through dominant point detection , 1998, Pattern Recognit..

[21]  Hong Yan,et al.  Polygonal approximation of digital curves based on the principles of perceptual organization , 1997, Pattern Recognit..

[22]  Edward H. Adelson,et al.  The Laplacian Pyramid as a Compact Image Code , 1983, IEEE Trans. Commun..

[23]  Charles Ichoku,et al.  Segmentation of digital plane curves: A dynamic focusing approach , 1996, Pattern Recognit. Lett..

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

[25]  Chin-Hsing Chen,et al.  Wavelet based corner detection , 1993, Pattern Recognit..

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

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

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

[29]  P. Yin,et al.  A new method for polygonal approximation using genetic algorithms , 1998, Pattern Recognit. Lett..

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