System and method for character presence detection
First Claim
1. System for character presence detection locating characters within a line of characters represented by data bits in a binary stream which is divided into scans, at least some of said data bits corresponding to character information representing said characters, comprising:
- a plurality of scan detectors receiving said binary stream and signalling when the data bits in one scan contain character information conforming to certain criteria, each scan detector having a different criterion;
a pluraity of segment generators, each segment generator in electrical communication with one of said scan detectors for storing into a memory as a series the number of consecutive scans meeting each criteria as a character segment (C) and the number of scans between said character segments as spaces (S) in said series;
an averaging means for selecting one series of said character segments stored within said memory as determined by the average number of data bits containing character information per scan for said line;
arithmetic means connected to said averaging means and to said memory for deriving a recycle number based on said average number (BAV) of data bits containing character information per scan, the average scans (ACW) per character segment, and the standard deviation (SD) of the number of scans in said character segments; and
combination means for receiving said recycle number combining adjacent character segments (CC) of the selected series and the spaces (CS) there between until the addition of another character segment exceeds said recycle number to form a series of combined character segments, said arithmetic means deriving other recycle numbers for use by said combination means utilizing said combined character segments until the recycle number derived is approximately equal to the prior recycled number derived by said arithmetic means.
6 Assignments
0 Petitions
Accused Products
Abstract
A system and method for character presence detection having the capability of locating characters within a line of characters represented by a binary stream of data bits. The stream of binary data bits is divided into scans which correspond to scans of a photocell array. The system for character presence detection receives the binary stream. Each data bit has a unique position within its particular scan, which corresponds to the selection of a particular photocell of the photocell array as the output thereof, and, therefore, the binary stream of data bits comprises an image corresponding to alphanumeric characters disposed upon a written medium. That is, the data bits comprise an image of characters which form a line disposed along a written medium. Within the binary stream, some data bits represent character information and the remainder represents background information. The system compares each scan to a plurality of criterion, each criterion being unique, and forms a series of character segments and spaces based on the results of the comparison of each scan to each of the criterion. The character segments and spaces of one series formed by one of the criterion is selected based on the average number of data bits which contain character information per scan. A recycle number is calculated based on the average number of data bits containing character information per scan, the average scans per character segment, and the standard deviation of the scans comprising the character segments. The recycle number is compared against the character segment which form combined character segments by combining adjacent character segments and the space there between if the combined character is comprised of a number of scans which is less than the recycle number. A new recycle number is calculated based on the combined character segments and this new recycle number is utilized to form new combined character segments from the original character segments. This process continues until the recycle number newly calculated is the same as the prior recycle number calculated. The final combined character segments formed by application of the recycle number are tested against certain limits to detect character segments which were improperly combined. The standard deviation calculated which is based on the combined character segments and the average number of scans per combined character segment is utilized to calculate a suspect character width and minimum and maximum natural break numbers.
20 Citations
19 Claims
-
1. System for character presence detection locating characters within a line of characters represented by data bits in a binary stream which is divided into scans, at least some of said data bits corresponding to character information representing said characters, comprising:
-
a plurality of scan detectors receiving said binary stream and signalling when the data bits in one scan contain character information conforming to certain criteria, each scan detector having a different criterion; a pluraity of segment generators, each segment generator in electrical communication with one of said scan detectors for storing into a memory as a series the number of consecutive scans meeting each criteria as a character segment (C) and the number of scans between said character segments as spaces (S) in said series; an averaging means for selecting one series of said character segments stored within said memory as determined by the average number of data bits containing character information per scan for said line; arithmetic means connected to said averaging means and to said memory for deriving a recycle number based on said average number (BAV) of data bits containing character information per scan, the average scans (ACW) per character segment, and the standard deviation (SD) of the number of scans in said character segments; and combination means for receiving said recycle number combining adjacent character segments (CC) of the selected series and the spaces (CS) there between until the addition of another character segment exceeds said recycle number to form a series of combined character segments, said arithmetic means deriving other recycle numbers for use by said combination means utilizing said combined character segments until the recycle number derived is approximately equal to the prior recycled number derived by said arithmetic means. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15)
-
-
16. A system for character presence detection receiving a binary data stream comprised of data bits and divided into scans, at least some of said data bits contain character information representing a plurality of characters disposed along the line, said system forming at least one series of character (C) segments with spaces (S) there between, each scan of said character segments (C) meeting certain predetermined criteria and based on the relationships between data bits within said scan, said system forming a series of combined character segments (CC) including each of said character segments and each of said spaces (CS) there between by combining any adjacent character segments (C) and the spaces (S) there between meeting preselected conditions, comprising:
-
means for calculating a suspect character width (SCW) from said combined character segments (CC) in accordance with the formula;
SCW=ACW+(ACW÷
SD), where ACW is the average combined character width and SD is the standard deviation excluding those less than 8, means for calculating an inclusive natural break range having a minimum (NBMIN), and maximum (NBMAX) values in accordance with the following formulas;
NBMAX=2×
ACW+5-P, NBMIN=2×
ACW-SD-P, where P represents the number of combined character segments greater than ACW+SD,means for comparing each combined character segment to the SCW to determine if any combined character segments exceed the SCW, summing means connecting to said means for comparing forming the sum of said combined character segments exceeding the SCW, one combined segment adjacent thereto, and the space there between, means for adjusting widths of the combined character segments and the spaces there between to form two combined recovery character segments of equal widths if the said sum is within the inclusive range of NBMAX and NBMIN, the total of said equal widths being approximately equal to the said sum. - View Dependent Claims (17, 18, 19)
-
Specification