JPS61129974A - Graphic processor - Google Patents

Abstract

PURPOSE:To carry out graphic processing in both black and white areas with a single scanning by comparing the variation point address of adjacent two scanning spots and separating and judging into linked picture element pattern, depending on the results of comparison. CONSTITUTION:The variation point address data a(p) on the scanning spot A of the image data are arranged in ascending sequence (a(p)<a(p+1)). The variation point address b(q) on the scanning spot B, immediately before the scanning spot A, are similarly arranged in ascending sequence comparing the ascending order a(p) with b(q), depending on whether or not the results coincide with the conditions T1-T4 preset, the linked state of black data or white data, are judged 1 for conformance with the preset running state B1, W1.... Also for the scanning starting and ending parts, the running state is judged 1 according to the preset condition. The output signals are stored in the memory table 2, respectively by white or black data, and the data are computed 3. Thereby, with one scanning, graphic processing of both black and white areas is possible.

Description

[Detailed Description of the Invention] Technical Field> This invention relates to a graphic processing device, and more specifically,
The present invention relates to a graphic processing device that performs logical operations on image data expressed by change point address data (pixel coordinate values) and performs arithmetic processing on the image graphics.

<Prior Art> In order to make a facsimile machine or the like more intelligent, it is necessary to detect the connection state of pixel data between each scanning line and recognize symbols, figures, etc. written on a document.

Conventionally, for image data read by a reading device and binarized with white level pixels as "O" and black level pixels as "1'°," in order to calculate the area of the image figure or the circumscribed rectangle, etc. In this method, first, each pixel is subjected to arithmetic processing, divided into connected regions of black level pixels, and the number of black level pixels in each region is calculated as a coefficient.

However, in this type of image processing, each pixel is the processing unit, so the amount of image data to be processed increases and the processing time becomes longer. This method requires pit operation, which has the disadvantage of decreasing efficiency.

Therefore, in order to reduce the number of image data to be processed, the M pixels of one scanning line are sequentially numbered from ○ to (M-1), and the pixel level changes from white to black or from black to white. It is conceivable to represent the image content using the pixel number (pixel address) at the time of the change (expressing the change point address).

The inventor of the present invention discloses the graphic processing device according to the above method in Japanese Patent Application Laid-open No. 58-142467 and
A novel graphic processing device disclosed in Japanese Patent No. 142468 was invented.

According to these inventions, the processing time can be shortened by reducing the amount of image data to be processed, and when measuring the area of a black area, circumscribed rectangle, etc. using a general-purpose computer, a simple algorithm can be used to It has the advantage of being relatively fast and can be calculated simultaneously with only one scan.

However, calculation of area, circumscribed rectangle, etc. is often performed as one step of image recognition processing, and when viewed as a whole image recognition process, calculations are performed not only for black areas as characters and figures, but also for white areas as backgrounds. Calculations such as area and circumscribed rectangle must also be performed. Since the above invention calculates the area, circumscribed rectangle, etc. only for the black area, if you want to calculate the area, circumscribed rectangle, etc. for the black area and the white area,
After performing graphic processing on the black area by performing one scan, processing is performed to invert the white area and black area, and then the white area (inverted) is performed by scanning the inverted data once. It is necessary to perform graphical processing on the subsequent black area).

That is, if it is attempted to perform graphic processing on white areas and black areas, the number of scans will increase, resulting in an inconvenience that the overall processing time will become longer.

Purpose> This invention was made in view of the above problems,
It is an object of the present invention to provide a graphic processing device that can perform graphic processing for both black and white areas by scanning only once using a simple algorithm.

<Structure> In order to achieve the above objects, the graphic processing device of the present invention includes a determination means, a memory table, and a calculation means, and the determination means determines the change point of both adjacent scanning lines. The address values are compared in the four sequential order, and according to the comparison results, separation is determined into a plurality of predetermined connected pixel patterns, and the scan start part and scan end part are also divided into a plurality of predetermined connected pixel patterns. The storage table stores the run status for each of white data and black data based on the above determination results, and the calculation means determines the change in scanning line according to the determination results in L. It performs arithmetic processing on the point address data and the contents of the storage table.

