OPTIMAL ALGORITHM FOR THE RECOGNITION OF CERTAIN SEQUENCES OF IMAGES,
FOREIGN TECHNOLOGY DIV WRIGHT-PATTERSON AFB OHIO
Pagination or Media Count:
The problem of the recognition of pattern sequences is considered with respect to a line of typewritten text since in conventional typographical text the spaces between letters are particularly difficult to distinguish and a line of text cannot be subdivided into discrete recognizable signs, the problem of recognition of the entire line must be considered. The recognition of an entire line by comparing it with all the possible standard lines of test is an infeasible problem. Nevertheless, the problem of recognition of a line of typewritten text can be formulated and solved on the basis of certain assumptions concerning the properties of the line image. In this connection it is shown an exact solution of the problem of locating the standard line that is most similar correlates with the line image that must be recognized, requires a comparatively small volume of calculations and memory capacity. As in the case of any other pattern recognition problem this can be accomplished by first constructing a mathematical model describing all the possible images presented for recognition i.e., in this case all the possible images representing lines of typewritten text.