Continuous characters recognition system

• US 4,764,972 A
• Filed: 05/23/1986
• Issued: 08/16/1988
• Est. Priority Date: 05/23/1985
• Status: Expired due to Term

• Current Assignee: NEC Corporation
• Original Assignee: NEC Corporation
• Inventors: Shimizu, Hiroshi, Yoshida, Kazunaga, Watari, Masao
• Primary Examiner(s): Blum, Theodore M.
• Application Number:
  US06/866,524
• Time in Patent Office: 816 Days
• Field of Search: 382/9, 382/3, 382/13
• US Class Current: 382/187
• CPC Class Codes: G06V 30/196 using sequential comparisons of the image signals with a plurality of references
• CPC Class Codes: G06V 30/242 Division of the character sequences into groups prior to recognition; Selection of dictionaries

Abstract

A recognition system for recognizing a plurality of continuous hand-written characters, employing a first memory in which isolated characters are stored, and a second memory which stores information, including interstroke character information, for connecting isolated characters. According to various embodiments of the invention, this interstroke information may be stored as part of a continuous character, or by itself.

Claims

1. A continuous characters recognition system comprising:

an input unit for transforming script writing of characters to produce an input pattern without segmenting said script writing;

an isolated character patterns memory for storing a plurality of isolated character patterns, each of said plurality of isolated character patterns representing a pattern from a start point to an end point of a corresponding one of a plurality of reference characters;

a continuous character patterns memory for storing a plurality of continuous character patterns, each of said plurality of continuous character patterns representing a pattern from a start point of each said reference character to a start point of a succeeding one of said reference characters; and

a recognition unit for recognizing said input pattern by producing a reference pattern based on a finite-state automaton and by comparing said input pattern with said reference pattern, said reference pattern including a combination of at least one of said continuous character patterns and one of said isolated character patterns, said one of said isolated character patterns being connected after said at least one of said continuous character patterns, said finite-state automaton providing an instruction path for combining ones of said continuous character patterns and said isolated character patterns to produce said reference pattern, comparison of said input pattern with said reference pattern being carried out without segmenting said input pattern.

2. The continuous characters recognition system as claimed in claim 1, wherein each of said continuous character patterns comprises each of said isolated character patterns and at least one intercharacter stroke pattern representing a pattern from an end point of each said reference character to a start point of each said succeeding reference character to follow said each said reference character.

3. The continuous characters recognition system as claimed in claim 2, wherein each of said continuous character patterns comprises each of said isolated character patterns and a plurality of intercharacter stroke patterns for each of said reference characters in accordance with the start point positions of each said succeeding reference character.

6. A continuous characters recognition system as claimed in claim 1, wherein said input unit produces said input pattern as a time series of azimuths.

4. A continuous characters recognition system comprising:

an input unit for detecting script writing of characters and transforming said script writing to an input pattern without segmenting said script writing;

a first memory for storing a plurality of isolated character patterns, each of said isolated character patterns representing a pattern from a start point to an end point of each of a plurality of reference characters;

a second memory for storing a plurality of intercharacter stroke patterns, each of said intercharacter stroke patterns representing a pattern from an end point of each said reference character to a start point of a succeeding one of said reference characters; and

a recognition unit for recognizing said input pattern by producing a reference pattern based on a finite-state automaton and by comparing said input pattern with said reference patern, said reference pattern including a combination of at least two isolated character patterns read out of said first memory and at least one of said intercharacter stroke patterns read out of said second memory, each of said intercharacter stroke patterns being inserted between two of said isolated character patterns in said combination, said finite-state automaton providing an instruction path for combining ones of said continuous character patterns and said isolated character patterns to produce said reference pattern, comparison of said input pattern with said reference pattern being carried out without segmenting of said input pattern.

5. The continuous characters recognition system as claimed in claim 4, wherein said second memory has stored therein a plurality of said intercharacter stroke patterns for different end points of said each reference character and different state points of each said succeeding one of said reference characters.

7. A continuous characters recognition system as claimed in claim 4, wherein said input unit produces said input pattern as a time series of azimuths.