Minimum-scan pattern recognition

Speedier and simpler pattern-recognition systems can be realized when provided with a minimum-scan reading device. For the idealized case, where the input set of patterns is finite, binary and errorless, a theorem is proved which enables the designer to predict the efficiency range of the contemplated reading device. A constructive method, which can be readily programmed for computer processing, is proposed for finding the shortest scanning path realizable for any given set. In the case of noise, scanning paths are sought which maintain a prescribed minimal "distance\´\´ between the patterns, and hence yield a prescribed level of error-detecting capability. The theorem previously proved is extended for this case, and a constructive method is proposed for finding the shortest path consistent with any specified minimal distance, for any given set of patterns.