Therefore, the determining means separates and determines the entire range of scanning lines obtained by one scan into pixel connected patterns, and stores the run state for each white data and black data in a storage table based on the determination result, The arithmetic means performs necessary arithmetic processing, thereby making it possible to perform graphical processing.

The calculation means may be one that calculates the area of the connected pixel area, or may be one that calculates the coordinate values of a circumscribed rectangle that circumscribes the connected pixel area.

<Example> DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, the present invention will be described in detail with reference to the accompanying drawings without referring to embodiments.

First, image data is processed in units of scanning lines and in the order of scanning line numbers. That is, image data A to be scanned and input is shown as shown in FIG. 2, assuming that the number of change points is ■, and each of these change point address data a(Il) [+1=
1.2.PI takes pixel address values between 0 and M, and is arranged in ascending order (a(1))<a(El+1)). Note that, due to the necessity of internal processing, the change point address data of scanning line A is changed to WJ +7), HXI (>H), +422 (>HXf) (7
) 2 data are added.

Furthermore, in order to know the connected region of pixels spanning adjacent scanning lines, image data B of the scanning line immediately before the scanning line A currently being processed is required.

If the number of change points in this case is J, then each change point address data is b(q) [q=1.2, as shown in FIG.
. . Q], and HXI and HX2 are added to the end of the data string as in the case of the scanning line Δ.

FIG. 1 is a block diagram showing a graphic processing device, in which image 19 data A that is iqed by an operation is compared in ascending order of change point address values of both adjacent scanning lines, and is predetermined according to the comparison result. The voltage is applied to the determining means (1) which determines separation into a plurality of predetermined connected pixel patterns, and further separates and determines the scanning start part and the scanning end part into a plurality of predetermined connected pixel patterns. The output signal is applied to a memory table (21) that stores the run state based on the above judgment result for each white data and black data.
In response to the output signal of the determination means (1), the change point address data of the scanning line and the data stored in the storage table (2) are applied to the calculation means (3).

Next, the graphic processing operation will be explained in detail with reference to FIGS. 4 to 7.

The flowchart in FIG. 4 explains the overall operation of graphic processing. In step (2), plq is initialized to 1, the first run is processed in step (2), and whether or not it is a black area is determined in step (2). Determine whether

If it is not a black area, it is determined in step 2 whether it is the end of the record, that is, whether ptq≧tN-2, and if it is the end of the record, the last run is processed in step 2. . If it is not the end of the record, TI and T2 are determined in step ■■.

Here, if it is determined that it is T1, the process of 81 is performed in step ■, the process of W4 is performed in step ■, p is increased by 2 in step [phase], and the determination and processing in step ■ and below are performed again. Do the following. Also, T
If it is determined that it is 2, the process of 82 is performed in step ■, the process of W5 is performed in step ■,
In step [phase], q is increased by 2, and the determination and processing from step ① is performed again. Also, even at T1, T2
If it is determined that this is not the case, the process of 83 is performed in step ■, the process of W6 is performed in step ■,
In step [phase], p and Q are increased by 1, and then step @ is determined.

On the other hand, if it is determined in step (2) that it is a black area, it is determined in step (2) whether or not it is the end of the record, and if it is the end of the record, the last run is processed in step (2). If it is not the end of the record, T3 and T4 are determined in step (2) [phase]. Here, if it is determined that it is T3, the process of 84 is performed in step ②, the process of Wl is performed in step 0, and p is 2 in step [phase].
, and the determination and processing from step O onwards is performed again. Further, if it is determined that it is T4, the process of 85 is performed in step
Then, in step (2), q is increased by 2, and the determination and processing in step @ and subsequent steps are performed again. Also,
If neither T3 nor T4, 8 in step O.
Step 6 is performed, W3 is performed in step [phase], p and q are increased by 1 in step O, and the determination and processing in step 2 and subsequent steps are performed again.

Figure M5 shows a flowchart for processing the first run of step (2), in which it is determined whether a(1) is "'0" or not.

Then, if a(1) is '0'', it is determined whether b(1) is 11011 in step (2), and II
If it is O11, the process of 83 is performed in step (2), and the process returns to step (2), where Q is increased by 1.

Furthermore, if b(1) is not °O', the magnitude relationship between a(2) and b(1) is determined in step ■, and a(2)
If ≧b(1), perform the process of W2B5 in step ■, perform the process of 83 in step ■,
Go to step 3 and increase Q by 1. if,
If a(2)<b(1), then 8 in step ■
1, and in step (2), W3B8 is processed, and in step (2), p is increased by 2.

On the other hand, if a(1) is not 0'°, it is determined whether b(1) is 011 or not in step @, and if it is not 0', the process of W3C8 is performed in step [phase]. If b(1) is "0"', then in step 2, the magnitude relationship between a(1) and b(2) is determined, and a(1)>
If it is b(2), the process of 82 is performed in step (2), the process of W3AS is performed in step [phase], and q is increased by 2 in step O. If, a
If (1)≦b(2), W in step [phase]
I AS processing and B3 in step [phase]
, and increment plq by 1 in step [phase].

In the above case, after performing the processing in step ■■ [phase], the determination and processing in and after step O in the flowchart of FIG.
After performing the processing, the following determinations and processing are performed in step (2) of the flowchart of FIG.

Note that the flowchart in FIG. 5 above corresponds to the case of 8 connections, but the determination in step
>b(1) or a(2)≦b(1), and the determination in step ■ is made based on whether a(1)≧b(2).
) or a(1)<b(2), it is possible to correspond to the case of 4-connection.

FIG. 6 shows a flowchart for processing the last run of step ■■ in FIG.
It is determined whether a(p)=M and b(q)=M. If a(p)=M, step ■
At step WlAE and B6 are processed. Further, if a(p)-M and b(q)=M, then in step 2, processing of W2BE1 and B6 is performed. If a(p) = M and b(a
)=M, the process of 86 is performed in step (2).

In the above case, after performing the processing in step ■■■, the determination and processing in the flowchart of FIG. 4 are completed.

FIG. 7 shows a flowchart for processing the last run of step [phase] in FIG. If not, a(1
))=M, and b(Q)=M. If a(1))=M, the processing of 82 and W6AE is performed in step (2). Also, b(
Q)=M, and if it is not a(p)-M, then in step (2), the processing of 81 and W68E is performed.

If a(p)=M and b(Q)=M, the process of W60E is performed in step (2). Furthermore, even if it is determined in step (2) that the number of remaining data is 0'', the process in step (2) is performed.

In the above case, after performing the processing in step ■■■, the determination and processing in the flowchart of FIG. 4 are completed.

However, when the connected pixel states W1 to W6 and 81 to B6 are represented by the original white and black binary signals, they are as shown in FIG. That is, B1 indicates a state in which there is one black run only in A, B2 indicates a state in which there is one black run only in B, B3 indicates a state in which a connected black run is detected in A and B, 84 to B6 indicate states in which the black and white states of 1 to B3 are reversed,
W1 to W3 indicate the same states as 84 to B6, respectively, and W4 to W6 indicate the same states as 81 to B3, respectively. As is clear from FIG. 8, 81 to B3. W
4 to W6 states are Wl and W2 as the previous states of both scanning lines.
．． Must be 83, 84-86. W1~W
3 state requires that the previous state be W3, 81.82.

Also, the connected pixel state W3C8 of the first run; B1 and W3BS, B2 and W3ΔS, WIAS and B3,
When W2B5, B3, and B3 are represented by the original white and black 2fii signals, it is as shown in FIG.

That is, W3C8 indicates a state in which there is a white run connected by A and 8, B1 and W3BS indicate a state in which there is one black run in A, and B2 and W3AS indicate a state in which only B has one black run. WIAS and B3 indicate a state in which only A has one white run, W2B5 and B3 indicate a state in which only B has one white run, and B3 has a black run connected to A and B. Indicates the condition.

Also, the connected pixel states of the last run W6CE, B1 and W6BE, 82 and W6AE, WlAE and B6,
When W2BE, B6, and B6 are represented in the original white and black binary Shintan, it is as shown in FIG.

That is, W60E indicates a state in which there is a white run connected at A and B, B1 and W6BE indicate a state in which there is one black run only in A, and B2 and W6AE indicate a state in which there is one black run in B.
WIAE and B6 indicate a state in which only A has one white run, W2BE and B6 indicate a state in which only B has one white run, and B6 indicates a state in which there is a black run connected by A and B. indicates a certain state.

In relation to the determination of connected areas, although it is not strictly accurate, conceptually B1 indicates that a new black connected area has been detected, and B2 indicates that the black connected area has disappeared. , B3 indicates that the black connected area continues,
B4 indicates that the black connected region is splitting, B5 indicates that two black connected regions are connected, and W1 to W6
indicates the state corresponding to 81 to B6 above for the white connected area.

Further, the necessary and sufficient conditions for the above separation determination are as shown in FIG. There are 4 connections and 8 connections as connection conditions, but the necessary and sufficient conditions are different accordingly. Then, step ■■[ of the flowchart in Figure 4
Phase] [Phase] discrimination conditions T1 to T4 are set equal to the necessary and sufficient conditions for B1 and W4, B2 and W5, B4 and Wl, and 85 and W2, respectively.

By the way, in order to calculate the area of a connected pixel area, it is necessary to have a table that stores the intermediate results up to the scanning line being processed, and its structure is as shown in Figure 12, and each area is It corresponds to each connected area. And C0NT is for control 1 to roll, and (r
es)=1 means that the operation of the connected region is completed and 'rfJ
This indicates that the product has been determined, and (ACT)=1 indicates that the area has been assigned to a connected region and the area is being calculated. Further, S is for calculating the calculation output, that is, the area.

Further, FIG. 13 is a diagram showing processing for calculating the area, and by performing the illustrated processing for states 81 to B6, the area of the black connected region can be calculated, and the area of the black connected region can be calculated.
By performing the illustrated processing on fW1 to fW6, the area of the black connected region can be calculated.

On the other hand, by changing the configuration of the table in FIG. 12 and the processing in FIG. 13 as shown in FIGS. 14 and 15, respectively, it is possible to calculate the circumscribed rectangle (address coordinate points) of the connected area. can.

Effects> As described above, the present invention enables reading by one scan,
Based on the binarized pixel data, the first white run part,
The area of the white connected area, the black connected area, the circumscribed rectangle, etc. can be calculated using a simple algorithm that also takes into account the final white run part, so the processing FR
This has the unique effect of significantly shortening the time required.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing a graphic processing device, FIGS. 2 and 3 are data explanatory diagrams showing image data of each scanning line expressed by changing point addresses, and FIGS. 4 to 7 are diagrams showing graphic processing operations. FIGS. 8 to 10 are pattern diagrams showing connected pixel states. FIG. 11 is an explanatory diagram showing necessary and sufficient conditions for determining connected pixel states. FIG. 12 is a memory for calculating area. Figure 13 is an explanatory diagram showing the processing operation for calculating the area; Figure 14 is a diagram showing the configuration of the storage table for calculating the circumscribed rectangle; Figure 15 is the circumscribed rectangle. FIG. 7 is an explanatory diagram showing a processing operation for calculation.

Claims (1)

[Claims] 1. Change the scanned input binary image data. Convert to change point address information, and check the change point Two using address values (pixel coordinate values) A figure that performs logical operations on the corresponding pixels of the scanning line. In the processing device, both adjacent scans are performed. Compare line change point address values in ascending order and make predictions based on the comparison results. multiple connected pixel patterns. Separation is determined, and the scanning start part and The scanning end portion is also set to a predetermined number of times. Judgment to separate into connected pixel patterns The above for each means, white data, and black data. A record that stores the run status based on the judgment result. Run according to the memory table and the above judgment result. The change point address data of the scanning line, and the upper An operation that processes the contents of the memory table. A diagram characterized in that it comprises a calculation means. Shape processing device. 2. The calculation means calculates the area of the connected pixel area. Claim No. The graphic processing device according to item 1. 3. The calculation means circumscribes the connected pixel area It calculates the coordinate values of a circumscribed rectangle. The figure according to claim 1 above Processing equipment.