IP Library › Granted Patent US 7,406,201
Granted Patent B2
US 7,406,201 · App. 10/727,926 · Granted Jul 29, 2008

Correcting segmentation errors in OCR

Assignee: International Business Machines Corporation
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,406,201
App. No.
10/727,926
Granted
Jul 29, 2008
Kind
B2
Abstract

A method for encoding characters includes identifying one or more sequences of the character codes that are likely to be generated due a segmentation error in application of a pattern recognition process, and associating a respective extension character code with each of the sequences. The area of an image containing characters is divided into segments, such that each segment contains approximately one character. The pattern recognition process is applied to each of the segments in order to generate an input string of character codes. At least one of the identified sequences of the character codes in the input string is replaced with the respective extension character code so as to generate a modified string. The output string is determined by comparing the modified string to a directory of known strings.

Claims (14)

1. A method, implemented by a computer, for encoding characters appearing in an area of an image in order to generate a corresponding output string of character codes, the method comprising the following steps, carried out by the computer:

identifying one or more sequences of the character codes that are known to result frequently due a segmentation error in application of a pattern recognition process, and associating a respective extension character code with each of the sequences, wherein each of the one or more sequences of the character codes is generated due to incorrect segmentation of a respective original character having a respective original character code;

dividing the area of the image into segments such that each segment contains approximately one character;

applying the pattern recognition process to each of the segments in order to generate an input string of character codes, the input string comprising a respective character code for each of the segments;

locating at least one of the sequences of the character codes in the input string, and replacing the at least one of the sequences with the respective extension character code so as to generate a modified string; and

determining the output string by finding an approximate match between the modified string and a known string in a directory of known strings by computing respective edit distances between the modified string and a plurality of the known strings based on respective costs of edit operations involving the extension character code, and selecting the one of the known strings responsively to the respective edit distances,

wherein a cost of zero is assigned to a transformation of the respective extension character code associated with each of the sequences to the respective original character code.

2. The method according to claim 1 , wherein the character codes that are generated by the pattern recognition process are selected from a predetermined set of eight-bit codes, and wherein associating the respective extension character code comprises assigning a respective eight-bit code that is not included in the predetermined set to replace each of the sequences.

3. The method according to claim 1 , wherein applying the pattern recognition process comprises applying optical character recognition (OCR)

4. The method according to claim 1 , wherein finding the approximate match comprises:

replacing each of the one or more sequences of the character codes in the known strings with the respective extension character code so as to create aliases that are respectively derived from the known strings;

adding the aliases to the directory; and

finding the approximate match between the modified string and one of the aliases, and

wherein outputting the one of the known strings comprises outputting the one of the known strings from which the one of the aliases is respectively derived.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 26, 2004
From: HEILPER, ANDRE; WALSCH, EUGENE
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 014668/0886 →
Continuity (1)
Related Publication 20050123203A1 · Jun 9, 2005