Engineering topics
Publications and source records attributed to Uhr, L..
A parallel-serial 'recognition cone' model is examined, taking into account the model's ability to describe scenes of objects. An actual program is presented in an English-like language. The concept of a 'description' is discussed together with possible types of descriptive information. Questions regarding the level and the variety of detail are considered along with approaches for improving the serial representations of parallel systems.
Discussion of pattern recognition programs for input data preprocessing with simultaneous or subsequent characterization, or characterization into a 'recognition cone,' or description and naming, interrelated descriptions, and conversion. A computer program is described that transforms and characterizes the input through the successive layers of a recognition cone. The program can choose and put forth names of parts of the input scene. It combines pieces of a description into interrelated wholes by using n-tuple characterizers and conducts a simple and stylized conversation about what it has seen. The technique of combining recognition cones with preprocessing transformations and characterizations is expected to contribute to technology in this field.
A brief overview is presented of six types of pattern recognition programs that: (1) preprocess, then characterize; (2) preprocess and characterize together; (3) preprocess and characterize into a recognition cone; (4) describe as well as name; (5) compose interrelated descriptions; and (6) converse. A computer program (of types 3 through 6) is presented that transforms and characterizes the input scene through the successive layers of a recognition cone, and then engages in a stylized conversation to describe the scene.
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.