← Back to Patent Explorer
US4791679A Expired / Lapsed US ⏱️ 0.0 years remaining

Image character enhancement using a stroke strengthening kernal

Assignee: Eastman Kodak Co
•
Filing: 1987-12-26
•
Granted: 1988-12-13
•
Expires: 2007-12-26
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Character stroke is strengthened by processing video image data with a 16×16 kernal, and moving the kernal one pixel at a time through the image. For each pixel position, sections of the kernal, are selectively filled with black pixels in proportion to the number of black pixels in each section, in accordance with a set of predetermined rules.

Inventors

  • 👤 Lori L. Barski
  • 👤 Roger S. Gaborski

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 15:34
CPC Classifications
G; G06; G06T; G06T5/00; G06T5/20; G06V; G06V30/00; G06V30/10; G06V30/16; G06V30/168

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 396 words
A process performed by image processing means for strengthening weak or broken characters in an image represented by binary pixels of video data, said process comprising: locating a kernal of N rows and M columns of pixels in a particular position in said image; counting the number of black pixels in each section of n columns by m rows of pixels in said kernal; comparing the number of black pixels in each of said sections with a threshold, said threshold being around one-half the maximum possible number of black pixels in said section; selecting certain ones of said sections for transformation to a high percentage of black pixels so that those white pixels within one of or near to neighboring sections whose black pixel counts are sufficiently large are transformed to black pixels; and moving said kernal to the next adjacent pixel position, and repeating the foregoing process, wherein said selecting step selects said certain sections in accordance with the following set of rules: (a) if the number of black pixels in two end sections is greater than said threshold and the number of black pixels in the middle section is greater than half the threshold, fill the three sections with black pixels; (b) if the number of black pixels in each of two neighboring sections is greater than said threshold, fill said neighboring sections with black pixels; (c) if the number of black pixels in each of the three diagonally disposed sections is greater than said threshold, fill diagonal regions adjacent the three diagonally disposed sections, as well as the three diagonally disposed sections themselves, with black pixels; (d) if the number of black pixels in each of the two diagonally disposed sections is greater than said threshold, fill diagonal regions adjacent the two diagonally disposed sections, as well as the two diagonally disposed sections themselves, with black pixels; and (e) if the number of black pixels in a first section is greater than said threshold and the number of black pixels in a second section disposed with respect to said first section by an "L" displacement is greater than said threshold and the number of black pixels in a connecting section between said first and second sections is greater than half said threshold, treat said connecting section as in (a) above and treat the diagonal regions adjacent said connecting section as in (d) above.
Claim 2
Dependent Claim 396 words
A process performed by image processing means for strengthening weak or broken characters in an image represented by binary pixels of video data, said process comprising: locating a kernal of N rows and M columns of pixels in a particular position in said image; counting the number of black pixels in each section of n columns by m rows of pixels in said kernal; comparing the number of black pixels in each of said sections with a threshold, said threshold being around one-half the maximum possible number of black pixels in said section; selecting certain ones of said sections for transformation to a high percentage of black pixels so that those white pixels within one of or near to neighboring sections whose black pixel counts are sufficiently large are transformed to black pixels; and moving said kernal to the next adjacent pixel position, and repeating the foregoing process, wherein said selecting step selects said certain sections in accordance with the following set of rules: (a) if the number of black pixels in two end sections is greater than said threshold and the number of black pixels in the middle section is greater than half the threshold, fill the three sections with black pixels; (b) if the number of black pixels in each of two neighboring sections is greater than said threshold, fill said neighboring sections with black pixels; (c) if the number of black pixels in each of the three diagonally disposed sections is greater than said threshold, fill diagonal regions adjacent the three diagonally disposed sections, as well as the three diagonally disposed sections themselves, with black pixels; (d) if the number of black pixels in each of the two diagonally disposed sections is greater than said threshold, fill diagonal regions adjacent the two diagonally disposed sections, as well as the two diagonally disposed sections themselves, with black pixels; and (e) if the number of black pixels in a first section is greater than said threshold and the number of black pixels in a second section disposed with respect to said first section by an "L" displacement is greater than said threshold and the number of black pixels in a connecting section between said first and second sections is greater than half said threshold, treat said connecting section as in (a) above and treat the diagonal regions adjacent said connecting section as in (d) above.
Claim 3
Dependent Claim 12 words
The process of claim 1 wherein said high percentage is about 100%.
Claim 4
Dependent Claim 19 words
The process of claim 1 wherein M and N are each 16 and m and n are each 4.
Claim 5
Dependent Claim 395 words
An image processing system adapted to strengthen weak or broken characters in an image represented by binary pixels of video data, said system comprising: means for locating a kernal of N rows and M columns of pixels in a particular position in said image; means for counting the number of black pixels in each section of n columns by m rows of pixels in said kernal; means for comparing the number of black pixels in each of said sections with a threshold; means for selecting certain ones of said sections for transformation to a high percentage of black pixels so that those white pixels within one or near two neighboring sections whose black pixel counts are sufficiently large are transformed to black pixels; and means for moving said kernal to the next adjacent pixel position whenever said selecting means has transformed all qualifying sections in said kernal, wherein said selecting means selects said certain sections in accordance with the following set of rules: (a) if the number of black pixels in two end sections is greater than a threshold and the number of black pixels in the middle section is greater than half said threshold, fill the three sections with black pixels; (b) if the number of black pixels in each of two neighboring sections is greater than said threshold, fill said neighboring sections with black pixels; (c) if the number of black pixels in each of the three diagonally disposed sections is greater than said threshold, fill diagonal regions adjacent the three diagonally disposed sections, as well as the three diagonally disposed sections themselves, with black pixels; (d) if the number of black pixels in each of the two diagonally disposed sections is greater than said threshold, fill diagonal regions adjacent the two diagonally disposed sections, as well as the two diagonally disposed sections themselves, with black pixels; and (e) if the number of black pixels in a first section is greater than said threshold and the number of black pixels in a second section disposed with respect to said first section by an "L" displacement is greater than said threshold and the number of black pixels in a connecting section between said first and second sections is greater than half said threshold, treat said connecting section as in (a) above and treat the diagonal regions adjacent said connecting section as in (d) above.
Claim 6
Dependent Claim 395 words
An image processing system adapted to strengthen weak or broken characters in an image represented by binary pixels of video data, said system comprising: means for locating a kernal of N rows and M columns of pixels in a particular position in said image; means for counting the number of black pixels in each section of n columns by m rows of pixels in said kernal; means for comparing the number of black pixels in each of said sections with a threshold; means for selecting certain ones of said sections for transformation to a high percentage of black pixels so that those white pixels within one or near two neighboring sections whose black pixel counts are sufficiently large are transformed to black pixels; and means for moving said kernal to the next adjacent pixel position whenever said selecting means has transformed all qualifying sections in said kernal, wherein said selecting means selects said certain sections in accordance with the following set of rules: (a) if the number of black pixels in two end sections is greater than a threshold and the number of black pixels in the middle section is greater than half said threshold, fill the three sections with black pixels; (b) if the number of black pixels in each of two neighboring sections is greater than said threshold, fill said neighboring sections with black pixels; (c) if the number of black pixels in each of the three diagonally disposed sections is greater than said threshold, fill diagonal regions adjacent the three diagonally disposed sections, as well as the three diagonally disposed sections themselves, with black pixels; (d) if the number of black pixels in each of the two diagonally disposed sections is greater than said threshold, fill diagonal regions adjacent the two diagonally disposed sections, as well as the two diagonally disposed sections themselves, with black pixels; and (e) if the number of black pixels in a first section is greater than said threshold and the number of black pixels in a second section disposed with respect to said first section by an "L" displacement is greater than said threshold and the number of black pixels in a connecting section between said first and second sections is greater than half said threshold, treat said connecting section as in (a) above and treat the diagonal regions adjacent said connecting section as in (d) above.
Claim 7
Dependent Claim 14 words
The system of claim 4 wherein said high percentage is at least nearly 100%.
Claim 8
Dependent Claim 455 words
A character enhancement image processing system, comprising: buffer means for storing N rows of video data; means for loading an incoming row of video data into said buffer means while unloading the N th one of said rows out of said buffer means: addressing means for addressing an MxN kernal of M co-extensive columns of video pixels in said N lines of data and reading nxm quadrants of video pixels included within said kernal out of said buffer means, said kernal being characterized by a columnar position of said M co-extensive columns within said N rows; counter means for counting the number of black pixels in each one of said quadrants of video pixels; blackening means responsive to a comparison of the number of black pixels in each of said quadrants with a threshold value for converting at least some of the white pixels in certain of said quadrants to black pixels in such a manner as to enhance the connectivity of alphanumeric characters represented by said video data; and kernal means responsive whenever said blackening means has completed the conversion of said certain quadrants for a given columnar position of said kernal for moving said columnar position of said kernal by one column of video pixels, wherein said blackening means identifies said certain quadrants in accordance with the following set of rules: (a) if the number of black pixels in two end sections is greater than said threshold and the number of black pixels in the middle section is greater than half the threshold, fill the three sections with black pixels; (b) if the number of black pixels in each of two neighboring sections is greater than said threshold, fill said neighboring sections with black pixels; (c) if the number of black pixels in each of the three diagonally disposed sections is greater than said threshold, fill diagonal regions adjacent the three diagonally disposed sections, as well as the three diagonally disposed sections themselves, with black pixels; (d) if the number of black pixels in each of the two diagonally disposed sections is greater than said threshold, fill diagonal regions adjacent the two diagonally disposed sections, as well as the two diagonally disposed sections themselves, with black pixels; and (e) if the number of black pixels in a first section is greater than said threshold and the number of black pixels in a second section disposed with respect to said first section by an "L" displacement is greater than said threshold and the number of black pixels in a connecting section between said first and second sections is greater than half said threshold, treat said connecting section as in (a) above and treat the diagonal regions adjacent said connecting section as in (d) above.
Claim 9
Dependent Claim 455 words
A character enhancement image processing system, comprising: buffer means for storing N rows of video data; means for loading an incoming row of video data into said buffer means while unloading the N th one of said rows out of said buffer means: addressing means for addressing an MxN kernal of M co-extensive columns of video pixels in said N lines of data and reading nxm quadrants of video pixels included within said kernal out of said buffer means, said kernal being characterized by a columnar position of said M co-extensive columns within said N rows; counter means for counting the number of black pixels in each one of said quadrants of video pixels; blackening means responsive to a comparison of the number of black pixels in each of said quadrants with a threshold value for converting at least some of the white pixels in certain of said quadrants to black pixels in such a manner as to enhance the connectivity of alphanumeric characters represented by said video data; and kernal means responsive whenever said blackening means has completed the conversion of said certain quadrants for a given columnar position of said kernal for moving said columnar position of said kernal by one column of video pixels, wherein said blackening means identifies said certain quadrants in accordance with the following set of rules: (a) if the number of black pixels in two end sections is greater than said threshold and the number of black pixels in the middle section is greater than half the threshold, fill the three sections with black pixels; (b) if the number of black pixels in each of two neighboring sections is greater than said threshold, fill said neighboring sections with black pixels; (c) if the number of black pixels in each of the three diagonally disposed sections is greater than said threshold, fill diagonal regions adjacent the three diagonally disposed sections, as well as the three diagonally disposed sections themselves, with black pixels; (d) if the number of black pixels in each of the two diagonally disposed sections is greater than said threshold, fill diagonal regions adjacent the two diagonally disposed sections, as well as the two diagonally disposed sections themselves, with black pixels; and (e) if the number of black pixels in a first section is greater than said threshold and the number of black pixels in a second section disposed with respect to said first section by an "L" displacement is greater than said threshold and the number of black pixels in a connecting section between said first and second sections is greater than half said threshold, treat said connecting section as in (a) above and treat the diagonal regions adjacent said connecting section as in (d) above.
Claim 10
Dependent Claim 22 words
The system of claim 6 wherein said blackening means converts all of the white pixels in said certain quadrants to black pixels.

References Cited (Backward Citations)

US3624606A Cited
US3573789A Cited
US3688266A Cited
US4010446A Cited
US4124870A Cited
US4437122A Cited
US4437122B1 Cited
US4703363A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1991-12-13 1992-06-13 1992-12-13 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1995-12-13 1996-06-13 1996-12-13 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1999-12-13 2000-06-13 2000-12-13 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag