Data Structure And Search Procedure For Acyclic Binary Digraphs
Original Publication Date: 1980-Jan-01
Included in the Prior Art Database: 2005-Feb-12
A binary tree structure is useful in optical character recognition because of the high speed nature of the tree search. Consider a system in which an input character is presented as a matrix of ones and zeros representing black and white picture elements (pels). The input is first made to fit into a standard "video space", that is, its pels are numbered to reflect some standard centering or registration scheme. Next, it is subjected to a tree search, that is, certain of its pels are tested, and it is classified as a particular character or as unrecognizable. Exactly which pels are tested depends upon the design of the tree which is fixed and represented in read-only memory (ROM), and upon the actual input data.