JPS62264380A - Picture processor - Google Patents

Abstract

PURPOSE:To detect a prescribed picture element position such as a border line in a short time by dissolving and storing a picture for respective reference colors, executing the logical operation respectively after the storage data are divided into two groups based on the designating color and deciding the presence/absence of the designating color. CONSTITUTION:A memory means 1 dissolves and stores a two-dimensional picture for respective reference colors. The storage data of the memory means 1 are inputted to a classifying means 2 and divided into two groups based on the designating color to be retrieved. To the respective storage data classified by a classifying means 2, the prescribed logical operation is executed by the first and second logical means 3 and 4, the output of these logical means 3 and 4 is inputted to a deciding means 5 and the presence/absence of the designating color are decided.

Description

DETAILED DESCRIPTION OF THE INVENTION [Object of the Invention] (Industrial Application Field) The present invention relates to an image processing apparatus, and particularly to an image processing apparatus that detects predetermined pixel positions such as boundary lines.

(Prior Art) Generally, in an image processing device, each pixel data forming a two-dimensional image is stored in a memory, and necessary processing is performed on the data. In this case, processing to detect the position of a pixel with a certain specific color is often required. For example, if a figure with a certain closed area is defined in memory and image processing is performed to fill the inside of this closed area, the coordinate values of the boundary lines must be determined.

For example, red, green, and blue (hereinafter referred to as R and G, respectively).

3 memories MR for the three reference colors (abbreviated as B),
It is assumed that MG and M are provided, and a triangle with a purple border is defined in this memory as shown in FIG. In order to perform image processing that fills the inside of this triangle, it is necessary to find the coordinate values of this boundary line.

In the conventional device, this work is performed as follows. l] Each pixel is searched from a predetermined point A in the direction shown by the arrow in FIG. 4, and a purple pixel B is found.

A flowchart of this procedure is not shown in FIG. First, each memory MR0
Data DI, Di, and DlB for a predetermined n pits including point A are read from each of MG0MB. Normally, the number of bits corresponding to one word is taken as this RG bit an, and in the end, one word of data is read out (step S1). Next, this data DIR, D1G
, D19, a search for purple pixels is performed (step 82). If there is no purple pixel, then the next one word worth of data D2R.

D2G, D2. is read and the same process is repeated (steps 83, 84, 81). If there is a purple pixel (in this example, R
G), which bit in the word data corresponds to the purple pixel is detected by shifting the data one bit at a time (step 85).

In this way, the coordinates of eight points can be detected. In the same way, the coordinates of all boundaries of this triangle are determined.

(Problems to be Solved by the Invention) In the conventional image processing apparatus, all the operations shown in FIG. 5 are processed by software, which causes a problem that the processing time becomes long. In other words, since the CPU reads data one word at a time based on a predetermined program and performs predetermined arithmetic processing, the number of steps that the CPU must execute becomes large, and the final boundary coordinates are determined. It takes a considerable amount of time to do so. Since the image II process allows the object to be visually grasped, it is desired to shorten the processing time as much as possible.

Therefore, an object of the present invention is to provide an image processing bag δ that can detect predetermined pixel positions such as boundary lines in as short a time as possible.

[Structure of the invention]

(Means for Solving the Problems) The present invention provides an image processing device in which: a) each pixel forming a two-dimensional image is divided into m colors (m is a natural number);
Separated into standard colors, each y! Record pixel data with semi-monochrome
b) m memory means based on the specified color to be searched;
C) There are two or more memory means belonging to the first group; C) a classification means for classifying into a first group consisting of memory means for reference colors constituting the specified color and a second group consisting of other memory means; and C) there are two or more memory means belonging to the first group. In this case, each predetermined n-bit data (n is a natural number) is extracted from the address position to be searched in each memory means belonging to the first group, and the result is obtained by performing an AND operation between the corresponding bits. If there is only one memory means belonging to the 1uth group, output n-bit data as is from the address position to be searched in this only memory means, and output the data belonging to the 1st group. When there is no memory means, a first logic means that outputs n-bit logic 14111 data, and d) When there are two or more memory means belonging to the second group, each memory means belonging to the second group. n bits of data are extracted from each address position to be searched, performs a logical OR operation between the corresponding bits, and outputs the negative logical data of the result, and only one memory means belongs to the second group. In this case, n-bit logic data of n-bit data is output from the address position to be searched in only one memory means, and if there is no memory means belonging to the second group, n-bit logic " e) performing an AND operation between corresponding bits of the output data of the first logic means and the output data of the second logic means; , and a determination means that determines that a pixel having a specified color exists in the area to be searched if there is a bit that becomes logical ``1'' as a result, and detects a predetermined pixel position such as a boundary line in a short time. It was made so that it could be done.

