JPH01211191A - Dictionary sorting processor - Google Patents

Abstract

PURPOSE:To attain the classification of the combination between ascending and descending power priority and first- and last-arrival priority by storing either of distance information in an X-th stage and an X-1-th stage or a distance operation result as the distance information inserted into a classification memory. CONSTITUTION:The distance data of a memory 9 is classified into an ascending power and a descending power according to an aim. A comparative priority circuit 32 compares an operation result AD of a distance arithmetic part 6 with information Dx in the x-th stage of the memory 9. At the time of ascending power designation, AD<Dx is selected, at the time of descending power designation, AD>Dx is selected, at the time of AD=Dx and first-arrival priority designation, Dx is selected, at the time of last-arrival priority designation, AD is selected, and it is outputted from a comparative priority circuit 32. Consequently, a selector 17 selects one piece of information Dxx out of AD, Dx and Dx-1, and it is stored into the x-th stage of the classification memory 9. Thus, the memory 9 is successively rearranged according to the sequence of the ascending and descending powers and first- and last-arrival. The above-mentioned constitution can be applied to the retrieve, preparation and alteration of a dictionary, and the classification is attained according to the aim.

Description

[Detailed Description of the Invention] [Summary] A distance calculation is performed from the feature amount data from the dictionary memory and the feature amount data of the recognition target character from the image memory, and the sorting circuit performs sorting in the sorting memory according to the calculation result. Regarding the dictionary sorting processing device that performs the A first latch circuit that latches the data in the Xth row, a second latch circuit that latches the distance data in the previous stage of the data in the Xth row, and compares the distance calculation result with the data in the Xth row. A comparison priority circuit that selects the magnitude relationship between the two by ascending/descending designation corresponding to the sorting memory, and when they are the same, generates the selected output by first-come/last-come priority designation, and A third latch circuit that latches the comparison result, and based on the comparison results of the comparison priority circuit and the third latch circuit, calculates the distance calculation result, the X-th stage data, and the x-1st stage distance and a selector that selects one of the data and stores it in the Xth stage of the sorting memory.

[Industrial Application Field] The present invention relates to a dictionary sorting processing device, and in particular, performs a distance calculation from feature data from a dictionary memory and feature data of a character to be recognized from an image memory, and performs a distance calculation based on the result of the calculation. The present invention relates to a dictionary sorting processing device in which a sorting circuit performs sorting on a sorting memory.

Generally, a dictionary sorting processing device includes a dictionary search section l for character recognition and a dictionary memory (DM) 2, as shown in FIG.
, an image memory (IM) 4, and a sorting memory (SM) 9 as a candidate character register.

The dictionary search unit 1 further uses the 4I stored in the dictionary memory 2.
A distance calculation unit 6 performs a distance calculation from the quasi-feature amount data 3 and the feature data 5 of the character to be recognized, and the distance calculation result 7 is compared with the candidate character data read from the sorting memory 9 and sorted. A sorting circuit 8 writes the sorting results back into the sorting memory 9.

Among these, the sorting memory 9 is as shown in FIG.
Candidate characters from 1 to N+1 are provided, each having a sorting memory address Xa (initial value)+0 to χ. Ten N
, and distance data of -DH is stored in each address. In this case, χ is the sorting stage l
&o-N, and Dw indicates the distance data of the X-th stage. Further, in this example, the candidate characters are arranged in ascending power order, with the lowest N+1 candidate character having the largest distance data. Therefore,
Conversely, there is also a case in which the lowest N+1 candidate characters have the smallest distance data and are arranged in descending power order.

In such dictionary sorting processing devices, as information communication processing becomes more sophisticated and integrated, there is a high demand for media conversion from image information to code information using character recognition technology. Since it is a print media, there is a demand for faster and more diverse character recognition processing for Japanese documents.

[Conventional technology]

FIG. 6 shows a sorting circuit in a conventional dictionary sorting processing device, and the distance calculation result AD from the distance calculation section 6 is sent to the selector 17 and also to the comparator 2o.

