Patent US5040229A successfully refreshed from Google Patents.
US5040229A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Contour feature-based method for identification and segmentation of touching characters
Assignee: Eastman Kodak Co
•
Filing: 1990-02-02
•
Granted: 1991-08-13
•
Expires: 2010-02-02
Abstract
Abstract Characters which touch one another in a document image are identified and separated in accordance with their contours. The objects in the image are divided into two classes comprising, respectively, those having closed inner contours and those which do not. An object in the first class having either a closed inner contour which is not centered in the object or two horizontally offset closed inner contours or more than two closed inner contours is identified as containing two touching characters and is split in accordance with the character stroke thickness observed in the document. An object in the second class whose contours intersect three spaced horizontal reference lines at more than a predetermined number of points is compared against intersection patterns characteristic of single characters. If a match is not found, the object is identified as containing touching characters.
Inventors
- 👤 Yongchun Lee
- 👤 Andrew M. Assad
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 18:36
CPC Classifications
G; G06; G06V; G06V30/00; G06V30/10; G06V30/14; G06V30/148
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
114 words
A method for separating touching characters in a binary image having an outer contour bounding an object region, comprising: (I) detecting the presence of any closed inner contour within said outer contour; (II) if there is only a single closed inner contour, determining whether the location of the closed inner contour is horizontally offset from the horizontal center of said object region; (III) if there are only two closed inner contours, determining whether they are horizontally offset from one another; (III) determining whether there are more than two closed inner contours; and (IV) if any of the foregoing determining steps finds a true condition, locating a separation point for vertically splitting the character image.
Claim 2
Independent Claim
114 words
A method for separating touching characters in a binary image having an outer contour bounding an object region, comprising: (I) detecting the presence of any closed inner contour within said outer contour; (II) if there is only a single closed inner contour, determining whether the location of the closed inner contour is horizontally offset from the horizontal center of said object region; (III) if there are only two closed inner contours, determining whether they are horizontally offset from one another; (III) determining whether there are more than two closed inner contours; and (IV) if any of the foregoing determining steps finds a true condition, locating a separation point for vertically splitting the character image.
Claim 3
Dependent Claim
79 words
The method of claim 1 wherein said step IV of locating a separation point comprises: (a) if there are two or more horizontally offset closed inner contours, locating the separation point halfway between two adjacent closed inner contours; (b) if there is only one closed inner contour, placing the separation point at a location horizontally displaced from the closed inner contour towards the center of said object region by a distance corresponding to the thickness of a character stroke.
Claim 4
Dependent Claim
117 words
The method of claim 1 further comprising: (V) if the detecting step I fails to detect at least one closed inner contour, superimposing a plurality of spaced horizontal lines across said object region; (VI) counting the number of intersections of said binary image along each superimposed horizontal line; (VII) determining whether the intersection count along any one of the superimposed horizontal lines exceeds a threshold; (VIII) if the count exceeds the threshold, comparing a pattern of the intersection counts for all superimposed horizontal lines in the image with a library if known intersection count patterns of single characters; and (IX) if a match is not found in the comparing step VIII, transmitting a touching character separation flag.
Claim 5
Dependent Claim
19 words
The method of claim 1 wherein the detecting step I comprises contour vectorization of the outer and inner contours.
Claim 6
Dependent Claim
19 words
The method of claim 3 further comprising a preceding step of creating said library of known intersection count patterns.
Claim 7
Dependent Claim
49 words
The method of claim 5 wherein said step of creating said library comprises performing step V and step VI for each of a set of binary images of known single characters and storing an intersection count for each of said superimposed horizontal lines for each one of said images.
Claim 8
Dependent Claim
130 words
An optical character recognition processor for separating touching characters in a binary image having an outer contour bounding an object region, comprising: means for detecting the presence of any closed inner contour within said outer contour; means for determining for an image containing a solitary closed inner contour whether the location of the closed inner contour is horizontally offset from the horizontal center of said object region; means for determining for an image containing a pair of closed inner contours whether the closed inner contours are horizontally offset from one another; means for determining whether there are more than two closed inner contours in said image; and separation means responsive to each of said means for determining for locating a separation point at which to vertically split the character image.
Claim 9
Dependent Claim
130 words
An optical character recognition processor for separating touching characters in a binary image having an outer contour bounding an object region, comprising: means for detecting the presence of any closed inner contour within said outer contour; means for determining for an image containing a solitary closed inner contour whether the location of the closed inner contour is horizontally offset from the horizontal center of said object region; means for determining for an image containing a pair of closed inner contours whether the closed inner contours are horizontally offset from one another; means for determining whether there are more than two closed inner contours in said image; and separation means responsive to each of said means for determining for locating a separation point at which to vertically split the character image.
Claim 10
Dependent Claim
81 words
The processor of claim 7 wherein said separation means comprise: means for locating the separation point halfway between two adjacent closed inner contours for an image having at least a pair of horizontally offset closed inner contours; and means for placing the separation point at a location horizontally displaced from the closed inner contour towards the center of said object region by a distance corresponding to the thickness of a character stroke for an image having a solitary closed inner contour.
Claim 11
Dependent Claim
97 words
The processor of claim 7 further comprising: means for superimposing a plurality of spaced horizontal lines across said object region for images having no closed inner contours; means for counting the number of intersections of said binary image along each superimposed horizontal line; threshold means for determining whether the intersection count along any one of the superimposed horizontal lines exceeds a threshold; comparison means responsive to said threshold means for comparing a pattern of the intersection counts for all superimposed horizontal lines in the image with a library of known patterns of intersection counts for single characters.
Claim 12
Dependent Claim
25 words
The processor of claim 7 wherein said means for detecting comprise means for performing contour vectorization of the outer and inner contours in said image.
Claim 13
Dependent Claim
33 words
The processor of claim 9 wherein said library comprises a memory for storing the output of said means for counting the number of intersections for a set of images of known solitary characters.
References Cited (Backward Citations)
US4045773A
Cited
US4527283A
Cited
US4365234A
Cited
US4562594A
Cited
US4635290A
Cited
US4731857A
Cited
US4764971A
Cited
US4769849A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-08-12 | 1995-02-11 | 1995-08-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-08-12 | 1999-02-11 | 1999-08-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-08-12 | 2003-02-11 | 2003-08-13 | $7700.00 | Window Closed / Lapsed |