(Function) Operations that were conventionally processed using software can now be performed using hardware, resulting in an extremely shortened processing time.

(Example) The present invention will be described below based on an illustrated example. Second
The figure is a block diagram showing the basic configuration of an image processing device according to the present invention. In this embodiment, three memories 1 are provided, each corresponding to R, G, and B standard colors. These three memories 1 correspond to MR, M, , M8 in FIG. The classification means 2 selects these three colors based on the specified color to be searched.
The memories 1 are classified into two groups: a first group and a second group. The data in the first group of memories is subjected to a predetermined logical operation, which will be described later, by the first logic means 3, and the data in the second group of memories is subjected to a predetermined logical operation, which will be described later, by the second logic means 4. A predetermined logical operation is performed. The determining means 5 further performs a predetermined logical operation on the results of these two logical operations, and determines the existence of a pixel that corresponds to the designated color.

Now, as in the example of the conventional device described above, we will explain the operation of searching a triangle as shown in FIG. 4 from point A to the right as indicated by the arrow to find point B on the purple boundary line. do. The algorithm itself for this operation is similar to the algorithm shown in the flowchart of FIG. 5, but in the apparatus according to this embodiment, the search operation for the specified color pixel in step S2 is entirely performed by hardware.

First, the memories MR and MG shown in FIG.

Data D1, DiG, and D1BR are read out from M and taken into the classification means 2, respectively. The captured n bits of data are each RO-R(n-1).

They will be expressed as Go-G (n-1) and BO-B (n-1). For example, data D1R is composed of n bits: 1≧O, R1°R2, . . . , R(n-1).

fR3 diagram (a) shows these captured data. In this triangular example, all pixels corresponding to the first captured data D1 are black, so all bits are 0.

Here, the classification means 2 divides the data D1, D1, and D1B into two groups G based on the specified color to be searched. In this example, the specified color to search for is border! Since it is the purple color of the 71i line, it is divided into a first group consisting of the reference colors R and B that make up the purple color, and a second group consisting of the other reference colors G. Therefore, data D1R and 01 are applied to the first logic means 3, and data D1o is applied to the second logic means 4.

The first logical means 3 performs the following logical operation.

(i) If there are two or more sets of given data, output the AND between the corresponding bits of each given data.

(11) If the given data is only one set, output the given data as is.

(iii) If there is no given data, output n-bit logic 111 I+.

Now, let the logic output of this first logic means 3 be X, and if this X is represented by n bits xO~X (n-1), then X1=(R+Ri)-(G+Gi)・(B+B i) ・・・・・・(1
) can represent each bit of X. Here, i is a natural number from O to (n-1), and RoG and B are logics that take logic "1" if each color has the specified color composition, and logic "0" if not. It is a value.

Now, in this example, the first logic means 3 contains data D1 and 01. is given, so the output X is the logical sum of DIR and Dl. That is, since the specified color is purple, 11=
1. G-0,8-1, and formula (1) is Xi-(0+Ri) ・(1+Gi)-(0+Bi)-
Ri-3i...(2). The calculation result of X is shown in the upper part of FIG. 3(b).

On the other hand, the second logical means 4 performs the following logical operation.

(i) When there are two or more sets of given data, outputs the negation of the logical OR between the corresponding bits of each given data.

