JPS58161087A - Recognizing system of single gate cell symbol - Google Patents

Abstract

PURPOSE:To evaluate and recognize a single gate cell symbol with easy procedures, by recognizing the single gate cell symbol on a basis of characteristics of a compressed lattice point label code. CONSTITUTION:In respect to the single gate cell symbol which is compressed and extracted automatically from inputted picture data as the lattice point label code indicating the figure construction near a lattice point in a lattice unit, candidate symbols 13-15 are taken out by a simple classification on a basis of a 4-direction code and information for the presence or the absence of 2 phases of the lattice point label code, and these symbols are matched with the lattice point label code from a label table and are evaluated with 1-3 degrees of coincidence. This operation is repeated for every symbol, and recognized symbol is stored successively in a symbol recognition table.

Description

Detailed Description of the Invention (1) Technical Field of the Invention A 1m circuit in which line figures and characters drawn along a predetermined grid axis are combined is input using an image input device. This invention relates to a single boot cell symbol that is compressed and automatically extracted as a lattice point label code indicating the lattice point neighborhood OSS structure in lattice units from image data.

(2) Prior Art and Problems Conventionally, in order to input the * figure of the - field circuit drawing into the needle counter, input was performed using a digitizer while manually inputting a card bunch on a pan. In the case of single boot cell 7 symbol O input, the operator found a single boot cell symbol in the show and input its position and the code of the name corresponding to the 7 symbol using digital type in the card bunch. However, this method is extremely time consuming and requires a large amount of labor from the operator.

In order to improve this, a method could be proposed in which only linear shapes are automatically extracted from the handwritten & S1 surface and input into the computer.

Conventionally, III field notation symbols are drawn with a predetermined circular lattice axis as a reference, such as m field-path l1111Ii, and 9d! Various methods have been considered for automatically extracting the position and shape of a dI field symbol from a drawing in which wiring patterns related to 1-field symbols and characters representing symbol names coexist. There are many of them in various sizes, and they are handwritten.
R-type may occur due to 1! @ Since the nature is a bird, if you try to apply these methods, firstly, the characteristics will be complicated to deal with the huge heat of the dance, and jI2 will be rounded to deal with the reluctant deformation. has disadvantages such as a larger number of dictionary patterns.

On the other hand, Hideto Honde has previously developed various methods such as ``automatic iron device for line patterns'' and ``automatic method for handwritten line drawings''. These systems optically read the image in Figure 1, in which there are line patterns and character groups drawn, for example, by hand, on the lattice axes, and use this input information as information in nine small rectangular areas based on the lattice. This compressed information is used to extract only the line pattern portion, and the information is converted and approximated to information on the lattice axes. As shown in the example below, the input image information is rounded (by verification of the input image information), and the image data O# is horizontal to the child axis.

-Using two verification windows with different sizes of vertical deviations, the first. j1120. The verification process s5 is performed on the normalized 9m shape based on the presence or absence of line segments in the grid point using the verification process 1 in the vicinity of the lattice point t115.

