GB1327325A - Logical decision tree desing - Google Patents

Abstract

1327325 Character recognition systems; data processing systems INTERNATIONAL BUSINESS MACHINES CORP 16 Sept 1971 [7 Oct 1970] 43155/71 Headings G4A and G4R A descision logic tree for use in pattern recognition is designed by a data processor in dependence on the states (black/white) of manually selected points in a stored pattern. A pattern, e.g. representing an alpha-numeric character, is read from a store 102, Fig. 1, when called for by touching with a light pen 105 an appropriate word on the list 140 on display 104. The pattern is stored in a video buffer and may be displayed over matrix 150. When the pen touches any of the dots of the matrix the state of the pattern at that point is displayed (O for white, X for black) and a section of the decision tree is automatically designed in the processor. When it is believed that sufficient dots to identify the character have been touched the operator touches the pen to that one of the characters in list 130 that he thinks corresponds to the pattern. This character is automatically compared with the correct identification, originally stored in 102 with the pattern. If the character is correct it terminates the currently designed limb of the tree. If the comparison shows the character is not correct an alarm is sounded and further points are selected to extend the limb in an attempt to reach the correct termination. Instead of extending the limb it may be cancelled, or the last node of the limb or the whole tree may be cancelled. Alternatively the limb may be forced to terminate in the selected character, Another pattern is now read from store 102 to the video buffer. All the dots tested in the previous pattern or patterns are displayed, showing the states at the corresponding points of the current pattern. The logic design cycle is repeated, building up a new limb. When the tree has been completed it may be printed out at 103. In order to aid the operator's choice of dots characters may be displayed on the matrix, e.g. as a vertical stripe image. These characters do not effect the previously touched dots, which still indicate the state of the points of the pattern currently in the video buffer. The pattern in the buffer may be shifted vertically or horizontally to place it correctly on the matrix. The logic tree may be shifted, skewed, or rotated relative to the pattern.