Patent US2368131A successfully refreshed from Google Patents.
US3609686A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Character recognition systems
Assignee: Fujitsu Services Ltd
•
Filing: 1969-07-09
•
Granted: 1971-09-28
•
Expires: 1989-07-09
Abstract
Abstract A character recognition system, in which the outputs of individual photocells of a matrix are grouped together, is disclosed, Each group of outputs is applied through a detector to produce a group of binary signals which signals are applied as an input to an encoding device. Each encoding device has an output for each possible input signal from an associated group of photocell outputs, each encoding device output being connected to access a different location in a store. Each photocell group output accesses a different store location, a weighting function being stored in each store location. The weighting functions of sets of store locations in a set are summed and compared with the sums of other sets of store locations in order to identify an unknown character displayed to the photocell matrix.
Inventors
- 👤 Derek Alan Savory
- 👤 Brian George Holland
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 01:28
CPC Classifications
G; G06; G06V; G06V30/00; G06V30/10; G06V30/19; G06V30/192; G06V30/194
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
123 words
Character recognition system using weighting techniques, comprising means providing a plurality of groups of outputs, each said output corresponding to whether or not a different individual area of a matrix of such areas is covered by a character, encoding means for energizing a predetermined different output line for each possible combination of said outputs in a said group, storage means having a different set of storage locations for each possible character, each said output line serving when energized to access a predetermined different storage location of each set, each storage location serving to store a number based on how many times that location would be accessed for the corresponding possible character, and adder means for totaling the numbers accessed from each said set.
Claim 2
Dependent Claim
123 words
Character recognition system using weighting techniques, comprising means providing a plurality of groups of outputs, each said output corresponding to whether or not a different individual area of a matrix of such areas is covered by a character, encoding means for energizing a predetermined different output line for each possible combination of said outputs in a said group, storage means having a different set of storage locations for each possible character, each said output line serving when energized to access a predetermined different storage location of each set, each storage location serving to store a number based on how many times that location would be accessed for the corresponding possible character, and adder means for totaling the numbers accessed from each said set.
Claim 3
Dependent Claim
16 words
System accOrding to claim 1, wherein said groups are randomly composed of equal numbers of outputs.
Claim 4
Dependent Claim
68 words
System according to claim 1, comprising control means operable in teaching particular possible character to the system for enabling for said access only that one of said set of storage locations that is to correspond to that possible character, said adder means being operable to add binary ''''1'''' to the contents of each storage location of said one set each time that location is accessed during said teaching.
Claim 5
Dependent Claim
51 words
System according to claim 3, further comprising weighting means connected to the adder means and the storage means and serving during said teaching to establish for storage in each storage location during character recognition, one of a plurality of predetermined numbers based on the actual contents of the storage location concerned.
Claim 6
Dependent Claim
34 words
System according to claim 4, further comprising a reference store for storing for each said set the total of the predetermined numbers for the constituent storage locations as determined for the corresponding taught character.
Claim 7
Dependent Claim
76 words
System according to claim 5, comprising a two-part comparator connected to the adder means and the reference store and operable during recognition of an unknown character, a first part of the comparator serving to determine from the adder means output which said set has the highest total of accessed predetermined numbers, and a second part of the comparator serving to compare said highest total with the contents of the reference store for the corresponding said set.
Claim 8
Dependent Claim
54 words
System according to claim 6, wherein the first part of the comparator is responsive to the second highest total being within a predetermined percentage of said highest total for causing said second highest total to be stored, the second part of the comparator then being operative for both the highest and second highest total.
Claim 9
Dependent Claim
36 words
System according to claim 7, wherein the second part of the comparator is operative to give an output indicating identification only if the total being compared exceeds a fixed percentage of the corresponding reference store contents.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1974-09-27 | 1975-03-29 | 1975-09-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1978-09-27 | 1979-03-29 | 1979-09-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1982-09-27 | 1983-03-29 | 1983-09-28 | $7700.00 | Window Closed / Lapsed |