70[1k, Jllll, JI2 directions and the 50th corresponding direction O-ken #i0 - An amio direction is detected from the non-aggressive direction. These are put together to create the grid point label code shown in J121m. That is, 12 out of 16 pit divisions
15 The pit is weathered and the shape of the nine figures is 4 from the grid point.
The direction is indicated by down (gong, left (su), up (kiri), right (1), and corresponding to this direction, the deviation direction is 5 to 6 pits,
The negative direction is shown at 8 to 11 pits, and 7 lags are provided at 0 bit and 7 bit, respectively, depending on the presence or absence of the negative direction and the deviation direction.

Determine such a lattice point label code, remove 2 characters that are broken in the mating pattern by hand, etc., and correct the misalignment.

Process 1, such as a correction for distortion, is performed to extract only the line pattern portion.

When the lattice point labels determined by the above verification processing procedure are set to 4 and are compressed into a single file, a particular problem is the evaluation and processing of the overlap. Conventionally, flies that have been removed by humans have been treated using fairly complex procedures.

Rounding to quantify this, the combination of the four directions of the lattice points is r 0000 J to ``1111J platform 01
Prepare 6 foreshadowing lines, and use 111. “It shouldn’t happen.
The total number is calculated by setting the number of "patterns" as -1" and the number of "no@" as 10", and when it exceeds a certain threshold, the To%A is acceptable. but,
Even in this case, it is necessary to prepare 16 shapes of each line pattern 9 in the dictionary pattern, resulting in an increase in p1 dictionary memory.

(3) Object of the Invention The object of the present invention is to compress and automatically extract a lattice point label code from input dual-image data as a lattice point label code indicating the graphical structure in the vicinity of the lattice point in lattice units. ga with high accuracy in simple steps based on the information of
The purpose of the present invention is to provide a single boot cell symbol woven scheme that can be used.

(4 Most @O configuration Ninth to couple the above objectives, the aIIR method of a single boot cell symbol of the present invention mixes the ll1i11@ shape and the character ゛ drawn along a predetermined grid axis. A single gate cell symbol is compressed and automatically extracted as a lattice point label code that represents the graphic structure of the vicinity of the lattice point in units of lattice from the input image data. In the 1-originating method, a means for separating each single gate cell symbol based on the characteristics of the grid point label code obtained above, and extracting candidate symbols corresponding to the classification from the dictionary. means, an input single gate cell symbol and W
The Toh is characterized by comprising a means for evaluating the similarity between the tJ candidate symbol and the O1s.

(2) Figures 1 to 42 show the single gate cell symbol and grid point label code applied to the present invention, respectively.

FIGS. 1(α) to (6) show two examples of valleys of single gate cell symbols in the logical link diagram. Figure (6) shows 3 man power 2
Output, (J) in the same figure is a gate with 5 manpower and 1 output, and the same figure (O) is 69 with 1 manpower and 1 output, each 2 examples are input - M9 is the output -
This shows that the phase of i is inverted.

These single goo β-renopols are based on the above-mentioned proposed examples ``Hand 4 Ki 1 figure's 1 IJ-A method'' and ``1 line figure's 1 Acupuncture method with a circle''), and are based on 9 small rectangular areas based on the lattice. It is expressed in units of graphical information in the vicinity of lattice points.

Figure 2 shows the lattice point label code of the present invention, and the types and positions of the Toru, ambiguous flag, deviation direction 2 deviation 7 lag, ambiguous direction, and 4 direction codes are added as per the above proposal, and further divided into category 2. A pit indicating the presence or absence of reverse logic 7 symbols (2III) is added.

m 5122. $41110 (G) ~ (d),
511A (a) to Cy) are schematic and original explanatory diagrams of the present invention.

In this case, a single gate cell symbol consisting of the grid point label code of the 's2 diagram is extracted, and then a classification table of the applied single gate cell symbol is set up.

Figure 5-) shows the internal number of the classification table O of this single gate cell symbol, and □((, j) is, for example, @4E(-
The lattice point coordinates of the representative points in the case of a nine NAND circuit set in each direction are 647, NO indicates the classification number of a single gate cell symbol, and 9 is shown in FIG. 1(a).

(6) I (#) t) Classified by the number of inputs and outputs as shown in the two examples.

In addition, aDRcT indicates the direction of a single gate cell symbol, for example, as shown in FIG.
Set to RCT-0 to 4. As will be described later, the SNO and FLAG (flags) are set by the processing of the present invention when the SVI is completed and the SNO is given at 9 o'clock, and when -1 is not possible, the FLAG is set. Moreover, TOTAL indicates the number of round single-gut cell symbols 0ffl that are classified and extracted.

gs diagrams) to (b) show the processing and dictionary structure for the Kuton-Gutsell symbol given pNO by the 4th symbol classification table.

Each escape procedure is shown below.

(1) Search symbol classification table.

Search the symbol classification table in Figure 114 for the single boot cell symbol shown in Figure (a), and find the lattice point l! Mark (I,
j), >, classification number No., and direction 80RCT.

Kokote is ((I, js) No=1s, 5DRCT-
It is assumed that 0 is taken out.

(2) Search candidate symbol table.

As shown in (6) of the same figure, a candidate symbol table is provided to extract candidate symbol numbers and candidate lines to be drawn for each division of JI & 4 diagrams. For example, in the case of a single boot cell symbol with three human power and two outputs as shown in the figure In the interlaced horizontal complementary symbol table with classification number 15 and direction 5DRCT-0, st
The a-complement symbol 15.14.15 is extracted.

(3) Symbol g iron dictionary and conversion.

Figure (a), (Shun, (-) indicates the contents of the symbol -4 Jibara, which is extracted from the M diagram (&) and corresponds to the Kusabao symbol Qiaogo. At each grid point of the left gate of each The corresponding (stj) and lattice points indicate the shape of the lapel cord.

The information that indicates that there should be no such situation at that address is information that indicates that the situation should not occur at that address. On the left side of the lower shelf is Dictionary O-1
115, and the right side shows an inverse logic symbol (2III), that is, an anti@@O error.

These 0gm dictionaries are converted by direction 5DRCT.

(6) Matching of symbol l1dll dictionary and grid point label code.

As shown in the figure, symbol ga dictionary 15.14°15
and the grid point label code (2), 4-way code) (chain-like operation), and the result is 117A.
(1) Og * Hi y 711C@III f
b.

llI woven buffer OAO is a 4-way code once every time,
The BID column shows the degree of coincidence of the position @<211>, and the C column shows the degree of inversion of the inversion phase described in the dictionary and seen from the foreshadowing of the 9th place (2jlF).

(Determined.

(L) If M+B is full; that is, M+B and the symbol #III& is written in the dictionary and is twice the size of the dictionary, then 7 candidate symbols are wits results. The first of the m iron buffer Og4 complementary symbol numbers of the same 1gI-) is woven into this. Then, put the O symbol honor number 16 in 8NO.

(II) If there is nothing for which A+B is full-thur, then
C is the full score, that is, the number of phases (2N) described in the symbol ms dictionary, and among the 4 that are larger than a certain threshold, the one with a moth-sized score is s
aE iron result. Then enter that symbol number in SNO.

(ili) If neither (1) nor (it) has anything to be improved, set A0B+CK@l, and among those that are greater than that value, return ilg-result.

Then enter that symbol number in 8NO.

Ov) If there is no item that matches (1) to (ill), it is determined that it is not a symbol, and the symbol classification table (
Set 11″ to the complement of DFLAG (flag).

As described above, the procedure of similarity calculation is much simpler than in the proposed example.

, FIGS. 6(a) and 6(6) are explanatory diagrams of the 1I configuration of the embodiment of the present invention according to the above-mentioned R rule.

The figure shows the above-mentioned far-fetched examples of ``Handwritten 11 figure self-1 subtraction method'' and ``1uiii shape with a circle og * million formula'', normalized as grid point label code, shi, and line Pattern breakage correction 2 characters #glue, misalignment correction, ambiguity correction, etc. 04
The correction process is applied to the first completed manual, and the result is matched with the dictionary memory (similarity calculation), and the present invention is applied to the result. It is something.

(Ik) Then, the handwritten drawing is loaded into the image input device 1, and the fist data is stored in the WIi memory 2.
be remembered.

The input state of the reference point is detected from this image data by the reference point detection circuit 4, and the address of the ninth lattice point is corrected based on the input distortion and held in the lattice point table 5.

Next, the control unit 11 obtains nine addresses JKJ! from this grid point table 5! J, lli steel plate 2 is taken out in a 2x20 machine board with O size between the grid axes, and this is placed in the grid mounting part 1iII.
Pass it to I (horizontal) 6 and Yangzi conversion circuit (direction) 8,
0*The resulting data is grid-pointed and sent to the bell code generation circuit (horizontal) 7 and the grid-point label code generation circuit (m-direction).
In step 9, the initial lattice point Laperude LBL is extracted. This is then stored in the LBL table 13.

According to this initial lattice point label code LBL, the verification window setting circuit 12 sets 41 verification windows of a predetermined size, and using these, the verification circuit 5 performs the Is1 verification process. The resulting s1 certificate deviation information SX1.8
Store Y1 in 8X1-3Y1 f-pull 16.

Using the thus obtained #11 verification deviation information 118 and lattice conversion circuit (-direct)
8 and the grid point label code generation circuit (horizontal) 7 and the grid point label code generation circuit (#11 direct) 9 to obtain the IEI verification label code L, 81, which is stored in the LB1 table. Fill in 14. Based on this LBl, the verification window setting circuit 12 sets $2
is set, and using this, the verification circuit 3 performs IIK 2 machine section processing. Second verification deviation information SX2 obtained as a result
．． Store Sr1 in the 8X2/SY2 table 17.

Thus obtained 9j12 verification deviation information 8X2゜J
iY2) After the grid point address obtained from 5 on the grid point tape is shifted and normalized by the address conversion circuit 18, it is converted to the above and PIiIl and a second verification label code I,
82 and stores it in the Lj12 table 15.

Next KI! In order to check the detailed 71As state near the child point, verify the jlIs4IIL test window setting circuit 12.
- set to 0j11. In the same way as in the case of the j12 verification test, the verification circuit SK performs a test. 70# Send the obtained data to the LBs generation circuit 19 to obtain the is s am label code LBS and store it in the tLB5 table 20.

And Lj15 table 20 second verification label code L Koboku, Lll, initial lattice point label code LBL from table 13, Lf11 0* from table 14
1 verification label code L11. Happy 2nd test liE label from LB2 table 15! -Do Lj12. JiXl-
3Y1? - Joy 1 verification deviation feeling from pull 16 118X1
．． 8Y1. And #12 verification deviation information from BN2/SY2 f-pull 17 @ 8X2.8Y2 etc. is processed and corrected in lattice point label code determination path 21. The resulting good lattice point label code LABEL is stored in the two-bell table 22.

The lattice point label code from the label code table 22 is processed by the pair processing circuit 23 to remove the relationship between the child points of J74 that is not a pair, and then is processed by the line pattern breakage correction circuit 24. Line pattern breakage t-correction,
Character removal*-path (Z) 25) removes those whose relationships between grid points indicate characteristics of characters, and then moves to the next deviation correction circuit (I) 24.
Even if the deviation 7 lag of the lattice point label code at that lattice point is 111 and 6, if the deviation 7 lag and ambiguity flag of the lattice point opposite to this deviation direction are both @0'',
Todoroki's first grid point shift 7 lag is set to O'. 9. Even if the ambiguous 7 lag of the lattice point label code at that lattice point is @1" in the heavy correction circuit (I) 27, at least 12 directions out of 4 directions are 11" indicating the ambiguous direction. If the gap 7 lag and ambiguous bladder of the lattice points facing each other in the plh direction are 1''0'', then the ambiguous 72 lag of the first lattice point of Todoroki is dropped to @0''.

In the following blockage examples, character removal, misalignment correction, ambiguity correction, etc.
*Ya is done repeatedly and blindly, but this is true! These are omitted in i@. Then, the lattice point label codes in the label table 22 are corrected by the above-mentioned correction circuits 25 to 27 and sent to the similarity calculation circuit 29.
The II quasi-pattern 7 from the above is input and matching (similarity calculation) is performed for each single boot cell symbol.

These single boot cell symbols are searched in the symbol classification table 5o in the same figure (&), and the above-mentioned svm tin salt is applied to each symbol. Its position <tm-jm> and classification number -j
t(13)lJ (80RCT-0) is out.

It will be done.

Next, as explained in the Kals diagram (b) to ω, input the symbol number [15] from the symbol table 3o to the Schiff candidate reconnaissance table 51 in the same figure (6), and enter the candidate symbol number [ ■, 14.15) are extracted. Next, Figure 5 (C)
.

(4, , (*) corresponding candidate symbol numbers) are sequentially taken out, the symbol flR dictionary conversion circuit 33 converts the direction, and then the matching circuit 54
is inputted and matched with the lattice point label code of the label table 22, and the #P value is calculated according to -softness (■) to (■) of JII5 Figure iI). This is repeated m times for each symbol, and the g-decreased symbols are sequentially stored in the symbol-to-tape area.

(6) Detailed Description of the Invention As described in detail, according to the present invention, a single code is extracted from incoming image data as a lattice point label code indicating the graphic structure in the vicinity of the lattice point in units of lattice using fEm. For the boot cell symbol, the 4-way code of the grid point label code and 2
Based on the information on the presence or absence of a phase, candidate symbols can be extracted and matched using a quantitative classification.
dll! It is possible to do so.

[Brief explanation of the drawing]

Figures 1m1 (a) to (#) and 1s2 are the single Gut cell symbols and grid point label codes that apply to the present invention, Figure 5, 411 (8) to (b), 51-》~ @ is Honji @OIR Shizuku and principle il! Ming figure, j14 figure (d), (
b) Embodiment O of Morimoto's Invention Structure 4 Theory @Diagram In the figure, 1 is an image input device, 2a is an image printer, 5 is a test #E circuit, 4 is a Go quasi-point machine, and 5 is a grid point table, 6 is a grid change supply *< horizontal), and 7 is a grid point label code generation process (horizontal)
, 8 Hiro lattice conversion circuit (-direct), 9 lattice point label; table, 14 is L,81 table, 15 is LB2 table, 14 is SX1. 8Y1 table, 17 is SX2.
8Y2 table, 1゛8 is address conversion circuit, 19 is L
jl! ! Generation open circuit, 20 is L, B! S table, 2
1-line lattice point label; code determination circuit, 22 is a label table, 25 is a countermeasure circuit, 24 is a line pattern breakage correction circuit, 25 is a literature theory*i path (I), 24 is a deviation correction circuit (I
), 27 is a%/% heavy correction circuit (I), 28 is a dictionary memory, 29 is a similarity calculation circuit, 5a is a symbol table, 51d is a symbol supplementary table, 32 is a symbol table.
55 is a symbol im* dictionary conversion circuit, 34 is a matching circuit, and 35 is a symbol-text table. Registered applicant Fujitsu Ltd. Sub-agent Bencher 1) Zen Saka 1 Figure 1 Figure 2 Figure 3 Figure 4) LIKl-i (1:)υbashi'-I 5DR
CT=2 5DRCT-3 Fig. 5 (a) (b) From Fig. 6 Similar Hiko operation circuit Procedural correction 11 (method) from Rahel Tefl % formula % 2, origin @ 04 $ 4 - One relative of gate cell symbol & 114 with the side dishes to be corrected! Person in charge: 11 people Location: 1015 Kamiodanaka, Nakahara-ku, Yozaki City
Mr. 4 (522) J1 Shihyu Co., Ltd. Daikikan
Tan Yamamoto Sada' Kashidai Assassin 7,7゜Delivery date: June 29th, Figure 6 (b)

Claims (1)

[Claims] A 1 m@ path consisting of a mixture of line figures and characters drawn along a predetermined lattice axis is read at the 1ilii wife input lft position, and the figure structure near the lattice points is calculated based on the lattice-based image data of the craftsman car. On the other hand, each single boot cell symbol is compressed and self-extracted as a lattice point label code to represent. The present invention comprises a means for classifying, a means for extracting a complementary symbol corresponding to the classification from a dictionary, and a means for evaluating similarity between an input single gate cell symbol and a # period candidate symbol. Single gate cell symbol single weaving system.