JPS60163164A - Smear-out device of picture - Google Patents

Abstract

PURPOSE:To complete smear out of a picture with one main scanning by tracing respectively a closed polygonal shape picture clockwise and counter-clockwise, generating an initial point group of smear out and inputting/outputting the point group while referencing a profile line. CONSTITUTION:A profile line generating means 215 traces an apex of a closed polygonal picture representing the content of a polygonal storage means 200 and writes a value 1 to a picture element to which a line segment deciced by two apexes among picture elements of a profile line storage means 245. Then a forward inner line generating means 205 and a reverse inner line generating means 210 trace respectively an apex of the closed polygonal picture to calculate a vector of each side, traces forward or reverse a vector group, finds out a vector whose y-axis component is negative and writes a value 1 to the picture element. A summing point group generating means 230 writes a value 1 to a region storage means 235 when any of picture elements is 1. A condition transfer means 240 traces picture elements in the x direction, references the content of the profile line storage means 245 to decide the content of the region storage means 235.

Description

DETAILED DESCRIPTION OF THE INVENTION (Technical Field) The present invention relates to an image filling device, particularly when generating a digital image from a figure expressed in a digital image in which all pixels surrounded by the figure are colored with the same color. This invention relates to a necessary digital image filling device.

(Prior art) For example, the conventional method of generating a digital image from a given figure in which the pixels surrounded by the figure are colored with the same color is
When applied to obtain the filled figure shown in figure 2 in figure (b) from figure 1 shown in figure (a), first, as a first step, the seed pixel 50 illustrated in figure 2 (a) is extracted from the figure. For example, the raster 100 is given color and colored, and as a second step, starting from the pixel 50, the raster 100 is main scanned in the X-axis direction to trace the pixels, not the pixels through which the outline of the figure passes.

In addition, if any of the pixels adjacent to the top, bottom, left, or right are colored, the pixel of interest is colored, and the result shown in FIG. The above processing is performed by main scanning in the negative X-axis direction, and the results shown in FIG. A digital image of the filling result of dl was obtained by sub-scanning the image in Fig. 2 (dl).

However, such an image filling method has the drawback of requiring multiple scans.

(Object of the Invention) An object of the present invention is to provide an image-filling koji-making process that completes filling of an image in one main scan.

(Structure of the Invention) According to the present invention, there is provided a polygon storage means for storing a closed polygon digital image to be filled, and a plurality of sides constituting the closed polygon image represented by the contents of the polygon storage means. a forward extension generation means for generating an initial point group for filling in the surroundings; a forward extension storage means for storing a school of fish generated by the forward extension generation means; and a closed polygon represented by the contents of the polygon storage means. a backward extension generation means for tracing a plurality of sides constituting an image counterclockwise and generating an initial point group for filling; a backward extension storage means for storing a school of fish generated by the reverse extension generation means; a contour generating means for generating a contour of a closed polygon image represented by the contents of the polygon storing means; a contour storing means for storing the contour generated by the contour generating means as a school of fish; and the forward extension line storing. advantageous group generation means for calculating a fish school that is the union of the fish school represented by the contents of the means and the fish school represented by the contents of the backward extension storage means; and area storage means for storing the fish school generated by the advantageous group generation means; There is obtained an image filling device characterized in that it includes φ transfer means for inputting and outputting the contents of the area storage means while referring to the school of fish represented by the contents of the contour storage means.

(@condolence/Ihara1!l) The principle of the present invention will be explained below with reference to the drawings.

