Layered 'recognition cone' networks that pre-process, classify, and describe.

A sequence of six types of pattern recognition system is examined. A program is described to illustrate some of the features developed. The first type (similar to many of the programs currently used) preprocesses by applying layers of local averaging and differencing transforms to smooth, fill in gaps and heighten contours, curves, and angles. It then applies a set of characterizers, each of which implies a set of names. The program chooses the single most high implied name. The second type combines the preprocessing transforms and the characterizers into a single operation of general type. Transforms build up a next representation of the input, while the characterizers imply the output name. The third type erases the distinction between a transform and an implication. Now all outputs are stored in the next transform layer. As the program averages information, its layers shrink, so that the system builds a cone of layers. When the program reaches the apex (a layer of only one cell that contains all the information), it chooses the single name with which it classifies the input. The fourth type is capable of choosing more than one name and, therefore, can both describe and classify the scene. The fifth type examines the interrelations among the set of names chosen. The sixth step can be taken to converse about the scene, developing an appropriate description in response to suggestions and queries. This allows the program to perform more computations and to look again on demand.