A new set of constraint-free character recognition grammars

Author

Stringa, L.

Author_Institution

Istituto per la Ricerca Scientifica e Tecnologica, Povo, Italy

Volume

12

Issue

12

fYear

1990

fDate

12/1/1990 12:00:00 AM

Firstpage

1210

Lastpage

1217

Abstract

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

Keywords

character recognition; grammars; topology; alphanumeric characters; constraint-free character recognition; pattern-recognition; phrase-structure grammars; primitive extraction; topological fidelity; Character recognition; Credit cards; Data mining; Data processing; Mars; Pattern analysis; Pattern recognition; Production; Vocabulary; Writing;

fLanguage

English

Journal_Title

Pattern Analysis and Machine Intelligence, IEEE Transactions on

Publisher

ieee

ISSN

0162-8828

Type

jour

DOI

10.1109/34.62612

Filename

62612