Patent US5054102A successfully refreshed from Google Patents.
US5054102A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Self-centering character stroke thickening for optical character recognition
Assignee: Eastman Kodak Co
•
Filing: 1990-06-11
•
Granted: 1991-10-01
•
Expires: 2010-06-11
Abstract
Abstract In an optical character recognition system, character strokes are automatically enhanced prior to processing by matching the character bit map with a set of templates. Each template has a stripe of thickness W composed of binary ones surrounded by zeroes along a horizontal, vertical, major diagonal or minor diagonal direction. If the template matches a character stroke to a predetermined degree, the stroke is enhanced by increasing its thickness to a predetermined number N of binary ones.
Inventors
- 👤 Roger S. Gaborski
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 19:14
CPC Classifications
G; G06; G06T; G06T5/00; G06T5/20; G06V; G06V30/00; G06V30/10; G06V30/16; G06V30/168
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
200 words
A character image pre-processor which locates and widens thin character strokes in a character image comprising an array of columns and rows of pixels, said pixels characterized by individual values, said values lying within a range including a relatively high ON value and a relatively low OFF value, said pre-processor comprising: template memory means for storing a set of n templates comprising an array of M columns and N rows of elements, each template comprising a stripe of width W of high-valued individual template elements in a field of low-valued template elements, the stripe in each of said n templates oriented in a corresponding one of n directions; template matching means for summing the products obtained from multiplying pixels of a successive one of a set of M column-by-N row kernels of said image by corresponding elements of a successive one of said templates; stroke strengthening means responsive whenever said means for summing obtains a sum greater than a threshold value for raising toward said On value the values of pixels of said character image in said one kernel which are laterally adjacent a line of pixel locations corresponding to the high-valued elements in the stripe of said one template.
Claim 2
Dependent Claim
200 words
A character image pre-processor which locates and widens thin character strokes in a character image comprising an array of columns and rows of pixels, said pixels characterized by individual values, said values lying within a range including a relatively high ON value and a relatively low OFF value, said pre-processor comprising: template memory means for storing a set of n templates comprising an array of M columns and N rows of elements, each template comprising a stripe of width W of high-valued individual template elements in a field of low-valued template elements, the stripe in each of said n templates oriented in a corresponding one of n directions; template matching means for summing the products obtained from multiplying pixels of a successive one of a set of M column-by-N row kernels of said image by corresponding elements of a successive one of said templates; stroke strengthening means responsive whenever said means for summing obtains a sum greater than a threshold value for raising toward said On value the values of pixels of said character image in said one kernel which are laterally adjacent a line of pixel locations corresponding to the high-valued elements in the stripe of said one template.
Claim 3
Dependent Claim
45 words
The pre-processor of claim 1 wherein said means for raising said pixel values raises values of pixels laterally adjacent each side of said pixel locations corresponding to said stripe whereby to generate a widened character stroke centered with respect to a corresponding original character stroke.
Claim 4
Dependent Claim
18 words
The pre-processor of claim 1 wherein n=4 and said directions are vertical, horizontal, major diagonal and minor diagonal.
Claim 5
Dependent Claim
46 words
The pre-processor of claim 1 wherein said document image is a bi-tonal bit map in which the value of each of said image pixels is either "ON" or "OFF", and wherein said high valued template elements are positive and said low valued template elements are negative.
Claim 6
Dependent Claim
62 words
The pre-processor of claim 4 wherein said ON and OFF image pixels have +1 and 0 binary values, respectively, and wherein the values of said high and low value template elements are +1 and -1, respectively, and wherein said stroke strengthening means comprises means for changing any of said laterally adjacent image pixels whose value is 0 to a value of 1.
Claim 7
Dependent Claim
95 words
The pre-processor of claim 1 further comprising an original image memory and an enhanced image memory, both said original and enhanced image memories initially containing the same character image, wherein: said template matching means comprises means for matching successive ones of said templates with the image stored in said original image memory; and said stroke strengthening means comprises means for increasing the values of said laterally adjacent pixels in said enhanced memory, whereby each template is matched with the original unchanged version of said image, while all changes are made in said enhanced image memory.
Claim 8
Dependent Claim
203 words
A character image pre-processing method for locating and widening thin character strokes in a character image comprising an array of columns and rows of pixels, said pixels characterized by individual values, said values lying within a range including a relatively high ON value and a relatively low OFF value, said method employing a set of n templates comprising an array of M columns and N rows of elements, each template comprising a stripe of width W of high-valued individual template elements in a field of low-valued template elements, the stripe in each of said n templates oriented in a corresponding one of n directions, said method comprising: (a) for individual ones of a set of M pixels column-by-N pixel row kernels of said image and for a successive one of said templates, summing the products obtained from multiplying pixels of the one kernel by corresponding elements of the one template; and (b) whenever the summing step obtains a sum greater than a threshold value, raising toward said ON value the values of pixels of said character image in said one kernel which are laterally adjacent a line of pixel locations corresponding to the high valued elements in the stripe of said one template.
Claim 9
Dependent Claim
203 words
A character image pre-processing method for locating and widening thin character strokes in a character image comprising an array of columns and rows of pixels, said pixels characterized by individual values, said values lying within a range including a relatively high ON value and a relatively low OFF value, said method employing a set of n templates comprising an array of M columns and N rows of elements, each template comprising a stripe of width W of high-valued individual template elements in a field of low-valued template elements, the stripe in each of said n templates oriented in a corresponding one of n directions, said method comprising: (a) for individual ones of a set of M pixels column-by-N pixel row kernels of said image and for a successive one of said templates, summing the products obtained from multiplying pixels of the one kernel by corresponding elements of the one template; and (b) whenever the summing step obtains a sum greater than a threshold value, raising toward said ON value the values of pixels of said character image in said one kernel which are laterally adjacent a line of pixel locations corresponding to the high valued elements in the stripe of said one template.
Claim 10
Dependent Claim
42 words
The pre-processing method of claim 7 wherein said strengthening step raises value of pixels laterally adjacent each side of said pixel locations corresponding to said stripe whereby to generate a widened character stroke centered with respect to a corresponding original character stroke.
Claim 11
Dependent Claim
19 words
The pre-processing method of claim 7 wherein n=4 and said directions are vertical, horizontal, major diagonal and minor diagonal.
Claim 12
Dependent Claim
47 words
The pre-processing method of claim 7 wherein said document image is a bi-tonal bit map in which the value of each of said image pixels is either "ON" or "OFF", and wherein said high valued template elements are positive and said low valued template elements are negative.
Claim 13
Dependent Claim
61 words
The pre-processing method of claim 10 wherein said ON and OFF image pixels have +1 and 0 binary values, respectively, and wherein the values of said high and low value template elements are +1 and -1, respectively, and wherein said stroke strengthening step comprises changing any of said laterally adjacent image pixels whose value is 0 to a value of 1.
Claim 14
Dependent Claim
55 words
The pre-processing method of claim 7 further comprising storing said image and storing a copy of said image, wherein: said summing step comprises fetching the pixels of said one kernel from said image; and said stroke strengthening step comprises means for increasing the values of said laterally adjacent pixels in said copy of said image.
Claim 15
Dependent Claim
25 words
The pre-processing method of claim 7 wherein said summing step is carried out using original values of said image pixels unchanged by said strengthening step.
Claim 16
Dependent Claim
29 words
The pre-processing method of claim 7 wherein said summing step is not repeated for a given one of said kernels upon producing a sum greater than said threshold value.
Claim 17
Dependent Claim
30 words
The pre-processing method of claim 14 wherein said strengthening step with said one kernel is followed by a repetition of said summing step with the next one of said kernels.
Claim 18
Dependent Claim
21 words
The pre-processing method of claim 15 wherein said summing step is carried out with each one of said set of templates.
Claim 19
Dependent Claim
13 words
The pre-processing method of claim 7 wherein said width W equals one pixel.
Claim 20
Dependent Claim
195 words
A character image pre-processor which locates and widens thin character strokes in a character image comprising an array of columns and rows of pixels, said pixels characterized by individual values, said values lying within a range including a relative high ON value and a relatively low OFF value, said pre-processor comprising: template memory means for storing a set of n templates comprising an array of M columns and N rows of elements T ij where i and j are integers such that 1≦i≦N and 1≦j≦M+1, each template comprising a stripe of width W of high-valued individual template elements in a field of low-valued template elements, the stripe in each of n templates oriented in a corresponding one of n directions; template matching means for computing for individual kernels of pixels P ij in said image and for each one of said templates ##EQU2## stroke strengthening means responsive whenever S is greater than a threshold value for raising toward said ON value the values of pixels of said character image in said one kernel which are laterally adjacent a line of pixel locations corresponding to the high valued elements in the stripe of said one template.
Claim 21
Dependent Claim
195 words
A character image pre-processor which locates and widens thin character strokes in a character image comprising an array of columns and rows of pixels, said pixels characterized by individual values, said values lying within a range including a relative high ON value and a relatively low OFF value, said pre-processor comprising: template memory means for storing a set of n templates comprising an array of M columns and N rows of elements T ij where i and j are integers such that 1≦i≦N and 1≦j≦M+1, each template comprising a stripe of width W of high-valued individual template elements in a field of low-valued template elements, the stripe in each of n templates oriented in a corresponding one of n directions; template matching means for computing for individual kernels of pixels P ij in said image and for each one of said templates ##EQU2## stroke strengthening means responsive whenever S is greater than a threshold value for raising toward said ON value the values of pixels of said character image in said one kernel which are laterally adjacent a line of pixel locations corresponding to the high valued elements in the stripe of said one template.
Claim 22
Dependent Claim
45 words
The pre-processor of claim 18 wherein said means for strengthening said pixel values raises values of pixels laterally adjacent each side of said pixel locations corresponding to said stripe whereby to generate a widened character stroke centered with respect to a corresponding original character stroke.
Claim 23
Dependent Claim
18 words
The pre-processor of claim 18 wherein n=4 and said directions are vertical, horizontal, major diagonal and minor diagonal.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-09-30 | 1995-04-01 | 1995-10-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-09-30 | 1999-04-01 | 1999-10-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-09-30 | 2003-04-01 | 2003-10-01 | $7700.00 | Window Closed / Lapsed |