← Back to Patent Explorer
US3634823A Expired / Lapsed US ⏱️ 0.0 years remaining

An optical character recognition arrangement

Assignee: International Standard Electric Corp
•
Filing: 1969-05-09
•
Granted: 1972-01-11
•
Expires: 1989-05-09
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Process of optical character recognition for different sizes of character, in which the characters are scanned in columns, stored in a shift register, removed therefrom in rows and the bit combinations are associated with outlets in a ''''probe'''' network. Then the bit combination, thus determined, of the character to be recognized is compared with the bit combinations of all of the stored compare characters simultaneously taking into account the location of the character in the character area, and the number of agreements is determined. The greatest number of agreements determines the character.

Inventors

  • 👤 Walter Dietrich
  • 👤 Rudolf Schlupp

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 23:48
CPC Classifications
G; G06; G06V; G06V30/00; G06V30/10; G06V30/16; G06V30/162; G06V30/19; G06V30/19007; G06V30/19013

Claims Analysis

Total Claims: 9
Claim 1
Independent Claim 271 words
An arrangement for character recognition in which the characters are broken up into their characteristic shape elements comprising: a series of optical transducers for scanning the height of a character, said series of transducers is longer than the height of the characters to be scanned; means coupled to said transducers for producing a signal for each transducer which indicates the black and white elements per column scanned, and the distribution of black and white elements per column indicates the shape element; a two-dimensional shift register for storing shape elements column by column; a probe network comprising an electrical matrix representing all possible shape elements and having as many columns as said shift register; a probe register for serially coupling said shape elements to said network row by row; first detecting means coupled to said network for determining which row of the probe network delivers a strongest signal representing a most similar shape element; recognition means coupled to said detecting means for assigning all detected shape elements to relevant characters on the basis of their location in a character area, said area being organized into zones having a variable number of rows according to a predetermined criteria; means for varying the number of rows according to the height of a character including a height register coupled to said shift register, a row counter input gated from the output of said height register, and a zone counter coupled between said row counter and recognition circuit; counting means coupled to said recognition circuit for determining the character with the largest number of assigned shape elements; and second detecting means for recognizing said determined character.
Claim 2
Dependent Claim 271 words
An arrangement for character recognition in which the characters are broken up into their characteristic shape elements comprising: a series of optical transducers for scanning the height of a character, said series of transducers is longer than the height of the characters to be scanned; means coupled to said transducers for producing a signal for each transducer which indicates the black and white elements per column scanned, and the distribution of black and white elements per column indicates the shape element; a two-dimensional shift register for storing shape elements column by column; a probe network comprising an electrical matrix representing all possible shape elements and having as many columns as said shift register; a probe register for serially coupling said shape elements to said network row by row; first detecting means coupled to said network for determining which row of the probe network delivers a strongest signal representing a most similar shape element; recognition means coupled to said detecting means for assigning all detected shape elements to relevant characters on the basis of their location in a character area, said area being organized into zones having a variable number of rows according to a predetermined criteria; means for varying the number of rows according to the height of a character including a height register coupled to said shift register, a row counter input gated from the output of said height register, and a zone counter coupled between said row counter and recognition circuit; counting means coupled to said recognition circuit for determining the character with the largest number of assigned shape elements; and second detecting means for recognizing said determined character.
Claim 3
Dependent Claim 21 words
The arrangement of claim 1 wherein said row counter is a ring counter which is indexed by a common clock generator.
Claim 4
Dependent Claim 31 words
The arrangement of claim 2 wherein said zone counter has stages equal to the number of zones having different numbers of rows, and each stage is gated to said recognition circuit.
Claim 5
Dependent Claim 37 words
The arrangement of claim 3 including a binary counter for each character wherein probe set signals are added, said binary counters being logically connected to those probe outputs which indicate the character associated with a particular counter.
Claim 6
Dependent Claim 13 words
The arrangement of claim 4 including means for weighting the probe set signals.
Claim 7
Dependent Claim 28 words
The arrangement according to claim 5 wherein the probe outputs are fed by connecting them directly to a second, thiRd, or following stage of an associate binary counter.
Claim 8
Dependent Claim 31 words
The arrangement according to claim 4 including a buffer store to recognize that a predetermined probe has previously responded, and said probe store being connected to the counter by an AND-circuit.
Claim 9
Dependent Claim 23 words
The arrangement according to claim 7 including a single logic element connected to the relevant counter for similar shape elements in different characters.

References Cited (Backward Citations)

US3290651A Cited
US3178688A Cited
US3496542A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1975-01-10 1975-07-12 1976-01-11 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1979-01-10 1979-07-12 1980-01-11 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1983-01-10 1983-07-12 1984-01-11 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag