Multilayer neural networks trained with the back-propagation algorithm constitute the best example of a successful gradient based learning technique. Given an appropriate network architecture, gradient-based learning algorithms can be used to synthesize a complex decision surface that can classify high-dimensional patterns, such as handwritten characters, with minimal preprocessing. This paper reviews various methods applied to handwritten character recognition and compares them on a standard handwritten digit recognition task. Convolutional neural networks, which are specifically designed to deal with the variability of 2D shapes, are shown to outperform all other techniques. Real-life document recognition systems are composed of multiple modules including field extraction, segmentation recognition, and language modeling. A new learning paradigm, called graph transformer networks (GTN), allows such multimodule systems to be trained globally using gradient-based methods so as to minimize an overall performance measure. Two systems for online handwriting recognition are described. Experiments demonstrate the advantage of global training, and the flexibility of graph transformer networks. A graph transformer network for reading a bank cheque is also described. It uses convolutional neural network character recognizers combined with global training techniques to provide record accuracy on business and personal cheques. It is deployed commercially and reads several million cheques per day.

Gradient-based learning applied to document recognition

Machine Learning is the study of methods for programming computers to learn. Computers are applied to a wide range of tasks, and for most of these it is relatively easy for programmers to design and implement the necessary software. However, there are many tasks for which this is difficult or impossible. These can be divided into four general categories. First, there are problems for which there exist no human experts. For example, in modern automated manufacturing facilities, there is a need to predict machine failures before they occur by analyzing sensor readings. Because the machines are new, there are no human experts who can be interviewed by a programmer to provide the knowledge necessary to build a computer system. A machine learning system can study recorded data and subsequent machine failures and learn prediction rules. Second, there are problems where human experts exist, but where they are unable to explain their expertise. This is the case in many perceptual tasks, such as speech recognition, hand-writing recognition, and natural language understanding. Virtually all humans exhibit expert-level abilities on these tasks, but none of them can describe the detailed steps that they follow as they perform them. Fortunately, humans can provide machines with examples of the inputs and correct outputs for these tasks, so machine learning algorithms can learn to map the inputs to the outputs. Third, there are problems where phenomena are changing rapidly. In finance, for example, people would like to predict the future behavior of the stock market, of consumer purchases, or of exchange rates. These behaviors change frequently, so that even if a programmer could construct a good predictive computer program, it would need to be rewritten frequently. A learning program can relieve the programmer of this burden by constantly modifying and tuning a set of learned prediction rules. Fourth, there are applications that need to be customized for each computer user separately. Consider, for example, a program to filter unwanted electronic mail messages. Different users will need different filters. It is unreasonable to expect each user to program his or her own rules, and it is infeasible to provide every user with a software engineer to keep the rules up-to-date. A machine learning system can learn which mail messages the user rejects and maintain the filtering rules automatically. Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis. Statistics focuses on understanding the phenomena that have generated the data, often with the goal of testing different hypotheses about those phenomena. Data mining seeks to find patterns in the data that are understandable by people. Psychological studies of human learning aspire to understand the mechanisms underlying the various learning behaviors exhibited by people (concept learning, skill acquisition, strategy change, etc.).

Machine learning

The primary goal of pattern recognition is supervised or unsupervised classification. Among the various frameworks in which pattern recognition has been traditionally formulated, the statistical approach has been most intensively studied and used in practice. More recently, neural network techniques and methods imported from statistical learning theory have been receiving increasing attention. The design of a recognition system requires careful attention to the following issues: definition of pattern classes, sensing environment, pattern representation, feature extraction and selection, cluster analysis, classifier design and learning, selection of training and test samples, and performance evaluation. In spite of almost 50 years of research and development in this field, the general problem of recognizing complex patterns with arbitrary orientation, location, and scale remains unsolved. New and emerging applications, such as data mining, web searching, retrieval of multimedia data, face recognition, and cursive handwriting recognition, require robust and efficient pattern recognition techniques. The objective of this review paper is to summarize and compare some of the well-known methods used in various stages of a pattern recognition system and identify research topics and applications which are at the forefront of this exciting and challenging field.

