Analysis of set patterns

摘要

In recent years a number of methods have been suggested which attempt to solve the Pattern Recognition Problem using a so-called linguistic approach. A given image is represented though primitives (or signs) and the classifications are decided on the basis of the occurrence of certain primitives and their interrelation. This paper deals with the development of such a method.In the present study we consider halfplanes as primitives. Their intersections form convex polygons and the unions of the latter are arbitrary polygons. These can be then considered as approximations for arbitrary plane figures, like letters of the alphabet, drawings, etc.In the application of the method the image is prefiltered and then approximated by a polygon with sides parallel to specific directions. This determines the primitives which are present and then through a well-defined procedure the “syntax” of the figure is determined, i.e. which are the (unique) convex polygons whose union forms the figure.From that representation one can proceed in a number of different directions by using various classification techniques.