Apparatus and method for separating handwritten characters by line and word

• US 5,216,725 A
• Filed: 10/31/1990
• Issued: 06/01/1993
• Est. Priority Date: 10/31/1990
• Status: Expired due to Fees

• Current Assignee: Environmental Research Institute of Michigan
• Original Assignee: Environmental Research Institute of Michigan
• Inventors: McCubbrey, David L.
• Primary Examiner(s): Razavi, Michael T.
• Assistant Examiner(s): KLOCINSKI, STEVEN
• Application Number:
  US07/606,578
• Time in Patent Office: 944 Days
• Field of Search: 382/1, 382/9, 382/13, 382/55, 382/18, 209/900, 209/584
• US Class Current: 382/102
• CPC Class Codes: B07C 3/14 using light-responsive detecting means for information carriers G06K7/14
• CPC Class Codes: G06V 30/10 Character recognition
• CPC Class Codes: G06V 30/146 Aligning or centring of the image pick-up or image-field
• CPC Class Codes: G06V 30/424 Postal images, e.g. labels or addresses on parcels or postal envelopes
• CPC Class Codes: Y10S 209/90 Sorting flat-type mail

Abstract

A computer system and a method for a mail sorting operation in which the computer system determines the location of the ZIP code within a digital image of an address block from a piece of mail. An interstroke distance is calculated for the image and the strokes of the image are thinned to enhance vertical separation between the lines of the address block. A medial axis for each line is determined and the medial axis is superimposed upon the digital image. A bleeding operation is conducted on the digital image from the medial axis at which data bits that do not connect to the medial axis are notated as punctuation and interlinear connected strokes are then divided between the two lines. The last line which is determined to be large enough to contain a ZIP code based on bounding box size is then selected. Alternate splits of words are formed and the best split is selected in which the last formed group is detected to be the ZIP code.

Claims

1. A computer system for locating a predetermined group of foreground image pixels chosen from a digital pixel image consisting of foreground image pixels and background pixels set forth in an array of columns and rows, said foreground image pixels forming characters arranged in a plurality of lines, said computer system comprising:

means for computing horizontal distances between horizontally aligned foreground image pixels separated by at least one background pixel and determining the first peak distance in a histogram of occurrences of distances, said peak distance referred to as the interstroke distance;

means for horizontally dilating and then horizontally eroding said digital pixel image to enhance vertical separation of said characters in said plurality of lines;

means for grouping the characters together into blocks based on the interstroke distance and wider distances between said characters;

means for skeletonizing said blocks into lines extending the horizontal length of each block;

means for dilating the resulting skeletonized image in a vertical direction to create box areas of uniform vertical thickness;

means for dilating said resulting box areas horizontally such that box areas overlapping in the horizontal direction are merged together to form line images;

means for determining and labeling the medial axis of each respective line image;

means for simultaneously bleeding the foreground image pixels from each medial axis to identify foreground image pixels connected to a medial axis directly or via other foreground image pixels such that two characters that are connected to two different medial axes and are connected together are divided where the bleeding from the two medial axes meet;

means for identifying a desired line of said characters and associating possible wording groups from interstroke distance; and

means for selecting said predetermined group of foreground image pixels from said possible wording groups by using interstroke distances.

2. A computer system as defined in claim 1 wherein:

said characters form an address block; and

said predetermined group of foreground image pixels form a ZIP code within the address block.

3. A computer system as defined in claim 2 wherein:

said identifying means identifies a last line of said address block large enough to include a ZIP code, and

said selecting means selects a last wording group in said desired last line sized large enough to be a ZIP code.

4. A computer system as defined in claim 1 further comprising:

means for identifying foreground image pixels not connected to any medial axis and thereby not bled by said bleeding means; and

said means for selecting said predetermined group of foreground image pixels using said foreground image pixels not connected to any medial axis as punctuation.

5. A computer system as defined in claim 1 further comprising:

means for determining a minimum bounding box completely enclosing the foreground image pixels of said digital pixel image; and

means for down-sampling the digital pixel image within said bounding box.

6. A computer system for locating a desired group of characters chosen from a digital pixel image consisting of foreground image pixels and background pixels set forth in an array of columns and rows, said foreground image pixels forming characters arranged in a plurality of lines, said computer system comprising:

means for determining the medial axis of each respective line;

means for superimposing each respective medial axis onto said digital pixel image from each medial axis to identify foreground image pixels connected to the medial axis either directly or via other foreground image pixels such that two characters that are in two different horizontal lines and are connected together are divided where the bleeding from the two corresponding medial axes meet;

line selecting means for selecting a desired line;

group selecting means for selecting said desired group of characters within said desired line.

7. A computer system as defined in claim 6 wherein:

said characters form an address block; and

said desired group of characters form a ZIP code within the address block.

8. A computer system as defined in claim 7 wherein:

said line selecting means selects the last line of said address block, and group selecting means selects a last group in said desired last line.

9. A computer system as defined in claim 6 further comprising:

means for determining a minimum bounding box completely enclosing the foreground image pixels of said digital pixel image; and

means for down-sampling the digital pixel image within said bounding box.

10. A computer system as defined in claim 6 further comprising:

means for identifying foreground image pixels not connected to any medial axis and thereby not bled by said bleeding means; and

said means for selecting said desired group uses said foreground image pixels not connected to any medial axis as punctuation.

11. A computer system as defined in claim 6 further comprising:

means for computing distances between horizontally aligned foreground image pixels separated by at least one background pixel and determining the first peak distance in a histogram of occurrences of distances, said peak distance referred to as the interstroke distance; and

said means for selecting said desired group of characters uses said interstroke distance as a factor to form groups of which one is said desired group.

12. A computer system as defined in claim 11 further comprising:

means for determining a minimum bounding box completely enclosing the foreground image pixels of said digital pixel image; and

means for down-sampling the digital pixel image within said bounding box.

13. A computer system as defined in claim 11 further comprising:

means for grouping characters together into blocks based on said interstroke distance;

means for skeletonizing said blocks into lines extending the horizontal length of each block;

means for dilating said lines in a vertical direction, creating box areas;

means for dilating said resulting box areas horizontally such that box areas overlapping in the horizontal direction are merged together to form line images of each line.

14. A method for locating a desired group of characters chosen from a digital pixel image consisting of foreground image pixels and background pixels set forth in an array of columns and rows, said foreground image pixels forming characters arranged in a plurality of lines, said method comprising the steps of:

computing horizontal distances between horizontally aligned foreground image pixels separated by at least one background pixel and determining the first peak distance in a histogram of occurrences of distances, said peak distance referred to as the interstroke distance;

horizontally dilating and then horizontally eroding said characters to enhance vertical separation of said characters in said plurality of lines;

determining the medial axis of each of said plurality of lines;

simultaneously bleeding foreground image pixels from each axis to identify all foreground image pixels connected to a medial axis directly or via other foreground image pixels such that two characters that are in two different lines and are connected together are divided where the bleeding from the two corresponding medial axes meet; and

selecting said desired group of characters by using said interstroke distance.

15. A method as defined in claim 14 further comprising the steps of:

determining a minimum bounding box completely enclosing the foreground image pixels of said digital pixel image; and

down-sampling the digital pixel image within said bounding box before said computing step.

16. A method as defined in claim 14 further comprising the steps of:

identifying foreground image pixels not connected to the medial axis of any of said plurality of lines; and

said selecting step uses said identified foreground image pixels not connected to any medial axis as punctuation to assist in selecting said desired group of characters.