Further, the distance data DX of the Xth stage read from the sorting memory 9 is sent to the read data latch circuit (flip-flop) 12, and the clock 14 generated by the sorting clock generator 19 from the distance calculator 6
The signal is relaunched and sent to the selector 17, as well as to the comparator 2o and latch circuit 13. The latch circuit 13 sends the previous data latched by the latch clock 14 to the selector 17.

Therefore, the distance data AD, the distance data Do+ of the xth stage, and the distance data DX-1 of the stage one stage before the The selection criteria is the output 21 of the comparator 20 (the comparison result between the calculation result AD and the distance data D), and the output 23 of the latch circuit 22 that latches this output 21 using the latch clock 14 (the calculation result AD and the comparison result). The sorting data D and lX of the Xth stage selected as a result are stored in the Xth stage of the sorting memory 9. Although not shown, the distance data in each stage of the sorting memory 9 are stored together with codes specifying the corresponding characters.

FIG. 7 shows the circuit of FIG. 6 in more detail, and the selector 17 is composed of three AND gates 17a to 17c, a NOR gate 17d, and an inverter 17e. Further, the comparator 20 is a single output type comparator 20
a, and an AND gate 20b whose input signals are the output of the comparator 20a and the sorting instruction signal 27.
and a Nantes gate 20c. Output 28 of AND gate 20b and output 2 of Nantes gate 20c
9 (corresponding to signal 21 in FIG. 6) are manually input to AND gates 17a and 17b, respectively.

The output 29 of the Nandt gate 20c is an inverted version of the output of the AND gate 20b, and is input to the launch circuit 22.

Therefore, the inverter IN■1.2 shown by the broken line in FIG.
If the AND gate 20b and the output 31 are omitted instead, the control inputs to the selector 17 can be reduced to signals 21 and 23, as shown in FIG.

Next, the operation of the above conventional example will be explained with reference to the time chart shown in FIG.

As shown in FIG. 8, the calculated distance data AD is x
Assuming wl, D, < AD < DI, the first distance data D0 latched in the launch circuit 12 is compared by the comparator 20a of the comparator 20, and as a result of the comparison, the output 21 of the comparator 20a is 1L°. The output 28 of the AND gate 20b goes to the "L" level and the output 29 of the Nant gate 20c goes to the "H" level, so the data D0 is passed through the AND gate 17b, the NOR gate 17d, and the inverter 17e as the sorting data DllX. It is output and stored in the first stage of the sorting memory 9.

At this time, the AND gate 17a is disabled because the Q output 30 of the latch circuit 22 is at the “L”°° level, and the arithmetic data AD
is not sorted.

Furthermore, the AND gate 17c also has the ζ output 3 of the latch circuit 22.
1 is initially at "L", so it is in a disabled state.

When the next distance data D is read out from the sorting memory 9 by the read data latch clock 14,
This time DX-, =D, ,D, =D.

Therefore, the output of the comparator 20a becomes "H" level, and when it is ANDed with the sorting instruction signal 27, it is inputted to the AND gate 17a as a signal 2 days. At this time, since the signal 29 was at the "Ho" level as a result of the previous comparison, the Q output 30 of the latch circuit 22 is also at the "H" level.

Therefore, the calculation result AD passes through the AND gate 17a and becomes the sorting data DXX at 2 of the sorting memory 9.
Sorted into rows.

At this time, since the current signal 29 is at the "L" level and the ζ output 31 of the latch circuit 22 is at the "L" level, the data D0 and Dl are not output.

At the next read clock 14, D x−, = D +
, Dx=Dz, so D is sorted into the third stage of the sorting memory 9 as sorting data.

After this, the distance data Dz-t)s is sequentially shifted to the larger distance data, and the sorting of one unknown character in the sorting memory 9 is completed.

In FIG. 8, the outputs 18 from the selector 17 are sequentially stored in the sorting memory 9.
l, D2',,, → D6I11D1-1D2 meeting...
It is shown as follows.

In this way, the distance data of candidate characters stored in the sorting memory as a candidate character register, which is an external memory, is compared with the distance data input to the sorting circuit every time the distance calculation for one character is completed. If the data does not fit into the candidates, that data is discarded, and ultimately the candidate character closest to the recognition target character remains.

