会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Stored logic recognition device
    • 存储逻辑识别设备
    • US3573730A
    • 1971-04-06
    • US3573730D
    • 1969-10-15
    • IBM
    • ANDREWS DOUGLAS RATRUBIN ALLAN J
    • G06K9/62G06K9/68G06K9/06
    • G06K9/68
    • A stored logic character recognition system is disclosed that includes a read-only memory in which is stored a set of functions, the evaluation of which leads to the classification of a given binary pattern. A measurement register performs logical operations on the pattern data to generate a plurality of measurement words. An identification sequence for each character is begun by fetching a predetermined word from the read-only memory to a control-word register. Succeeding words are then fetched to a processor register and decoder where they are interpreted as terms of a logical function. The processor evaluates the logical function against the measurements in the measurement register with the final evaluation of a single logical function resulting in the selection of one of two branch addresses in the control-word register. By an iterative or multilevel type of operation, measurements of the character image are built up until an identification is achieved.
    • 2. 发明授权
    • Probabilistic logic character recognition
    • 概率逻辑字符识别
    • US3233219A
    • 1966-02-01
    • US16160861
    • 1961-12-22
    • IBM
    • ATRUBIN ALLAN JLAMY RICHARD C
    • G06K9/64
    • G06K9/6203G06K9/6278
    • 1,025,528. Automatic character reading. INTERNATIONAL BUSINESS MACHINES CORPORATION. Dec. 20, 1962 [Dec. 22, 1961], No. 48174/62. Heading G4R. In a character reader the character is sensed to obtain a stored array of binary signals representing the character, there being, for each possible character, a network of resistors connected to the positions of the storage array weighted according to the probabilities of the occurrence of either of the two conditions. The probabilities are determined by trials and may be represented as in Fig. 3a for a simplified array. The figures indicate the probabilities that a " 1 " will occur in the corresponding position when a character "0" is sensed. Resistors weighted according to the logarithm of these probabilities are connected to the outputs of the storage triggers as shown in Fig. 2 and the currents are summed in a device 29. There is a resistor network for each character and the lowest signal is determined in a comparator 36 to identify the character. In the apparatus of Fig. 1 a magnetic character 11 is passed first under an A.C. magnetizing head 14 and then under sensing heads 15. The signals are sampled to obtain an array of signals such as are shown in Fig. 3c for character " 0 " or Fig. 3d for character "1". These are stored on triggers TA1-TC3, Fig. 2, and connections from the " 1 " and "0" outputs taken to resistors arranged in groups C1 (for character "1"), C0 (for character "0") and so on. The weighting of the resistors, being in accordance with the logarithm of the probability that a " 1 " or " 0 " will be produced in that position by the scanning of a reference character, the output of the summing device 29, 30 represents the product, that is the probability that the whole pattern of signals would result on scanning the corresponding reference character. These signals are compared to find the smallest current and this is compared with a predetermined small current to test the degree of match obtained. If the smallest current is sufficiently smaller than the next smallest and smaller than the predetermined current a character indicating signal is given and a trigger set in character store 37.