𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Application of fuzzy theory to handwritten character recognition

✍ Scribed by Masatoshi Kimachi; Masaki Teshigawara; Kenji Kanayama


Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
987 KB
Volume
26
Category
Article
ISSN
0882-1666

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

There has been much research in recent decades on character recognition methods, and some methods have already been put into practical use. There are many unresolved problems, however, with respect to handwritten character recognition as composed with printed character recognition. The authors considered discriminant functions, which constitute the most important part of a character recognition method. As a result of considering problems of conventional statistical discriminant functions, the authors propose applying the fuzzy theory to discriminant functions. The so‐called fuzzy discriminant function is capable of representing a data distribution in a more flexible manner because it consists of membership functions on the principal axes of learning samples.

The authors conducted recognition experiments for handwritten characters with two types of membership functions. In one type the membership values are directly tuned based on human experiences; in the other they are derived from histograms or statistical data. With the former membership function, the recognition rate of 99.0 percent is achieved for [numeric] characters from the handwritten alphanumeric data base ETL6, and with the latter, the rate of 96.0 percent for [hiragana] characters from handwritten educational [kanji] data base ETL8. This result proves the effectiveness of the fuzzy discriminant function. It also indicates that a dynamic combination of human experiences and statistical techniques is a key to practical systems.


πŸ“œ SIMILAR VOLUMES


Learning stochastic edit distance: Appli
✍ Jose Oncina; Marc Sebban πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 276 KB

Many pattern recognition algorithms are based on the nearest-neighbour search and use the well-known edit distance, for which the primitive edit costs are usually fixed in advance. In this article, we aim at learning an unbiased stochastic edit distance in the form of a finite-state transducer from

Holistic recognition of handwritten char
✍ Xian Wang; Venu Govindaraju; Sargur Srihari πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 319 KB

Researchers have thus far focused on the recognition of alpha and numeric characters in isolation as well as in context. In this paper we introduce a new genre of problems where the input pattern is taken to be a pair of characters. This adds to the complexity of the classi"cation task. The 10 class

Multilayer perceptrons combination appli
✍ Bernard Gosselin πŸ“‚ Article πŸ“… 1996 πŸ› Springer US 🌐 English βš– 477 KB

Several methods of combination of Multilayer Perceptrons (MLPs) for handwritten character recognition are presented and discussed. Recognition tests have shown that cooperation of neural networks using different features vectors can reduce significantly the overall misclassification error rate. Addi