Regularized polygonal approximation for analysis and interpretation of planar contour figures

A method for approximating contour figures with piecewise-linear polygons using a criterion function based on regularization theory is presented. In this method, it is possible to select the degree of fineness of the approximation to a given contour figure with a parameter in the criterion function, which represents a tradeoff between the fitness and the simplicity of the polygonal model. However, it is shown that, for a given figure, only a few types of stable models optimize the criterion with a variety of values of the parameter. This means that only a few types of polygons may be suitable approximations for representing the original characteristic features of the figure. This method derives such polygons automatically from the given figures. Thus, the approach shows potential as a powerful method for the analysis and interpretation of planar contour figures.<<ETX>>

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

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

[3]  M. Bertero,et al.  Ill-posed problems in early vision , 1988, Proc. IEEE.

[4]  Theodosios Pavlidis,et al.  Algorithms for Shape Analysis of Contours and Waveforms , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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