JPS6312309B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a method for regenerating missing parts of images such as characters, and in particular, the present invention relates to a method for regenerating missing parts of images such as characters, and in particular, the present invention relates to a method for regenerating missing parts of images such as characters, etc. Regarding how to reproduce missing parts. The "contour line pattern image" as used in the present invention is a representation of the ordinary calligraphy and drawing shown in FIG.

First, a method for creating a contour line pattern image will be briefly explained. FIG. 2 is a block diagram of a contour line pattern image creation device. Note that in this example, the image is made up of 2048 pixels in the main scanning direction, but it is clear that the present invention is not limited to this. 1 and 2 are A and B, each of which can store all pixels of one (frame) image.
Memory, 3, clock and control signal generator, 4
are flip-flops, 5 and 6 are 2046-bit shift registers, 7 to 9, 51, 52, 61,
62 is a 1-bit shift register, 10 is a 2-bit counter, 11 is an address counter, 1
2 is an address converter.

When the start (START) signal is input, the clock and control signal generator 3 sets the initial (INITIAL) signal to "1" for a period of time to scan all areas of the A and B memories 1 and 2. Since this signal "1" is applied to memories 1 and 2 via OR gates O1 and O2, both memories A and B are in write mode. At the same time, a clock signal is input to the address counter 11 to sequentially designate each address in the A and B memories.

At this time, new data (DATA) is supplied to A memory 1 via AND gate A1, so new read data is stored in A memory. On the other hand, the input of B memory 2 has an initial signal “1”.
Since the signal "0" which is inverted by the inverter I is input, the entire area of the B memory is cleared. Clock and control signal generator 3 also generates a RESET signal to reset all shift registers, flip-flops and counters.

The operation of the apparatus shown in FIG. 2 will now be described assuming that an image as shown in FIG. 3a is stored in the A memory 1 as new data. First, the address counter 11 is reset and the initial signal becomes "0". As a result, the A and B memories are switched to read mode. address counter 1
The count value of 1 increases again in sequence to designate the read address of the A and B memories.

However, the address specification in this case is A memory 1.
address converter 1 so that the one for B memory 2 precedes the one for B memory 2 by one scanning line.
2 is adjusted. That is, the specified address for A memory 1 is AD _a , and the address corresponding to B memory 2 is AD a.
In this example, the address AD _{a is} [AD _b
+2048].

The data stored in the A memory is sequentially read out and input to the shift register 7, and then sequentially transferred to the shift registers 8→9→6→61→62→5→51→52. Signal SR of the pixel being processed
When 0 is in the shift register 61, the upper left, right above, upper right, left side, right side, lower left, right below,
As shown in FIGS. 2 and 4, the signals of the pixels at the lower right positions are the most significant digits of shift registers 7, 8, and 9, shift register 6, shift register 62, and shift register 5, respectively. most significant digit,
SR1 to SR8 from shift registers 51 and 52
It is output as .

If SR0 is "0" at this time, AND gates A2 and A3 are closed, so the W/R of each memory
The signal becomes "0". That is, since A and B memories 1 and 2 are in read mode, B memory 2
The content of is not changed and remains at "0".
On the other hand, if SR0 is "1", it is checked by NAND gate NA whether the read signals SR1 to SR8 of the surrounding points shown in FIG. 4 are all "1". If they are all "1", the output becomes "0" and AND gates A2 and A3 are closed, and the contents of B memory 2 are not changed and kept at "0" as before.

However, when all of SR1 to SR8 are not "1", that is, when at least one of them is "0" (white), the output of NAND gate NA becomes "1" and AND gates A2 and A3 are opened. It can be done. As a result, the W/R signal of A memory 1 becomes “1”, that is, it is in write mode, but its IN
Since the signal is "0", in the A memory 1, the "1" at the processing target point is erased and becomes "0". Points that satisfy the above conditions are part of the contour,
All such points will be erased.

Since the 2-bit counter 10 is reset to "00" at the beginning of the processing operation, the NOR gate
The output of NOR is "1", and therefore the output of AND gate A3 is also "1". Therefore, B
Memory 2 enters the write mode, and at this time the initial signal is "0" and the IN signal of B memory 2 is "1", so "1" is written to the address of B memory corresponding to SR0 in Figure 4. be included.

If you perform the above operations for one frame,
The image in Figure 3a stored in the A memory 1 is converted into a thin shape with its outline shaved off as shown in Figure 3c, while the image in the B memory 2 has a contour line corresponding to the image in Figure 3a. The image shown in Figure b is stored.

During the above operation, the data read from A memory 1 contained one or more "1"s, so flip-flop 4 was placed in the set state.

Next, the same processing as described above is performed on the image shown in FIG. Closed.
Therefore, even if a point (bit) on the contour is detected, writing to the B memory 2 is not performed. but,
The outline of the stored image in the A memory 1 is shaved off by one pixel. Furthermore, repeat the same operation and
When the contents of the bit counter become "10" or "11", AND gate A3 is closed in the same way, so the outline is not written to B memory 2, and the stored image in A memory 1 is It just becomes thinner as shown in Figure 3 d.

In the fourth frame, the 2-bit counter 10 becomes "00" again, so as is clear from the above description, the outline of the image stored in the A memory 1 at that time is stored in the B memory 2. Therefore, the stored images in the A and B memories at this time become as shown in e and f in FIG. 3, respectively. When the same processing is performed again, all the stored contents of the A memory 1 become "0", and the flip-flop 4 remains in the reset state when the next frame processing is completed. The output of the flip-flop 4 at this time is supplied to the clock and control signal generator 3 to stop the processing operation.

