Polygonal approximations that minimize the number of inflections

Consider the problem of processing shape information derived from a noisy source such as a digital scanner. The object is to construct a polygon or a closed curve that matches the input polygon to within a fixed error tolerance and maximizes some intuitive notion of “smoothness and simplicity”. Part of this goal should be to minimize the number of inflections. The algorithm presented here finds an inflectionminimizing polygonal approximation and produces a data structure that characterizes a set of closed curves that fall within the error tolerance and minimize the number of inflections. The algorithm runs in linear time, is reasonably fast in practice, and can be implemented in low-precision integer arithmetic.

[1]  John D. Hobby,et al.  Smoothing Digitized Contours , 1988 .

[2]  James Robergé.  A data reduction algorithm for planar curves , 1985, Comput. Vis. Graph. Image Process..

[3]  Hiroshi Aoyama,et al.  A piecewise linear approximation method preserving visual feature points of original figures , 1991, CVGIP Graph. Model. Image Process..

[4]  David Lee,et al.  A new zero-crossing-based discontinuity detector , 1993, IEEE Trans. Image Process..

[5]  Karin Wall,et al.  A fast sequential method for polygonal approximation of digitized curves , 1984, Comput. Vis. Graph. Image Process..

[6]  Jack Sklansky,et al.  Minimum-Perimeter Polygons of Digitized Silhouettes , 1972, IEEE Transactions on Computers.

[7]  Michel Gangnet.  Approximation of Digitized Contours , 1988 .

[8]  Yee-Hong Yang,et al.  Dynamic strip algorithm in curve fitting , 1990, Comput. Vis. Graph. Image Process..

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

[10]  Ivan Tomek,et al.  Two Algorithms for Piecewise-Linear Continuous Approximation of Functions of One Variable , 1974, IEEE Transactions on Computers.

[11]  Geoff A. W. West,et al.  Segmentation of edges into lines and arcs , 1989, Image Vis. Comput..

[12]  Hiroshi Imai,et al.  Computational-geometric methods for polygonal approximations of a curve , 1986, Comput. Vis. Graph. Image Process..

[13]  Yoshisuke Kurozumi,et al.  Polygonal approximation by the minimax method , 1982, Comput. Graph. Image Process..

[14]  Layne T. Watson,et al.  Spline-based recognition of straight lines and curves in engineering line drawings , 1988, Image Vis. Comput..

[15]  Charles M. Williams,et al.  Bounded straight-line approximation of digitized planar curves and lines , 1981 .

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

[17]  Ugo Montanari,et al.  A note on minimal length polygonal approximation to a digitized contour , 1970, CACM.

[18]  Jhing-Fa Wang,et al.  An Adaptive Reduction Procedure for the Piecewise Linear Approximation of Digitized Curves , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Jack Sklansky,et al.  Recognition of convex blobs , 1970, Pattern Recognit..

[20]  Michael L. Baird.  Structural Pattern Recognition , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  Larry S. Davis,et al.  Shape Matching Using Relaxation Techniques , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[22]  R.M. McElhaney,et al.  Algorithms for graphics and image processing , 1983, Proceedings of the IEEE.

[23]  Theodosios Pavlidis,et al.  Polygonal Approximations by Newton's Method , 1977, IEEE Transactions on Computers.

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

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

[26]  Antonio Albano,et al.  Representation of Digitized Contours in Terms of Conic Arcs and Straight-Line Segments , 1974, Comput. Graph. Image Process..

[27]  Charles M. Williams,et al.  An Efficient Algorithm for the Piecewise Linear Approximation of Planar Curves , 1978 .

[28]  F. Badi'i,et al.  Functional approximation of planar curves via adaptive segmentation , 1982 .