Shape recognition with a neural classifier based on a fast polygon approximation technique

Abstract A method is presented for the fast recognition of two-dimensional (2D) binary shapes with complicated form, like islands on a map or medical images. The proposed method is based on a new polygon approximation technique, which extracts suitable feature vectors with specified dimension, which characterizes a given shape. These feature vectors are used as inputs in an efficient neural based classifier for the fast recognition of the shape. The proposed technique is characterized by high speed performance, which is desired for real time applications.

[1]  Theodosios Pavlidis,et al.  Segmentation of Plane Curves , 1974, 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]  Charles M. Williams,et al.  An Efficient Algorithm for the Piecewise Linear Approximation of Planar Curves , 1978 .

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

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

[6]  Carlos Cabrelli,et al.  Automatic Representation of Binary Images , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Jack Sklansky,et al.  Fast polygonal approximation of digitized curves , 1980, Pattern Recognit..

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

[9]  Theodosios Pavlidis,et al.  A review of algorithms for shape analysis , 1978 .

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