The processed image (such as the one shown in Figure 3 f) is stored in the B memory 2, so if it is supplied to a known suitable output device (for example, a raster scan printer, etc.), a contour line pattern will be created. A transformed visible image can be obtained.

When the contour line pattern image created as described above is further copied, the resulting reproduced image often has missing portions as shown by dotted lines in FIG.

An object of the present invention is to provide a method for detecting and reproducing the above-described missing portion.

FIG. 6 is a block diagram of one embodiment of the present invention, and FIG.
The figure is a flowchart explaining the operation.
In FIG. 6, 21 is a microprocessor, 22
2 is an image reading device, 23 is an image memory, 24 is a program and buffer memory, 25 is a printer control device, 26 is a printer, and 27 is a bus line that connects these to exchange commands and data. .

The operation of the apparatus of the present invention will be described below with reference to FIGS. 6 and 7. In the following, it is assumed that the contour line pattern is formed at intervals of 1 bit (pixel).

First, an original image (contour pattern image) is read from the image reading device 22 and stored in the image memory 23 via the bus line 27 (step S1). The signal of the point to be processed (pixel) P _i is read from the information stored in the image memory 23, and it is determined whether it is black (“1”) or white (“0”) (S2, S3). P _i is black (“1”)
Then, count how many black (“1”) there are among the eight points (pixels) P _j (j = 1 to 8) around you on the image, that is, the points (pixels) in Figure 8, and calculate the number. is 1 or 0 (step
S4).

If the number is 1 or 0, it is determined that this is an open end of the contour line pattern, and the process proceeds to step S5. In step S5,
It is checked whether each of the surrounding points P _j (j=1 to 8) is "0" or not. Point P _j is “0”
(that is, white), for that point P _j , similarly to step S4 above, check whether the number of black (“1”) among the 8 points (pixels) around it is less than or equal to 1. (Step S6).

If the number of black points is not less than 1, or if point P _j is not "0" (that is, black) in step S5, then the case is like point a or b in FIG. 9, and it is not a missing point. Since there is no one, the process directly proceeds to step S7, and it is determined whether or not the checks in steps S5 and S6 have been completed for all _Pj . If it is not completed, set j to (j+1) (step S8) and repeat the same check for other surrounding points.

In step S6, if the black (“1”) of the eight points around point P _j is 1 or 0, it is determined that there is a missing image at the position of point P _j , and the point in the image memory 3 is The information on the P _j position is converted to black (“1”) (step S9). As described above, the processing for point _Pj is completed, i is updated to (i+1) (step S10), and the process proceeds to the next step S11.

In step S3, when the point P _i to be processed is not black (“1”) (that is, it is white), in step S4, the number of black (“1”) points around the point P _i is greater than 1. At some time or step S7
Steps for all (8) points P _j in
When the checks in S5 and S6 have been completed, it is determined that there are no missing parts around the point P _i , and the process proceeds to steps S10 and S11.

In step S11, it is checked whether or not the determination process for all pixel points has been completed. If not, the process returns to step S2 and the above-described process is repeated for the next pixel point P _i+1 . All pixels (including pixels converted to black in step S9)
If the judgment process has been completed, the step
Proceeding to S12, the contents of the image memory are sent to the printer 6 via the printer control device 25, and a reproduced image is output.

As described above, according to the present invention, it is possible to detect missing portions of a contour line pattern that tend to occur due to copying, etc., and reproduce a correct image without distortion. In addition,
The above example has been described in which the line width and line interval of the contour line pattern are both 1 pixel (bit), but even if the number of pixels changes, the present invention can be implemented by changing the judgment step in the flowchart of FIG. The applicability is clear. For example, if the line width is 1 bit and the line spacing is 2 bits, set S6 to "P _j
Is “1” out of 24 points around 2 or less? You can change it to ``.

[Brief explanation of the drawing]

FIG. 1 is a diagram showing an example of a normal image and an image with a contour line pattern, which is the processing target of the present invention. FIG. 2 is a block diagram of an apparatus for creating an image with a contour line pattern.
4 is a diagram for explaining its operation, FIG. 5 is a diagram illustrating the state of missing parts in an image with a contour line pattern, FIG. 6 is a block diagram of a missing part reproducing apparatus suitable for implementing the present invention, and FIGS. FIG. 8 is a diagram for explaining the operation, and FIG. 9 is a diagram showing an example of an end portion with no missing parts. 21...Microprocessor, 22...Image reading device, 23...Image memory, 24...Buffer memory, 25...Printer control device, 26...
...Printer, 27...Bus line.

Claims (1)

[Scope of Claims] 1. A first step of reading a contour line pattern image pixel by pixel from a binary signal format of "1" and "0" and storing it in a memory, and for each pixel of signal "1", its surroundings. the first of
a second step of checking whether the number of signal "1"s included in the pixels of the planned area is less than or equal to the first set number, and determining whether or not it is at the edge of the image based on the result; , For pixels determined to be at the edge of the image, for each pixel of signal "0" among the pixels of the surrounding first predetermined region, the signal "1" included in the pixels of the surrounding second predetermined region a third step of checking whether the number of "" is less than or equal to a second set number, and determining whether or not the pixel of the signal "0" is a missing portion based on the result; A method for reproducing a missing part of a contour line pattern image, the method comprising: a fourth step of converting information in a memory corresponding to a pixel determined to be "1" into a signal "1".