Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
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
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Hendrik F. Hamann
InterPACK 2013
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science