[Problem to be solved by the invention]

In such a conventional dictionary sorting processing device, the sorting memory is sorted in ascending order, that is, from the smallest distance data to the largest distance data, and data larger than the distance data of the lowest candidate is discarded.

Furthermore, in the case of the same distance data as the lowest candidate, the first-arrived data has priority. This is because the comparator 20 has, for example, AD<DX in the case of 'H' output, and A in the case of 'L' output.
This is because D≧D8.

For this reason, when considering dictionaries, it was not possible to collect a wide range of data, and the advantageous conditions when considering dictionaries, such as the sorting memory being an external memory and the ability to increase the number of candidate characters as much as possible, were not fully utilized.

Therefore, the present invention provides a dictionary sorting process in which a distance calculation is performed from the feature amount data from the dictionary memory and the feature amount data of the recognition target character from the image memory, and the sorting circuit sorts the sorting memory according to the calculation result. The device can be used for dictionary searches as well as dictionary creation and modification, and the purpose is to enable sorting according to the purpose by specifying the device.

[Means for Solving the Problems] In order to achieve the above object, in the dictionary sorting processing device according to the present invention, as conceptually shown in FIG. First latch circuit 1 that latches the data DX of the stage
2 and the previous stage distance data Dx- of the X-th stage data D.
, the second latch circuit 13 that latches the distance calculation result AD and the X-th stage data D, and determines the magnitude relationship between the two by specifying the ascending power/descending power corresponding to the sorting memory 9. a comparison priority circuit 32 that generates the selected output based on first-come/last-arrival priority designation when they are the same; a third latch circuit 22 that latches the previous comparison result of the comparison priority circuit 32; Based on the comparison results of the circuit 32 and the third latch circuit 22, the distance calculation result AD
, the X-th stage data D, and the x-1st stage distance data D
and -1, and a selector 17 that selects one piece of data from ``-1'' and stores it in the X-th stage of the sorting memory 9.

[For production]

In the present invention, first, the distance data is sorted in the sorting memory 9 so that it is ascending or descending depending on the purpose, and then, in the comparison priority circuit 32, the calculation result AD and the X of the sorting memory 9 are sorted. Row data D
Compare with X.

In this case, the comparison results are: ■AD<DX, ■AD>
There are three types: DX, ■AD-D, and ■ is selected when the designation is to ascend, ■ is selected when the designation is to move, and when there is a relationship of ■, if it is the first-come, first-served designation, An output is generated from the comparison priority circuit 32 so that the originally stored Dx is prioritized, and if the later arrival priority is specified, the calculation result AD is preferentially selected.

Therefore, when the output from the comparison priority circuit 32 is generated, the selector is selected from among the distance calculation result AD, the X-th stage data D, and the χ-1st stage distance data DX-1, as in the conventional case. 17 selects one data DXl+ and stores it in the Xth stage of the sorting memory 9.

In this way, the sorting memory can be sequentially rearranged depending on whether the sorting memory should be ascended or descended, and further depending on whether it is first-come-first-served or last-come-first-served.

〔Example〕

Hereinafter, the dictionary sorting processing device of the present invention described above will be explained along with examples.

FIG. 2 shows an embodiment of the sorting circuit used in the dictionary sorting processing device of the present invention, and the configuration of the comparison priority circuit 832 is different from the configuration shown in FIG.

The comparison priority circuit 32 in this embodiment inputs the calculation result AD and the distance data D of the X-th stage of the sorting memory 9, and receives the data D as AD<DX, AD>D.

, ■A comparator 32a having three output terminals T1 to T3 each having a 5H level when AD=D;
A selector 32b selects the output signals of the output terminals TI and T2 of the comparator 32a based on a signal specifying whether to increase or decrease (this is a signal generated by a sequencer not shown), and output terminal T3 of the comparator 32a and
It is composed of an AND gate 32C with the last arrival priority designation signal (this signal is also selected by a sequencer not shown), an OR gate 32d with the output of the selector 32b and the output of the AND gate 32c, and the above-mentioned gate 20b120c. .

In this embodiment as well, the signals 28 and 31 can be generated inside the selector 17 by using the inverters INVI and INV2, as in FIG.