(ii) If there is only one set of given data, output the negation of the given data.

(iii) If there is no given data, output n-bit logic "1".

Now, if the logic output of this second logic means 4 is Y, and if this Y is expressed by n bits YO~Y(n-1), then the expression of Y is expressed as follows (3) Each bit can be represented.

Now, in this example, since only one set of data D1o is given to the second logic means 3, the output Y becomes the negation of Dlo. That is, by substituting R-1°G-0,8=1 into equation (3), Yi= (0・Ri+i・Qi+Q・Bi)=Q
i ......(4) is obtained.

The middle part of FIG. 3(b) shows the W4 calculation result of Y.

Finally, the determining means 5 takes the logical sum 2 of the output X of the first logic means 3 and the output Y of the second logic means 4, and determines whether this Z is 0 or not, that is, 20~Z(n-1) Logic 1 behind n bits of
41 Determine whether there is even one bit that is I+. If there is even one bit with logic "1", it is determined that a pixel having the specified color exists in the area to be searched.

(!11, Z i =X i −Y i ”=(5) is performed, and it is determined whether Zi is “1” or not. Thus, in this example, the search result for the first word data D1 is Z-0, and it is determined that there is no specified color pixel within this area.

Subsequently, similar search processing is performed for the second word data D2, but in this example, Z=0 as well. z
40 when the search process for the word-th data Dk is performed. As can be seen from FIG. 4, this is because a boundary point B exists within the area of data Dk. FIG. 3(C) shows the data obtained for this Dk for each reference color. DkR and DkB as shown
The 10th bit is 1'', indicating that the purple boundary point B exists at this position.The result of performing the same logical operation as above based on this data Dk is shown in the third As shown in Figure (d), Z key 01, that is, the 10th bit becomes "1", confirming that the specified color pixel exists in this area.

FIG. 1 shows the classification means 2, the first
FIG. 3 is a circuit diagram of an example in which the second logic means 3 and 4 and the determination means 5 are constructed by concrete logic circuits. Here, RO-R(n-1) is n-bit data retrieved from memory MR, GO~G(n-1) is n-bit data retrieved from memory MG, and BO~B(n-1) is memory M
This is n-bit data extracted from B. Also, R,G
.

B is a logical value indicating whether or not each color is configured as a designated color, as described above. This circuit is B ITO~B
It consists of n parts of IT (n-1), but since the configuration of each part is exactly the same, only the BITO part will be explained below.

In BITO, data bits RO, Go.

80 is AND gate 6 (6R, 6G, 6B)
and one input of OR gate 7 (7R, 7G, 7B). The other inputs of these gates are supplied with logically inverted R, G, and B via an inverter 8 (8R, 8G, 8B). Also, AND gate 6
The output of is sent to NOR gate 9, and the output of OR gate 7 is sent to AN
The output of the NOR gate 9 and the output of the AND gate 10 are applied to the AND gate 11. Finally, B ITO-B IT (n
-1), the output of AND gate 11 for all of
It is applied to the R gate 12.

The functions of each gate will be explained below. AND gate 6
, OR gate 7, and inverter 8 function as the classification means 2. That is, the AND gate 6 outputs RO, Go, and BO only when RlG and B are 0'', and the OR gate 7 outputs R,
RO, Go, and BO are output only when G and B are 1''.

Therefore, the output of the OR gate 7 corresponds to the first group of memory data, and the output of the AND gate 6 corresponds to the second group of memory data. Further, the AND gate 10 is connected to the first logic means 3.
, NOR gate 9 functions as the second logic means 4 and outputs X and Y, respectively. It can be easily understood that the output X follows equation (1) and the output Y follows equation (3). On the other hand, AND gate 11 and OR gate 12
functions as the determining means 5. That is, AND gate 1
1 ANDs X and Y according to equation (5) and outputs Z.

In this way B1. TO~BIT (n-1)
zO to Z(n-1) are obtained from the above, and the OR gate 12 takes the logical sum. Therefore, the output J of OR gate 12
U D G E Ha, 2O-Z(n-1) (7) 1 of them
If there is a "1" at any time, it becomes "1" and indicates the existence of a designated color pixel.

If the circuit shown in FIG. 1 is used, the procedures from steps 81 to S3 in FIG. 5 can be performed by hardware as described above. Note that if a designated color pixel exists, the pixel position is detected by bit shifting in step S5, but the procedure of step $5 may also be performed by hardware. This can be easily realized by inputting the outputs ZO to Z (n-1) into a shift register in the circuit shown in FIG. 1, and using this shift register to perform a shift operation.

In a conventional software processing device, several tens of CPU clock cycles are required to perform steps 81 to S3 in FIG. 5, and the calculation time is approximately several tens of microseconds. However, if the circuit shown in Figure 1 is used, the same process can be performed by passing through four stages of logic gates once, and the performance time can be reduced to less than 10n sec, which significantly reduces the performance time. It is possible to shorten the time.

Note that in the above embodiment, R and G are used as reference colors.

Although an example using three colors of B was shown, the present invention uses these three colors.
Of course, the present invention is not limited to the case where colors are used. The present invention can be applied in exactly the same way even when there are four or more reference colors. Further, the specific circuit configuration shown in FIG. 1 is given as an example, and any logic circuit may be used as long as it can realize a similar logic configuration using hardware.

〔Effect of the invention〕

According to the present invention, an image processing device includes a memory means for separating and storing a two-dimensional image for each reference color, and a specified color to be searched for using this stored data! A classification means that divides into two groups based on it, and a predetermined logical driver for each of the classified groups /II! Since the first and second logic stages and the determination means for determining the presence or absence of a specified color based on the outputs of these logic means are provided, detection of predetermined pixel positions such as border lines is shortened. You will be able to do it in time.

[Brief explanation of drawings]

FIG. 1 is a circuit diagram of an embodiment of an image processing apparatus according to the present invention, FIG. 2 is a block diagram showing the basic configuration of an embodiment of an image processing apparatus according to the present invention, and FIG. FIG. 4 is a conceptual diagram of a general method for determining the boundary line position, and FIG. 5 is a flowchart showing the procedure of the general method for determining the boundary line position. 1... Memory means, 2... Classification means, 3... First
Logic means, 4... second logic means, 5... determination means, 6... AND gate, 7... OR gate, 8.
...Inverter, 9...NOR gate, 10...A
ND gate, 11...AND gate, 12...-OR
Gate, 81-S5... Each step of the flowchart.庬 2 喏仑 3 躬 4 fig.

Claims (1)

[Claims] a) Each pixel forming a two-dimensional image is divided into m colors (m is a natural number)
m memory means for separating pixel data into reference colors and storing pixel data for each of the reference colors; b) dividing the m memory means into reference colors constituting the designated color based on the specified color to be searched; A first group consisting of memory means for , and a second group consisting of other memory means.
and c) if there are two or more memory means belonging to the first group, a predetermined number of n from the address position to be searched for each memory means belonging to the first group; Extracting bit data (n is a natural number), performing a logical AND operation between corresponding bits, and outputting the resulting data, and when there is only one memory means belonging to the first group,
Output n-bit data as is from the address position to be searched for in only one memory means, and if there is no memory means belonging to the first group, output n-bit logic "1" data. d) If there are two or more memory means belonging to the second group, n-bit data is obtained from each address position to be searched in each memory means belonging to the second group; is extracted, performs a logical sum operation between corresponding bits, and outputs the resultant negated logic data, and when there is only one memory means belonging to the second group,
Output n-bit logical negation data from the search target address position of only one memory means, and if there is no memory means belonging to the second group, n-bit logic "1" is output. a second logic means for outputting data; e) performing an AND operation between corresponding bits of the output data of the first logic means and the output data of the second logic means; An image processing apparatus comprising: determination means for determining that a pixel having the designated color exists in the search target area if a bit with a resultant logic of "1" exists.