Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
A sequential optical character recognition algorithm, ideally suited for implementation by means of microprocessors with limited storage capabilities, is formulated in terms of a binary decision tree. Upper bounds on the recognition performance are derived in terms of the stability of the digitized picture elements. The design process is described in detail. The algorithm is tested on single-font typewritten characters and the experimental and theoretical results are compared. © 1983 IEEE
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
M.F. Cowlishaw
IBM Systems Journal
Leo Liberti, James Ostrowski
Journal of Global Optimization