A Syntactic Omni-Font Character Recognition System

The author introduces a syntactic omni-font character recognition system that recognizes a wide range of fonts, including handprinted characters. A structural pattern-matching approach is used. Essentially, a set of loosely constrained rules specify pattern components and their interrelationships. The robustness of the system is derived from the orthogonal set of pattern descriptors, location functions, and the manner in which they are combined to exploit the topological structure of characters. By virtue of the new pattern description language, PDL, the user may easily write rules to define new patterns for the system to recognize. The system also features scale-invariance and user-definable sensitivity to tilt orientation. The system has achieved a 95. 2% recognition rate

Comparison of crisp and fuzzy character networks in handwritten word recognition

Experiments involving handwritten word recognition on words taken from images of handwritten address blocks from the United States Postal Service mailstream are described. The word recognition algorithm relies on the use of neural networks at the character level. The neural networks are trained using crisp and fuzzy desired outputs. The fuzzy outputs were defined using a fuzzy k-nearest neighbor algorithm. The crisp networks slightly outperformed the fuzzy networks at the character level but the fuzzy networks outperformed the crisp networks at the word level

Character Recognition Using A Modular Spatiotemporal Connectionist Model

We describe a connectionist model for recognizing handprinted characters. Instead of treating the input as a static signal, the image is scanned over time and converted into a time-varying signal. The temporalized image is processed by a spatiotemporal connectionist network suitable for dealing with time-varying signals. The resulting system offers several attractive features, including shift-invariance and inherent retention of local spatial relationships along the temporalized axis, a reduction in the number of free parameters, and the ability to process images of arbitrary length. Connectionist networks were chosen as they offer learnability, rapid recognition, and attractive commercial possibilities. A modular and structured approach was taken in order to simplify network construction, optimization and analysis. Results on the task of handprinted digit recognition are among the best report to date on a set of real-world ZIP code digit images, provided by the United States Postal Service. The system achieved a 99.1% recognition rate on the training set and a 96.0% recognition rate on the test set with no rejections. A 99.0% recognition rate on the test set was achieved when 14.6% of the images were rejected

Raster to vector conversion: creating an unique handprint each time

When a person composes a document by hand, there is random variability in what is produced. That is, every letter is different from all others. If the person produces seven a s, none will be the same. This is not true when a computer prints something. When the computer produces seven a s they are all exactly the same. However, even with the variability inherent in a person s handwriting, when two people write something and they are compared side by side, they often appear as different as fonts from two computer families. In fact, if the two were intermixed to produce some text that has characters from each hand, it would not look right! The goal of this application is to improve the ability to digitally create testing materials (i. e., data collection documents) that give the appearance of being filled out manually (that is, by a person). We developed a set of capabilities that allow us to generate digital test decks using a raster database of handprinted characters, organized into hands (a single person s handprint). We wish to expand these capabilities using vector characters. The raster database has much utility to produce digital test deck materials. Vector characters, it is hoped, will allow greater control to morph the digital test data, within certain constraints. The long-term goal is to have a valid set of computer-generated hands that is virtually indistinguishable from characters created by a person

An Efficient Hidden Markov Model for Offline Handwritten Numeral Recognition

Traditionally, the performance of ocr algorithms and systems is based on the recognition of isolated characters. When a system classifies an individual character, its output is typically a character label or a reject marker that corresponds to an unrecognized character. By comparing output labels with the correct labels, the number of correct recognition, substitution errors misrecognized characters, and rejects unrecognized characters are determined. Nowadays, although recognition of printed isolated characters is performed with high accuracy, recognition of handwritten characters still remains an open problem in the research arena. The ability to identify machine printed characters in an automated or a semi automated manner has obvious applications in numerous fields. Since creating an algorithm with a one hundred percent correct recognition rate is quite probably impossible in our world of noise and different font styles, it is important to design character recognition algorithms with these failures in mind so that when mistakes are inevitably made, they will at least be understandable and predictable to the person working with theComment: 6pages, 5 figure