CHARACTER-READING APPARATUS INCLUDING IMPROVED CHARACTER SET SENSING STRUCTURE

• US 3,626,368 A
• Filed: 01/13/1969
• Issued: 12/07/1971
• Est. Priority Date: 01/13/1969
• Status: Expired due to Term

• Current Assignee: Hsing Chu Lee
• Original Assignee: Hsing Chu Lee
• Inventors: Lee, Hsing Chu
• Primary Examiner(s): Wilbur, Maynard R.
• Assistant Examiner(s): Cochran, William W.
• Application Number:
  US04/790,811
• Time in Patent Office: 1,058 Days
• Field of Search: 340/146.3
• US Class Current: 382/161
• CPC Class Codes: G06F 18/211 Selection of the most significant subset of features
• CPC Class Codes: G06V 10/757 Matching configurations of points or features
• CPC Class Codes: G06V 10/94 Hardware or software architectures specially adapted for image or video understanding

Abstract

A reading machine, including devices to pick up the signals of group identification points for effectively differentiating configurations, is designed for use independently or in conjunction with a coordinate point selection apparatus. A coordinate matrix of photocells, the number and size of which are dependent upon the type of configurations to be analyzed scan each configuration recording for each the presence and absence of writing in the area viewed by each of the cells in a coordinate system. The number of '"'"''"'"''"'"''"'"'written'"'"''"'"''"'"''"'"' areas are then added numerically on a coordinate basis for all of the letter configurations. A combinatorial constant n, where 2n equals the total number of letter configurations, is derived and dictates the use of a specific stored combination chart. All those coordinate points have the totals 1 to n-1 (where n is the number of configurations) are separately stored and compared intra se to select those within each group which are unique. A selective choice is then made of predetermined groups to obtain a combination of unique subgroups equal to n. This is the group identification pattern or set of points unique to the particular number and type of configurations sought to be recognized.

Claims

1. A process for obtaining group identification positions for a set of character configurations comprising the steps of:

scanning each of the configurations by a coordinate matrix of transducers;

recording the outputs of each transducer for each of said character configurations corresponding to the presence or absence of a written area in each character at each coordinate sampling point;

numerically adding the recorded instances of signals inflicting written area at each corresponding transducer position over said character set and preserving the additive results;

deriving a combinatorial constant n comprising the least value of n such that 2n the number of character configurations;

deriving combinatorial arrays formed by the character configuration signal pattern of at least n transducers, each of said transducers detecting written area in at least n configurations; and

selecting one of said combinatorial arrays of said transducer positions sufficient for uniquely recognizing each of said characters, said selecting step including examining said combinatorial arrays for duplicative entries therein.

2. Apparatus for obtaining group identification positions for a set of character configurations comprising:

a coordinate matrix of transducers for scanning each of the configurations;

means for recording the outputs of each transducer for each of said character configurations corresponding to the presence or absence of a written area in each character at each coordinate sampling points;

means for numerically adding the recorded instances of signals inflicting written area at each corresponding transducer position over said character set and preserving the additive results;

means for deriving a combinatorial constant n comprising the least value of n such that 2n the number of character configurations;

means for deriving combinatorial arrays formed by the character configuration signal pattern of at least n transducers, each of said transducers detecting written area in at least n configuration; and

means for selecting one of said combinatorial arrays of said transducer positions sufficient for uniquely recognizing each of said characters, said selecting means including means for examining said combinatorial arrays for duplicative entries therein.

3. In combination in a reading machine for reading characters of a predetermined character set comprising an array of character configurations, said machine comprising a plurality of operative transducers disposed at selected ones of a coordinate array of character sampLing stations for unambiguously identifying each of said character configurations, and means coupled to said transducers for unambiguously identifying each character depending upon the signal pattern provided by said transducers, said transducer stations being selected by scanning each of the configurations by a coordinate matrix of transducers;

recording the outputs of each transducer for each of said character configuration corresponding to the presence or absence of a written area in each character at each coordinate sampling point;

numerically adding the recorded instances of signals inflicting written area at each corresponding transducer position over said character set and preserving the additive results;

deriving a combinatorial constant n comprising the least value of n such that 2n the number of character configurations;

deriving combinatorial arrays formed by the character configuration signal pattern of at least n transducers, each of said transducers detecting written area in at least n configurations; and

selecting one of said combinatorial arrays of said transducer positions sufficient for uniquely recognizing each of said characters, said selecting step including examining said combinatorial arrays for duplicative entries therein.