A hardware polynomial feature net for hand-printed digit recognition

Show full item record

Title: A hardware polynomial feature net for hand-printed digit recognition
Author: Rao, Arun; Anderson, Peter; Gaborski, Roger; Jaiswal, K.S.
Abstract: The need for automating the processing of an ever-increasing volume of documents combined with the availability of fast, inexpensive computers has resulted in an explosive growth in documentunderstanding algorithm development. High-volume document-processing applications (such as those required by census and revenue collection organizations) are dominated by a variety of forms. The regions of interest in forms are typically a number of handprinted fields, which must be recognized by a computer and converted to an ASCII code. A number of very successful algorithms have been developed by various researchers (Martin and Pittman (1). LeCun et al. (2). Anderson and Gaborski(3)). and the problem of recognizing isolated, handprinted characters is widely regarded as solved. The potential market for document processing systems makes it desirable to implement character recognition algorithms in low-cost, mass-produceable integrated circuits. This paper describes the hardware implementation of an algorithm which has excellent recognition accuracy and is simple in design. An automatic layout method. performance on a standard data set, SPICE simulation results and quantization issues are discussed.
Description: Appears in: Proceedings of the Third IEE International Conference on Artificial Neural Networks, 1993, pp. 36-40. Article is also available online at: http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6622&arnumber=263261&count=62&index=53
Record URI: http://hdl.handle.net/1850/3090
Date: 1993-05-25

Files in this item

Files Size Format View
PAndersonConfProc05-27-1993.pdf 400.5Kb PDF View/Open

The following license files are associated with this item:

This item appears in the following Collection(s)

Show full item record

Search RIT DML


Advanced Search

Browse