Uhr, Leonard


Evidential Reasoning in Parallel Hierarchical Vision Programs

arXiv.org Artificial Intelligence

This paper presents an efficient adaptation and application of the Dempster-Shafer theory of evidence, one that can be used effectively in a massively parallel hierarchical system for visual pattern perception. It describes the techniques used, and shows in an extended example how they serve to improve the system's performance as it applies a multiple-level set of processes.


A PATTERN-RECOGNITION PROGRAM THAT GENERATES, EVALUATES, AND ADJUSTS ITS OWN OPERATORS

Classics

The typical pattern-recognition program is either elaborately preprogrammed to process specific arrays of input patterns, or else it has beendesigned as a tabula rasa, with certain abilities to adjust its values, or "learn."One mode of operation of the present program is to begin with no operators at all. In this case operators are initially generated by the program at a fixed rate until some maximum number of operators is reached. The continual replacement of poor operators by new ones then tends to produce an optimum set of operators for processing the given array of inputs. Reprinted in Fegenbaum & Feldman, Computers & Thought (1963).Proc. Western Joint Computer Conference, 19: 555-570.