The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (1990 vol.12)
pp: 1210-1217
ABSTRACT
<p>A general pattern-recognition procedure for application to unconstrained alphanumeric characters is presented. The procedure is designed to allow hierarchical redescription of the input images in terms of significant elements only, and formal developments are given within the framework of elementary phrase-structure grammars. The extraction of the primitives associated with the terminal vocabularies of the grammars is always deterministic, and the productions of the parsers are characterized by a significant degree of topological fidelity. Preliminary experimental results indicate recognition rates comparable to the state of the art, but with a considerable reduction in computing time.</p>
INDEX TERMS
primitive extraction; constraint-free character recognition; pattern-recognition; alphanumeric characters; phrase-structure grammars; topological fidelity; character recognition; grammars; topology
CITATION
L. Stringa, "A New Set of Constraint-Free Character Recognition Grammars", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.12, no. 12, pp. 1210-1217, December 1990, doi:10.1109/34.62612
28 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool