Method for identifying plural connected figures

• US 4,933,977 A
• Filed: 09/22/1988
• Issued: 06/12/1990
• Est. Priority Date: 11/05/1987
• Status: Expired due to Term

• Current Assignee: Glory Kogyo Kabushiki Kaisha
• Original Assignee: Glory Kogyo Kabushiki Kaisha
• Inventors: Kameyama, Hirofumi, Fujita, Yasuo, Ohnishi, Kazuhiko, Miki, Shoji, Uosaki, Katsuji
• Primary Examiner(s): Moore, David K.
• Assistant Examiner(s): COUSO, YON JUNG
• Application Number:
  US07/247,663
• Time in Patent Office: 628 Days
• Field of Search: 382/9, 382/11, 382/13, 382/26, 382/22
• US Class Current: 382/178
• CPC Class Codes: G06V 30/10 Character recognition
• CPC Class Codes: G06V 30/153 using recognition of characters or words

Abstract

A method for identifying a plurality of handwritten connected figures includes identifying and prioritizing branches of the connected figures. A first recognition block is formed extending a predetermined distance from one end of the connected figures. Branches having the lowest priority within the first recognition block are erased until a recognizable figure is obtained within the first recognition block. Then, a second recognition block is formed extending the predetermined distance from the recognizable figure obtained in the first recognition block. As with the first recognition block, the branches having the lowest priority within the second recognition block are erased until a recognizable figure is obtained within the second recognition block.

Claims

1. A method for identifying figures of a candidate block, the candidate block containing a plurality of connected figures and extending in width from a first end to a second end, said method comprising the steps of:

(a) identifying and prioritizing branches of the plurality of connected figures, wherein branches closest to the first end of the candidate block are given a relatively higher priority than branches closest to the second end of the candidate block;

(b) dividing the candidate block into a first recognition block extending a predetermined distance from the first end of the candidate block;

(c) determining whether a recognizable figure exists in the recognition block; and

, in the absence of a recognizable figure in the recognition block,

(d) erasing a branch having a lowest priority within the recognition block and returnig to step (c).

2. A method as recited in claim 1, further comprising the steps of:

checking a continuity of the branches within the recognition block to determine if portions of the branches within the recognition block are missing; and

, if portions of the branches within the recognition block are missing,

interpolating selected branches within the recognition block to establish the portions of the branches that are missing.

3. A method as recited in claim 1, wherein the predetermined distance in step (b) is obtained by multiplying a mean height of plural candidate blocks by a constant.

4. A method as recited in claim 3, wherein the constant is on the order of 1.3.

5. A method as recited in claim 1, further comprising the steps of:

dividing the candidate block into a second recognition block extending the predetermined distance from a branch having a highest priority which was erased in step (d) with respect to the first recognition block; and

,

repeating steps (c) and (d) with respect to the second recognition block.

6. A method as recited in claim 5, wherein the predetermined distance is greater than a minimum width of the candidate block minus a minimum width of a branch in the candidate block.