Next, the operation of this embodiment will be explained below.

FIG. 3 shows the logical state of the output signal of the OR gate 32d in FIG. sorted in descending order. Further, it is assumed that x=1 and the relationship of distance data is Do < AD < DI as in the above conventional example.

In such a case, the comparison result of the comparator 32a is that the output terminal TI becomes "H" level and the output terminals T2 and T3 become "L" level.
Since b selects the output of output terminal T2, OR gate 3
The input of 2d becomes "L" level. Furthermore, when the last arrival priority designation is set to 'H' level, the output of the AND gate 32c becomes 'L' level. Therefore, the output of the OR gate 32d becomes ``L''°.

If AD>D, the level of output terminal T2 is “
Therefore, the output of the OR gate 32d which receives this via the selector 32b becomes "H" as shown in FIG.
level.

Similarly, the case of ascending/last-come-first-served priority and descending/first-come-first-served priority is also shown in Fig. 3.

Incidentally, in the case where priority/first-come, first-served priority is specified in the present invention, the same time chart as the time chart shown in FIG. 8 will be obtained.

〔Effect of the invention〕

As described above, according to the dictionary sorting processing device of the present invention, due to the ascending/descending and first-come/last-come priority designation, the distance data DLX stored in the sorting memory is the X-th distance data Dk before sorting, Since the configuration is configured so that one of three items, the distance data D I+-1 of the x-1st stage and the distance calculation result AD, can be entered, in addition to the ascending priority/last arrival priority, the ascending priority/last arrival priority, It is possible to perform sorting on a first-come, first-served basis, and on a last-come first-served basis, and can be used not only for dictionary searches but also for examining the contents of dictionaries.

[Brief explanation of the drawing]

FIG. 1 is a block diagram conceptually showing a sorting circuit in a dictionary sorting processing device according to the present invention; FIG. 2 is a block diagram showing an embodiment of a sorting circuit used in a dictionary sorting processing device according to the present invention; The figure shows the logical states of the comparison priority circuit used in the dictionary sorting processing device of the present invention in correspondence with ascending/descending and first-come/last-come priority designations. FIG. 5 is a block diagram showing the overall configuration; FIG. 5 is a diagram showing a sorting memory; FIG. 6 is a block diagram showing a sorting circuit in a conventional dictionary sorting processing device; FIG. 7 is a block diagram showing a sorting circuit in a conventional dictionary sorting processing device. FIG. 8, which is a diagram showing an embodiment, is a time chart showing sorting processing in the case of ascending priority/first come first served. 1 and 4, 2...Dictionary memory, 4...Image memory, 6...Distance calculation section, 8...Sorting circuit, 9...Sorting memory, 12.13.22 ...Latch circuit, 17...Selector, 32...Comparison priority circuit. In the drawings, the same reference numerals indicate the same or corresponding parts. Intention of sorting circuit Fig. 1 Fig. 2 and conventional sorting circuit Fig. 6 Fig. 7

Claims (1)

[Claims] Distance calculation is performed from the feature amount data from the dictionary memory (2) and the feature amount data of the recognition target character from the image memory (4), and the sorting circuit ( 8) is a dictionary sorting processing device that sorts a sorting memory (9), and the sorting circuit (8) includes a first latch that latches the x-th stage data (D_x) read from the sorting memory (9). Circuit (12)
and distance data (D_x) before the x-th data (D_x).
a second latch circuit (13) that latches the distance calculation result (AD) and the x-th stage data (D_x
), the comparison priority circuit selects the magnitude relationship between the two according to the ascending/descending designation corresponding to the sorting memory (9), and when they are the same, generates the selected output according to the first-come/last-come priority designation. (32) and the comparison priority circuit (32)
), the third latch circuit (2) latches the previous comparison result of
2), the comparison priority circuit (32) and the third latch circuit (22)
Based on the comparison results of both the distance calculation result (AD) and the x
The row data (D_x) and the x-1 row distance data (
A dictionary sorting processing device comprising: a selector (17) that selects one data from D_x_-_1) and stores it in the x-th stage of the sorting memory (9).