/pdf/statistical-pattern-recognition-a-review-1kz1b0tte4.pdf

Statistical pattern recognition: a review

We develop a common theoretical framework for combining classifiers which use distinct pattern representations and show that many existing schemes can be considered as special cases of compound classification where all the pattern representations are used jointly to make a decision. An experimental comparison of various classifier combination schemes demonstrates that the combination rule developed under the most restrictive assumptions-the sum rule-outperforms other classifier combinations schemes. A sensitivity analysis of the various schemes to estimation errors is carried out to show that this finding can be justified theoretically.

On combining classifiers

From the Publisher:
Pattern recognition has long been studied in relation to many different (and mainly unrelated) applications, such as remote sensing, computer vision, space research, and medical imaging. In this book Professor Ripley brings together two crucial ideas in pattern recognition; statistical methods and machine learning via neural networks. Unifying principles are brought to the fore, and the author gives an overview of the state of the subject. Many examples are included to illustrate real problems in pattern recognition and how to overcome them.This is a self-contained account, ideal both as an introduction for non-specialists readers, and also as a handbook for the more expert reader.

Pattern recognition and neural networks

A gray-scale thinning algorithm based on local min/max operations is newly proposed. Erosion and dilation properties of local min/max operations create new ridges from the given image. Thus grey scale skeletons can be effectively obtained by accumulating such ridges. The proposed method is quite salient because it can be also applied to an unsegmented image in which objects are not specified.

/pdf/gray-scale-thinning-algorithm-using-local-min-max-operations-2pemufcv59.pdf

Gray-Scale thinning algorithm using local min/max operations

of the Disclosure A spelled speech or speech generator consists of a central processing unit (CPU), a first memory storing operating program signals for the CPU, a second memory storing signals representative of predetermined portions of phonemes and repetition counts therefor, an address bus interconnecting the CPU and an address input of each memory, an audio output port driving a digital to analog converter for providing an audio output signal, and a data bus interconnecting the input of the audio output port to an output of the second memory. The CPU is actuated to serially address predetermined ones of memory locations, whereby said phoneme-portion signals can each be repeated a number of times designated by said repetition count signals in a sequence and applied to the input of the audio output port to provide a complete phoneme signal. The size of the memory can be minized by storing only a few partial phonemes.

Generator for spelled speech and for speech

One avenue to improve the performance of computer systems for the recognition of handwritten data is to develop a better grasp of human expertise in this area. Through an experiment, we investigate the clues and cues used by humans to recognize the most confusing samples of our database. Four algorithms are also applied, individually and in a combined manner, to the same difficult data set. Machine and human performances are compared. Such knowledge should be used to refine the existing algorithms which are proved to be clearly inferior to the human experts in recognition of unconstrained handwritten numerals.

Difficult Cases in Handwritten Numeral Recognition

The invention relates to an operational amplifier (OA) or comparator circuit with minimized offset voltage and drift, particularly for analog and/or digital systems requiring high speed and high accuracy signal processing, such as integrators, analog-to-digital converters, etc. The provided OA and comparators circuits retain a high speed and have a drastically increased accuracy. No correcting amplifier is necessary. The gain set by external components is insignificant. Widely available high speed switching components can be used. The tolerance of the passive components used is not critical. The values of the capacitors are determined by the switching frequency and amount of the input bias current of the employed OA. A FET OA can be used as its very large offset voltage and drift can be easily compensated.

Automated entry system for handwritten documents.

While the design of skeletonization algorithms has been a very active research area, methodologies for an automatic evaluation of the quality of the results remain to be developed. The attempt here is to develop distance measures based on shape matching methods, and to compare skeletons references in terms of these distances. Three such methods have been adapted for this purposes, and the results are found to be highly correlated for the samples tested. >

Ching Y. Suen

Papers

Gray-Scale thinning algorithm using local min/max operations

Generator for spelled speech and for speech

Difficult Cases in Handwritten Numeral Recognition

Automated entry system for handwritten documents.

Automatic evaluation of skeleton shapes