Taking the figure 300 shown in FIG. 3(a) as an example, the principle of the present invention is to clear all pixels in the digital image in advance, and then clear the inside of the figure 300 and the outline of the figure. Figure 3 (The pixel group shown with diagonal lines in Figure 3 (C) adjacent to the pixels shown in bl in the X-axis direction is colored as a seed, and the screen is finally scanned in the X-axis direction and sub-scanned in the y-axis direction. If the contour line does not pass through the pixel of interest, the value of the pixel of interest is assigned to the pixel adjacent to the pixel of interest in the X-axis direction; if the contour line does not pass through the pixel of interest, In this case, the image is filled in by scanning without doing anything.

In order to explain the processing according to the above principle in the two-star 310 in FIG. 3(C), the raster 310 is shown in FIG. 3(d).
It is taken out and shown. Raster 310 shown in FIG. 3(d)
, before scanning, pixel 322 and pixel 326
Only pixel 329 is colored, and all other pixels are cleared. The scan begins by examining pixel 320. In this case, since the contour line does not pass through pixel 320,
Processing is performed to assign the cleared value of pixel 320 to pixel 321.

The scan proceeds to pixel 321. At the pixel 321, since the outline passes through the pixel 321, the process of assigning the cleared value of the pixel 321 to the pixel 322 is not performed, and the continuous scanning in which the pixel 322, which is the seed, is colored advances to the pixel 322. At pixel 322, since the contour line does not pass through this pixel 322, the colored value of pixel 322 is transferred to pixel 323.
The pixel 323 is colored and the scanning proceeds, and the pixel 324 and the pixel 32 are colored by the same process as the above process.
5 is also colored and scanning proceeds to pixel 325.

At pixel 325, since the outline passes through pixel 325, the process of assigning the colored value of pixel 325 to pixel 326 is not performed. However, since the pixel 326 is a seed, its color is maintained in advance.

The scan then advances to pixel 326. Since the contour line does not pass through the pixel 326, the colored value of the pixel 326 is transferred to the pixel 32.
7 is performed, and similar processing is performed for pixel 327.
However, one pixel 327 and one pixel 328 are colored, and scanning proceeds to pixel 328. At pixel 328, the same processing as at pixel 325 is performed, and the scan continues to pixel 329.

At pixel 329, since the contour line does not pass through pixel 329, processing is performed to assign the colored value of pixel 329 to pixel 330, pixel 330 is colored, and scanning proceeds.
The pixels from pixel 330 to pixel 331 are colored by the same process as the above process, and scanning proceeds to pixel 331. Since the contour line passes through the pixel 331 at the pixel 331, the pixel 331
The process of assigning a colored value of 1 to pixel 332 is not performed, and the process for raster 310 is thus completed.

Perform the above process for all rasters.
A digital image shown in FIG. 3(e) in which pixels surrounded by 0 are colored in the same color can be generated.

Now, in order to carry out the principle of the present invention, in advance, as shown in FIG.
Since it is necessary to select and color the seed pixels indicated by diagonal lines in 1, the method for doing so will be described below.

First, consider the vector shown in FIG. 4(a) in which the sides of the figure 300 shown in FIG. The pixel serving as the seed shown in FIG.
E6 + "8 + E□□ is adjacent to the pixel through which it passes in the X-axis direction and is included inside the figure 300. Therefore, first, the sides E1 r E3 + E6 r E
The diagonally shaded pixels in FIG. 4(b), through which the line segment obtained by translating 8+Elf by one pixel in the X-axis direction passes, are selected as seed pixel candidates, and then the inappropriate pixels 410, 420° 4
Perform processing to remove 30.440.

The inappropriate pixels occur where a side having a negative y-axis direction component and a side having a positive y-axis direction component are joined in a convex manner.

For example, after confirming that the sides B12 and E2, which have positive y-axis direction components, are convexly connected to the side E1, whose y-axis direction components are negative, at vertices Vl and V2, pixel 410 and pixel 440 , the pixel indicated by the symbol ○ in Figure 4 (C), through which the line segment passing by which the side E2 is translated by one pixel in the X-axis direction, and the side E2 is translated by one pixel in the X-axis direction. It is possible to detect and remove the pixel that is the union of the pixels shown by the symbol * in FIG. 4 (C1) through which the line segment passed through, and the pixel shown by diagonal lines in FIG.

However, when the above processing is performed, pixels 450 and 460, which should be left as seeds, are also removed.

In order to avoid this, first, a pixel whose y-axis direction component is negative and which is passed by a line segment translated by one pixel in the x-axis direction on a certain side E17k is selected as a candidate pixel as a seed pixel, and then the method described above is performed. Remove the inappropriate pixels 440 and 410 detected from the candidates at this point, and then remove the pixel through which the line segment that is translated by one pixel in the x-axis direction on side E3f whose y-axis direction component is negative is added to the new seed pixel candidates, and then the presence of inappropriate pixels is checked using the method described above. In this case, the side E2 has a positive y-axis direction component, but at the vertex ■3, the side E2 joins the side IC3 in a concave manner, and the side E4
Since the y-axis direction component is zero and not positive, there are no inappropriate pixels. Therefore, at this point, pixel 450 remains as a candidate pixel to become a seed.

The above processing is performed as side 1 to 1 r E3 + be r E'
By tracing 8 r El□ and the side where the y-axis direction component is negative in a clockwise direction, it is possible to find the seed pixel shown by diagonal lines in FIG. 3(C). However, if the process of inserting the seed pixels starts clockwise from side E6, pixel 450 will remain as a seed, but the process on side E1 will remove pixel 440 as shown in FIG. 4(d). In this case, pixel 460, which is necessary as a seed, is removed. Therefore, the above process is performed counterclockwise from side E6 to E, , E3 . Ishi1. If steps E0□ and E8 are performed, the pixel 460 remains as a seed, but in the processing on side E□, which removes the pixel 410 shown in FIG. 4(e), the pixel 450 necessary as a seed is removed. Focusing on this, if we set the seed pixel obtained through the clockwise processing and the seed pixel obtained through the counterclockwise processing as a new seed pixel, then from which side should we start processing? For example, the shape 30 shown in FIG.
The case where the area surrounded by 0 is filled will be explained as an example. In the figure 300 used as an example in the present invention, the vertices of the figure are ordered clockwise when viewed from the negative two axis directions, and the coordinate values are position vectors whose components are 1. ■2. ...+■13 (however, Vl3-Vl) (1) and the number of vertices N (-12
) and stored as the contents of the polygon storage means 200. FIG. 6 is a conceptual diagram representing the contents of the polygon storage means 200 on memory.

On the other hand, the forward extension storage means 220, the backward extension storage means 225, the area storage means 235, and the contour storage means 245
are image memories representing the same screen.

The above screen is divided into rasters in the y-axis direction as shown in FIG. Additionally, the display means 250 can be implemented using conventional display technology.

The process begins when the control means 255, which is constituted by, for example, a conbeater, activates the contour line generation means 215.

The activated contour generating means 215 first writes the value O to all pixels of the image memory constituting the contour storing means 245, and then writes the number 12 of vertices stored at the beginning of the contents of the polygon storing means 200. Gain C1 polygon storage means 200
After knowing the number of vertices of the closed polygon image represented by the contents of
The vertices are traced one by one from the first vertex vI to the 12th vertex V1□, and the current vertex and the line defined by the two vertices of the pixels represented by the contents of the contour storage means 245 are extracted. Write the value 1 to all pixels of C where the minute passes.

When the contour generation means 215 completes the processing, the control means 2
55 activates the forward extension generation means 205. The activated forward extension generation means 205 first writes the value O to all pixels of the image memory constituting the forward extension storage means 2201, and then writes the number of vertices 12 stored at the beginning of the contents of the polygon storage means 200. and the polygon storage means 200
After knowing the number of vertices of the closed polygon image represented by the contents of
Trace the vertices one by one from the 1st vertex to the 12th vertex, and use the current vertex as the starting point and the following vertex as the ending point. El = ■, v2 + E2 = ■2 ■3 + "'
+ E12=■12■13 (=■12"i), and furthermore, when i is an integer from 2 to 13, for any 1, side El-1, side E, +□ exist, Moreover, the above i
In order to be able to specify all the sides, Ex3=E'x・E14=E2 f3) is stored in the memory of the forward extension generation means 205 as a set E of the value of the X-axis direction component and the value of the y-axis direction component. ,=(t,+ul)+
'=1+2+-, 14(4), and the structure shown in FIG. 8 is maintained.

Finally, the forward extension generation means 205 converts the vector group E1+E2+..., El4 generated above from E2 to ElB.
Find a vector E whose y-axis direction component is negative. Whenever the above vector E is found, first use the subscript I, /? , and the vertex vK with K and / as subscripts.

■ Take the coordinate values of 1 from the contents of the polygon storage means 200, and obtain the coordinate values of vertex ■, as (X blue, y%) (6) The coordinate values of vertex ■, as (Xl, Yl) (7) Then, among the pixels represented by the contents of the forward extension storage means 220, (XK+1 + YK) + (xz+t + Yi
) (8) Write the value 1 to all pixels through which the line segment defined by two points passes, then δC""1x"l 1 t, -0xu1 (9) δ
. If the result is negative and U, -4 is positive, use the subscript i, put l, and the vertex with K and l as subscripts.

■ The coordinate value of j is fetched from the contents of the polygon storage means 200, and values are assigned to all pixels through which the line segment defined by the two points indicated by the formula (8) above passes among the pixels represented by the contents of the forward extension storage means 220. Write 0 and then δcc”t++xxu
t tlXul+1 (11) If δCC is calculated and the result is negative and uI+ is positive, the subscript i is used to form the vertex with l as the subscript.

The coordinate value of vl is fetched from the contents of the polygon storage means 200, and the value 0 is assigned to all pixels through which the line segment defined by the two points shown by the above formula (8) passes among the pixels represented by the contents of the forward extension storage means 220. Performs the process of writing.

When the forward extension generation means 205 completes the processing, the control means 255 activates the backward extension generation means 210. The activated backward extension generation means 210 first sets the value O to all pixels of the image memory constituting the backward extension storage means 225.
Then, the number of vertices stored at the beginning of the contents of the polygon storage means 200, 12, is obtained, and the number of vertices stored at the beginning of the contents of the polygon storage means 200 is obtained.
After knowing the number of vertices of the closed polygon image represented by the content of 0, trace the vertices one by one from the 1st vertex to the 12th vertex, as shown in the above equations (2), (3), and (41). The vector E quantity (i=1.2..., 14) is calculated, and these vectors are stored in the memory of the backward extension generation means 210 in the form of expressions (4).

Finally, the backward extension generation means 210 converts the vector group EitE2+..., E14 generated above from E13 to E2.
Find a vector E whose y-axis direction component is negative. If the above vector E is found,
Each time, first using the subscript i, as shown in the above formula (5), /
, the coordinate value of the vertex vK with K and l as subscripts, (1) is fetched from the contents of the polygon storage means 200, and among the pixels represented by the contents of the backward extension storage means 225, 2 shown by the above formula (8) is obtained. Write the value 1 to all pixels through which the line segment defined by the point passes, and then calculate δ using the equation (9) above. is calculated, and if the result is negative and ul-1 is positive, the subscript i is used to calculate the vertex V with K and l as subscripts, as shown by the above equation (10).
The coordinate values of K and V are fetched from the contents of the polygon storage means 200, and among the pixels represented by the contents of the backward extension storage means 225, all the pixels through which the line segment defined by the two points shown by the above formula (8) pass. Write the value O into , and further write the above formula (ii)
Calculate δCC with A process of fetching a value from the contents of the polygon storage means 200 and writing the value O to all pixels through which the line segment determined by the two points shown by the above formula (8) passes among the pixels represented by the contents of the backward extension storage means 225. Do the following.

Forward extension generation means 205 and backward extension generation means 210
When the processing is completed, the control means 255 starts the advantage group generation means 230. The advantage group generation means 230 generates, for each pixel constituting the screen, at least one of a pixel represented by the contents of the forward extension storage means 220 and a pixel represented by the contents of the backward extension storage means 225 located at the same position as the above pixel. If the value of one pixel is 1, write the value 1 to the pixel represented by the contents of the area storage means 235 located at the same position as the above pixel, and write the value 1 to the pixel represented by the contents of the forward extension storage means 220 and the opposite pixel located at the same position as the above pixel. If any of the pixels represented by the contents of the direction extension storage means 225 have the value 0, the value 0 is written to the pixels represented by the contents of the area storage means 235 located at the same position as the above pixels.

When the Oro fish school generation means 230 and the contour line generation means 215 complete their processing, the control means 255 activates the condition transfer means 240. The condition transfer means 240 transfers the pixel k constituting the screen.
Divide into rasters in the y-axis direction, scan each raster in the If the pixel represented by the contents of the contour storage means 245 has a value of 0, the area storage means 23 scans the value of the pixel represented by the contents of the area storage means 235 next to the pixel.
Processing is performed to write the value of the pixel represented by the contents of 5.

When the condition transfer means 240 completes the processing, the control means 25
5 activates the display means 250. The display means 250 takes in a value for each pixel represented by the contents of the area storage means 235, and if the value is 1, the position on the screen where the said pixel is located is painted, and if the value is 0, the position of the said pixel is painted. As a result, the above figure 3
00, it is possible to generate and display a digital image in which the area surrounded by the above figure is colored in the same color.

In the description of this embodiment, the processing of the contour line generation means 215, the processing of the forward extension generation means 205, and the processing of the backward extension generation means 2 will be described.
Although the 10 processes have been described as sequential processes, they can essentially operate in parallel.

Further, the advantage column generating means 230 is capable of parallel operation on a pixel basis, and furthermore, the condition transfer means 240 is also capable of parallel operation on a raster basis.

Regarding scanning of the screen, in the above description, the main scanning direction was limited to the X-axis direction, but when the main scanning is set to the negative X-axis direction, the forward extension generation means and the reverse extension generation means perform the above-mentioned type of scanning. In the generation of pixels, find the side EI whose y-axis direction component is positive among the vectors representing the side, and calculate the side E,
Each time the side E is found, the pixel through which the line segment passes by one pixel in the negative X-axis direction is added to the seed pixel candidates. If exists, the pixels passed by the line segment obtained by parallelly moving the side E by one pixel in the negative In the generation of seed pixels performed by the extension line generation means and the reverse direction extension generation means, a line segment that is translated in parallel by one pixel in the y-axis direction of the side whose X-axis direction component is positive among the vectors representing the side passes through. After adding the pixel to the seed pixel candidates, if the X-axis direction component is negative at both end points of the side E, then the side E is translated by one pixel in the y-axis direction. The process of removing pixels through which the line segment passes from the candidates, and when the main scanning is in the negative y-axis direction, the edges are illuminated in the generation of seed pixels performed by the forward extension generation means and the reverse extension generation means. Find the side E whose X-axis direction component is negative in the vector, and every time the above side E is found, find the pixel through which the line segment passing by parallelly moving the side E by one pixel in the negative y-axis direction. After adding the seed pixel candidates, the above edge E.

The X-axis direction component is positive at both end points, and the side E.

If there is a side E that joins convexly to E, the same result can be obtained by removing from the above candidates the pixels through which the line segment, which is obtained by translating the side E by one pixel in the negative y-axis direction, passes through. You can return the effect.

(Effects of the Invention) The present invention has the advantage that filling of an image can be completed with one main scan.

[Brief explanation of the drawing]

Figures 1 (a) and (b) are illustrations of filling in images;
Figures (a) to (d) are explanatory diagrams of the prior art, and Figures 3 (a) to
(e), FIGS. 4(a) to (el is a detailed explanatory diagram of the present invention, FIG. 5 is a block diagram showing an embodiment of the present invention, and FIG. 6 is an explanatory diagram of the contents of the polygon storage means. , FIG. 7 is an explanatory diagram of the screen, and FIG. 8 is a schematic diagram of a method for storing vectors indicating sides. 200...Polygon storage means, 205...
・Forward extension generation means, 210...Reverse extension generation means, 215...Contour line generation means, 220
... Forward extension storage means, 225 ... Reverse extension storage means, 230 ... Oro fish school generation means, 235 ... Area storage means, 240 ...・・・
...Condition transfer means, 245... Contour storage means. 250... Display means, 255... Control means.

Claims (1)

[Claims] A polygon storage means for storing a closed polygon digital image to be filled, and a plurality of sides constituting the closed polygon image represented by the contents of the polygon storage means are traced clockwise to generate an initial point group for filling. Forward extension generation means;
a forward extension storage means for storing a school of fish generated by the forward extension generation means, and an initial point for tracing counterclockwise a plurality of sides constituting a closed polygon image represented by the contents of the polygon storage means; Reverse extension generation means for generating schools; Reverse extension storage means for storing schools of fish generated by the reverse extension generation means; and generation of outlines of closed polygon images represented by the contents of the polygon storage means. a contour line generation means, a contour line storage means for storing the contour lines generated by the contour line generation means as a school of fish, a school of fish represented by the contents of the forward extension storage means, and a school of fish represented by the contents of the backward extension storage means. an advantage group generation means for calculating a school of fish that is the sum of the above, an area storage means for storing the fish school generated by the advantage group generation means, and an area storage means for storing the fish school represented by the contents of the outline storage means. An image filling device characterized by comprising a condition transfer means for inputting and outputting the contents of the means.