Pattern recognition using an associative store
    1.
    发明授权
    Pattern recognition using an associative store 失效
    使用相关商店的图案识别

    公开(公告)号:US3626381A

    公开(公告)日:1971-12-07

    申请号:US3626381D

    申请日:1969-10-20

    Applicant: IBM

    CPC classification number: G06K9/68

    Abstract: Graphical patterns, such as characters, are represented by sets of binary symmetric numbers (1, - 1). An associative store holds a first table of numbers (1, 0, - 1) organized into words representing the coefficients of hyperplanes for dividing a pattern space into volumes such that points in the same volume belong to the same pattern class. Each hyperplane representation is contained in a pair of words holding respectively the true and complemented forms of the hyperplane coefficients. A first associative table look-up determines which word of each pair more closely matches a particular pattern number set, by using the number set as a search argument. The resulting binary number string, indicative of a particular volume in the pattern space, is then used as a search argument for a second table in the store. The second table is organized into words representing each individual volume and the name of the pattern associated with that volume. An exact match on the second table look-up thus produces an output indicative of the name of the pattern to be recognized.

    Selection circuit
    3.
    发明授权
    Selection circuit 失效
    选择电路

    公开(公告)号:US3566367A

    公开(公告)日:1971-02-23

    申请号:US3566367D

    申请日:1969-02-20

    Applicant: IBM

    CPC classification number: G11C15/04 G01R19/0038

    Abstract: THIS INVENTION PROVIDES AN ASSOCIATIVE MEMORY (OR OTHER ORDERED ARRAY OF ELECTRONIC CIRCUITS) WITH MEANS FOR STEPPING FROM WORD TO WORD THROUGH THE ARRAY FOR CERTAIN OPERATIONS AND A NOVEL CIRCUIT FOR BYPASSING DEFECTIVE WORDS. AN ARRAY WITH DEFECTIVE COMPONENTS REMAINS OPERABLE AT A REDUCED CAPACITY.

    Associative memory
    4.
    发明授权

    公开(公告)号:US3609702A

    公开(公告)日:1971-09-28

    申请号:US3609702D

    申请日:1968-10-23

    Applicant: IBM

    CPC classification number: G11C15/04

    Abstract: This invention relates to an associative memory for the storage of digital data in which each word location of the memory is provided with two or more match triggers. Mans is provided for registering matches or mismatches in a selected trigger and for controlling operations on the memory in response to the contents of a selected trigger. Several operations are described which use the plural triggers.

    CHARACTER FORM RECOGNITION
    9.
    发明专利

    公开(公告)号:CA944081A

    公开(公告)日:1974-03-19

    申请号:CA63330

    申请日:1969-09-29

    Applicant: IBM

    Abstract: 1,230,834. Character recognition; associative stores. INTERNATIONAL BUSINESS MACHINES CORP. 23 Oct., 1968, No. 50202/68. Headings G4C and G4R. A set of d binary symmetric (i.e. possible values + 1 and -1) numbers, e.g. from matrix optical sensing of a character to be recognized, is classified by using it to interrogate entries in an associative store representing the coefficients, restricted to possible values + 1, 0, -1, of the equations of planes in d-space which divide the space into volumes such that substantially all points in the same volume represent sets of numbers belonging to the same class, to obtain an indication of on which side of each plane the point representing the set of numbers to be classified lies, these indications being used to interrogate other entries in the same (or a different) associative store to identify the volume in which the point lies. The store holds two words for each plane, holding the coefficients in true and complement form respectively, the complements of + 1, 0, -1 being -1, 0, + 1 respectively, and + 1, -1, 0 being stored as 1, 0 and " don't care " respectively. " Don't care " gives a match whatever the interrogating input. Analogue voltages, one from each word, represent the extent of mismatch, and these two voltages for each plane are subtracted in a differential amplifier to set a latch or not according to the sign of the result to indicate on which side of the plane the point lies. Alternatively, interrogation for a given plane may be serial by word and bit each bit mismatch with one word incrementing a counter and each with the other decrementing it. The " which side of plane " bits, set into latches, are used to interrogate the second set of entries, each of which includes a set of such bits for a respective volume and a name associated with the volume which is read out to identify the character.

Patent Agency Ranking