US4063219A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Character recognition system
Assignee: Unisys Corp
•
Filing: 1976-12-27
•
Granted: 1977-12-13
•
Expires: 1996-12-27
Abstract
Abstract An apparatus and method for recognizing a presented character are provided. The apparatus includes a scanner for extracting black and white information from a document in the form of an analog electrical signal. The analog electrical signal is converted into a three bit binary number by a multi-level quantizer to consequently form three weighted data field geometric configurations consisting of rows of binary signals, which binary signals are stored in a storage area in three data field arrays. A selected one of a plurality of progression word detectors detects in a sequential fashion a plurality of binary progression words or progressions by decoding predetermined combinations of the binary words from all the field arrays. The combinations of binary words represent overlapping neighborhood dependent areas from the data field array. A progression detector circuit detects the predetermined combinations of the detected progressions by means of multiplexers which group predetermined combinations of the detected progressions and binary counters which keep track of the progression times and stores the fact that a progression occurs in the proper progression.
Inventors
- 👤 James Dishaw
- 👤 Thomas R. Krause
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 20:39
CPC Classifications
G; G06; G06V; G06V10/00; G06V10/40; G06V10/42; G06V10/421; G06V10/20
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
117 words
A method of identifying a presented character comprising the steps of: generating binary signals representing the information content of a geometric pattern corresponding to the presented character; storing the binary signals in a data field array which defines a matrix of progressions, each progression overlapping the preceding progression whereby each progression is associated with every other progression, the data field array being in approximately conformity with the geometric pattern of the presented character; decoding predetermined combinations of the binary signals, each of the predetermined combinations representing a progression, the combinations further representing overlapping neighborhood dependent areas; and detecting predetermined combinations of the detected progressions from which detected progressions the presented character is recognized as a known type.
Claim 2
Independent Claim
117 words
A method of identifying a presented character comprising the steps of: generating binary signals representing the information content of a geometric pattern corresponding to the presented character; storing the binary signals in a data field array which defines a matrix of progressions, each progression overlapping the preceding progression whereby each progression is associated with every other progression, the data field array being in approximately conformity with the geometric pattern of the presented character; decoding predetermined combinations of the binary signals, each of the predetermined combinations representing a progression, the combinations further representing overlapping neighborhood dependent areas; and detecting predetermined combinations of the detected progressions from which detected progressions the presented character is recognized as a known type.
Claim 3
Independent Claim
134 words
A method of identifying a presented character comprising the steps of: generating weighted binary signals representing the information content of a geometric pattern corresponding to a presented character; storing the weighted binary signals in a plurality of data field arrays, each data field array defining a matrix of progressions, each progression overlapping the preceding progression whereby each progression is associated with every other progression, the data field arrays being in approximate conformity with the geometric pattern of the presented character; decoding predetermined combinations of the binary signals, each of the predetermined combinations representing one of the progressions, the combinations further representing overlapping neighborhood dependent areas, the combinations being decoded from different field arrays; and detecting predetermined combinations of the detected progressions from which detected progressions the presented character is recognized as a known type.
Claim 4
Independent Claim
134 words
A method of identifying a presented character comprising the steps of: generating weighted binary signals representing the information content of a geometric pattern corresponding to a presented character; storing the weighted binary signals in a plurality of data field arrays, each data field array defining a matrix of progressions, each progression overlapping the preceding progression whereby each progression is associated with every other progression, the data field arrays being in approximate conformity with the geometric pattern of the presented character; decoding predetermined combinations of the binary signals, each of the predetermined combinations representing one of the progressions, the combinations further representing overlapping neighborhood dependent areas, the combinations being decoded from different field arrays; and detecting predetermined combinations of the detected progressions from which detected progressions the presented character is recognized as a known type.
Claim 5
Dependent Claim
31 words
The method of claim 2 wherein said step of decoding includes the step of sampling the neighborhood dependent areas which define a plurality of binary signals in a unique progression time.
Claim 6
Dependent Claim
30 words
The method of claim 3 wherein said step of decoding includes the step of correlating each of said plurality of sampled binary signal with a first set of predetermined progressions.
Claim 7
Dependent Claim
21 words
The method of claim 4 wherein said step of detecting includes the step of grouping predetermined combinations of the detected progressions.
Claim 8
Dependent Claim
26 words
The method of claim 5 wherein said step of detecting includes the step of monitoring the grouping of a detected progression during the proper progression time.
Claim 9
Dependent Claim
54 words
The method of claim 2 wherein said step of generating includes the steps of generating an array of voltages representing the information content of the geometric pattern corresponding to the represented character and quantizing the array of generated voltages at plural quantizing levels to form a corresponding plurality of weighted data field geometric configurations.
Claim 10
Independent Claim
145 words
An apparatus for recognizing a presented character comprising: generating means for generating binary signals representing the information content of a geometric pattern corresponding to the presented character; storage means coupled to said generating means for storing said binary signals, said binary signals representing a data field array that is in approximate conformity with the geometric pattern of the presented character, said data field array defining a matrix of progressions, each progression overlapping the preceding progression whereby each progression is associated with every other progression; progression word detecting means for detecting the progressions by decoding predetermined combinations of said stored binary signals, each of said predetermined combinations representing a progression, said combinations representing overlapping neighborhood dependent areas from said field array; and progression detection means for detecting predetermined combinations of said detected progressions from which detected progressions said presented character is recognized as a known type.
Claim 11
Independent Claim
145 words
An apparatus for recognizing a presented character comprising: generating means for generating binary signals representing the information content of a geometric pattern corresponding to the presented character; storage means coupled to said generating means for storing said binary signals, said binary signals representing a data field array that is in approximate conformity with the geometric pattern of the presented character, said data field array defining a matrix of progressions, each progression overlapping the preceding progression whereby each progression is associated with every other progression; progression word detecting means for detecting the progressions by decoding predetermined combinations of said stored binary signals, each of said predetermined combinations representing a progression, said combinations representing overlapping neighborhood dependent areas from said field array; and progression detection means for detecting predetermined combinations of said detected progressions from which detected progressions said presented character is recognized as a known type.
Claim 12
Independent Claim
152 words
An apparatus for recognizing a presented character comprising: generating means for generating weighted binary signals representing the information content of a geometric pattern corresponding to the presented character; storage means coupled to said generating means for storing said weighted binary signals, said weighted binary signals representing a plurality of data field arrays that are in approximate conformity with the geometric pattern of the presented character, each of said data field arrays defining a matrix of progressions, each progression overlapping the preceding progression whereby each progression is associated with every other progression; progression word detecting means for detecting the progressions by decoding predetermined combinations of said stored binary signals, each of said predetermined combinations representing a progression, said combinations representing overlapping neighborhood dependent areas from different field arrays; and progression detecting means for detecting predetermined combinations of said detected progressions from which detected progressions the presented character is recognized as a known type.
Claim 13
Independent Claim
152 words
An apparatus for recognizing a presented character comprising: generating means for generating weighted binary signals representing the information content of a geometric pattern corresponding to the presented character; storage means coupled to said generating means for storing said weighted binary signals, said weighted binary signals representing a plurality of data field arrays that are in approximate conformity with the geometric pattern of the presented character, each of said data field arrays defining a matrix of progressions, each progression overlapping the preceding progression whereby each progression is associated with every other progression; progression word detecting means for detecting the progressions by decoding predetermined combinations of said stored binary signals, each of said predetermined combinations representing a progression, said combinations representing overlapping neighborhood dependent areas from different field arrays; and progression detecting means for detecting predetermined combinations of said detected progressions from which detected progressions the presented character is recognized as a known type.
Claim 14
Dependent Claim
50 words
The apparatus as defined in claim 9 wherein said progression word detecting means includes sampling means for sampling a plurality of binary signals defining a neighborhood dependent area from said storage means, each of said plurality of binary signals being sampled from said field arrays in a unique progression time.
Claim 15
Dependent Claim
51 words
The apparatus as defined in claim 10 wherein said generating means includes scanning means for scanning the presented character in a predetermined sequence and wherein said progression word detecting means includes reversal means for reversing the order of said sampling thereby allowing said scanning means to reverse said predetermined scanning sequence.
Claim 16
Dependent Claim
46 words
The apparatus as defined in claim 10 wherein said progression word detecting means includes first logic means for correlating each of said plurality of sampled binary signals with a first set of predetermined progressions, said progression word detecting means providing an indication of a determined correlation.
Claim 17
Dependent Claim
61 words
The apparatus as defined in claim 12 wherein said progression word detecting means includes a second logic means for correlating each of said plurality of binary signals with a second set of predetermined progressions, and selector means for selecting one of said first and second logic means to thereby allow said apparatus to recognize a second configuration of the presented character.
Claim 18
Dependent Claim
33 words
The apparatus as defined in claim 12 wherein said first logic means comprises a plurality of logic gates and wherein the overlapping portions of neighborhood dependent areas are correlated by common logic gates.
Claim 19
Dependent Claim
97 words
The apparatus as defined in claim 9 wherein said generating means includes scanning means for generating an array of voltages representing the information content of the geometric pattern corresponding to the presented character and multi-level quantizing means coupled to said scanning means for quantizing said array of voltages at plural quantizing levels to form a corresponding plurality of weighted data field geometric configurations consisting of rows of binary signals, each of said weighted data field geometric configurations representing the scanned pattern thereby differentiating between a plurality of colors ranging between black ad white of a presented character.
Claim 20
Dependent Claim
23 words
The apparatus as defined in claim 14 wherein said progression detection means includes grouping means for grouping predetermined combinations of said detected progressions.
Claim 21
Dependent Claim
74 words
The apparatus as defined in claim 14 wherein at least two of said detected progressions include a plurality of sub-words, the sub-words of a particular progression being correlated at the same progression time and wherein said progression detection means includes grouping means for grouping corresponding ones of said sub-words and progressions to thereby allow the recognition of a presented character having one of a top segment, a side segment and a bottom segment missing.
Claim 22
Dependent Claim
60 words
The apparatus as defined in claim 17 wherein said progression detection means includes monitoring means, responsive to the arrival of a detected progression at said grouping means during the proper progression time, for monitoring progression times and for providing an indication when the predetermined combination of detected progressions and sub-words arrive at said grouping means during the proper progression times.
Claim 23
Dependent Claim
45 words
The appartus as defined in claim 18 wherein said progression detection means includes recording means for recording the number of indications provided by said monitoring means, said recording means indicating the number of times said apparatus interprets the geometric pattern to be the presented character.
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) | 1980-12-12 | 1981-06-13 | 1981-12-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1984-12-12 | 1985-06-13 | 1985-12-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1988-12-12 | 1989-06-13 | 1989-12-13 | $7700.00 | Window Closed / Lapsed |