Showing papers on "Signature recognition published in 1979"

Two-level DP-matching--A dynamic programming-based pattern matching algorithm for connected word recognition

Abstract: This paper reports a pattern matching approach to connected word recognition. First, a general principle of connected word recognition is given based on pattern matching between unknown continuous speech and artificially synthesized connected reference patterns. Time-normalization capability is allowed by use of dynamic programming-based time-warping technique (DP-matching). Then, it is shown that the matching process is efficiently carried out by breaking it down into two steps. The derived algorithm is extensively subjected to recognition experiments. It is shown in a talker-adapted recognition experiment that digit data (one to four digits) connectedly spoken by five persons are recognized with as high as 99.6 percent accuracy. Computation time and memory requirement are both proved to be within reasonable limits.

Local versus global decisions in image recognition

Abstract: This paper discusses the ways of finding consistency between the well-known statistical statement that "guessing destroys information" and the practically obvious advantage of hierarchical decisions. Certain nonstatistical sources of recognition errors are indicated, the influence of these sources increasing with the size of the image parts on which the first-stage discrete decisions are taken. The rejection criterion is examined from the statistical point of view and the necessity of mathematical models for all images to be rejected is demonstrated. The analysis of the possibilities for developing models of both images to be recognized and to be rejected leads to the conclusion that image recognition should be realized by hierarchical systems. An example of a working hierarchical recognition system for interpretation of handmade drawings is described.