×

Pattern recognition data processing device using an associative matching method

  • US 5,214,717 A
  • Filed: 02/25/1991
  • Issued: 05/25/1993
  • Est. Priority Date: 02/26/1990
  • Status: Expired due to Term
First Claim
Patent Images

1. A data processing device for processing feature data for a plurality of characters being compared through an associative matching method of character recognition, comprising:

  • a first data memory means for memorizing at least stroke information for input character pattern supplied in dot units;

    a first address generating means for generating first addresses for specifying positions at which the stroke information is memorized;

    a second data memory means for memorizing weight data for the stroke information;

    a second address generating means for generating second addresses for reading the stroke information memorized in said first data memory means and third addresses for reading, from the second data memory means, the weight data corresponding to the stroke information read by the second addresses;

    a plurality of accumulation means provided in correspondence with a number of stroke directions, for accumulating weight data outputted from said second data memory means;

    a decoding means for decoding the stroke information memorized in said first data memory means and for determining weights in respective stroke directions to enable said plurality of accumulation means according to decoding results from said decoding means so as to generate feature data of the input character patterns;

    a dictionary memory for memorizing feature data of dictionary patterns, the feature data being divided into classes of features;

    a plurality of distance computing means operatively connected to receive feature data of input character patterns, for computing distances between the feature data of the dictionary patterns memorized in said dictionary memory and the feature data of the input character patterns, and for sequentially inputting result values from computing the distances to a first stage of plural pairs of serially connected plural class selection means;

    plural pairs of serially connected plural class selection means operatively connected to said plurality of distance computing means, for comparing the sequentially inputted result values with memorized result values of distances inputted sequentially earlier by said plurality of distance computing means so as to at least one of maintain memory of the earlier memorized result values and output the inputted result values when the earlier memorized result values are less than the inputted result values, and of output the earlier memorized result values and memorize the inputted result values;

    a plurality of score computing means operatively connected to respective outputs from said plural paris of serially connected plural class selection means, for obtaining scores corresponding to the feature data of the input patterns of the characters to be recognized; and

    a score sorting means for determining rankings of the dictionary patterns in terms of which of the dictionary patterns derived highest scores obtained at said plurality of score computing means.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×