JP2765051B2 - Combination method of binary image information - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Industrial Application Field] The present invention obtains an exclusive OR to combine binary image information within a specified rectangular range on two binary image information. The present invention relates to a method for synthesizing image information.

[Conventional technology]

It has been conventionally performed to combine binary image information within a specified rectangular range on two pieces of binary image information by taking an exclusive OR. Conventionally, as shown in FIG. , A rectangular area 111a on the binary image information 111 of the synthesis source
And the binary image information in the rectangular area 112a on the binary image information 112 of the combining destination
When obtaining 112 ', the combining means 113 which takes the exclusive OR of the corresponding dots in the rectangular areas 111a and 112a one by one and writes the logical operation result in the rectangular area 112a has been used.

[Problems to be solved by the invention]

Conventionally, as described above, since the binary image information is synthesized by processing the binary image information in the rectangular area one dot at a time, there is a problem that the processing speed is reduced.

An object of the present invention is to enable high-speed synthesis of binary image information in two rectangular areas.

[Means for solving the problem]

In order to achieve the above object, the present invention provides a method of synthesizing binary image information for synthesizing binary image information in a rectangular area on first and second binary image information, Writing the binary image information in which the number of dots in each row is an integral multiple of the word size by adding an additional dot to the end of each row of the binary image information in the first and second binary image information development areas A search means for obtaining a position of a cutout area having a portion starting from a word boundary and having a number of dots in a row direction equal to the word size and having a portion overlapping the rectangular area; The binary image information included in the cutout area on the first binary image information whose position has been found by the search means, and the rectangular area of the cutout area whose position has been found by the search means; AND operation with data in which only the bit Done in's unit, the logical operation result is all "0"
The logical operation result of a row that is not the same and the binary image information of the corresponding row on the second binary image information development area are subjected to an exclusive OR operation in word size units, and the logical operation result is calculated as the second binary image information. Exclusive OR means for writing to a corresponding row on the value image information development area; and an additional dot added to the end of each row of the binary image information stored in the second binary image information development area And a writing means for deleting and outputting the same.

(Operation)

The writing means adds an additional dot to the end of each line of the first and second binary image information, and converts the binary image information in which the number of dots in each line is an integral multiple of the word size into the first and second binary image information. Write in the image information development area. The search means obtains the position of a rectangular cut-out area whose head starts from a word boundary and whose number of dots in the row direction is equal to the word size, and which has a portion overlapping the rectangular area. The exclusive OR means sets "1" to only the binary image information included in the cutout area on the first binary image information obtained by the search means and the bit overlapping the rectangular area of the cutout area. AND operation is performed in word size units with the data set as above, and the logical operation result of the row where the logical operation result is not all “0” and the binary image information of the corresponding row on the second binary image information development area And the result of the logical operation is written to the corresponding row in the second binary image information development area. The writing unit deletes and outputs an additional dot added to the end of each line of the binary image information stored in the second binary image information development area.

〔Example〕

Next, embodiments of the present invention will be described in detail with reference to the drawings.

FIG. 1 is a block diagram of an embodiment of the present invention, in which a binary image information synthesizing apparatus 1, a binary image information storage area 2a storing binary image information of a synthesis source, and binary image information of a synthesis destination And a storage device 2 including a binary image information storage area 2b. The binary image information synthesizing device 1 is a binary image information expansion area 11a in which the binary image information of the synthesis source is expanded.
A storage unit 11 including a binary image information development area 11b in which binary image information of a combination destination is developed, and binary image information stored in binary image information storage areas 2a and 2b in the storage device 2. For the read binary image information, white additional dots are added to the end of each line so that the number of dots in each line becomes an integral multiple of the word size, and each line of the binary image information to which the additional dots are added is read. Writing means 12 for writing into binary image information development areas 11a and 11b starting from a word boundary, and all cutout areas having a portion overlapping with a specified rectangular area (the head starts from a word boundary and starts in the line direction) Is a rectangular area in which the number of dots is equal to the word size, and in the present embodiment, is a square area in which the number of dots on one side is equal to the word size). 13
And exclusive OR means 14 for combining binary image information by taking exclusive OR, and a binary image information development area
And writing means 15 for deleting an additional dot added to the end of each line of the combined binary image information stored in 11b and writing it to the binary image information storage area 2b. The exclusive OR means 14 includes a register 14a having a capacity equal to the size of one word, and the first bit to the Nth bit of the register 14a are the first bit to the Nth bit in the cut-out area, respectively.
Corresponds to a bit.

When combining the binary image information, the user inputs the binary image information of the combination source and the combination destination into the binary image information storage areas 2a and 2b, respectively, and also inputs the binary image information storage area 2a to the search means 13. , 2b (in this embodiment, the positions are assumed to be the same), and then the writing means
Start 12

FIG. 2 is a flow chart showing a processing example of the writing means 12. Referring to FIG. 2, the writing means 12 sets the flag F to "1" in step S21, and sets the input source in the next step S22. Is a binary image information storage area 2a, and an output destination is a binary image information development area 11a. Thereafter, in step S23, the writing means 12 determines the number of horizontal dots (the number of dots in one row) of binary image information in the binary image information storage area 2a of the input source in one word. By subtracting the remainder after dividing by the number of dots for one word, the number K of white additional dots to be added between rows is obtained, and additional dot addition processing is performed in step S24. The row position I is the first row. In the next step S25, the writing means 12 inputs the first line of the binary image information in the binary image information storage area 2a of the input source, and in step S26 the 1st row input in step S25.
At the end of the row of binary image information, K white additional dots are added, and at step S27, one row of binary image information to which K additional dots have been added is added to the binary image information development area 11a. Write to the first line. Hereinafter, the writing means 12 advances the row position I where the additional dot addition processing is performed by one row (step S2).
8) Until the row position I exceeds the number of rows of the binary image information in the binary image information storage area 2a (the determination result of step S29 is yes)
The above processing is repeated. When the result of the determination in step S29 is yes, the writing means 12 determines whether the flag F is "1" (step S30). If it is determined in step S30 that the flag F is "1", the writing means 12 sets the input source to the binary image information storage area 2b in step S31.
The output destination is the binary image information development area 11b, the flag F is set to "0" in step S32, and the process returns to step S23, and the binary image information storage area 2b is processed in the same manner as described above.
The binary image information stored in the
Expand to 11b. If it is determined in step S30 that the flag F is not "1", the writing means 12
After activating 13 (step S33), the process ends.

Accordingly, as shown in FIG. 3, K additional dots are added to the end of each row of the binary image information in the binary image information storage areas 2a and 2b in the binary image information development areas 11a and 11b, Binary image information in which each row starts from a word boundary is stored.

When the search means 13 is activated by the writing means 12, it starts the processing shown in the flowchart of FIG.
In this case, the top row position of the rectangular area on the binary image information development areas 11a and 11b is set as the top row position L of the cutout area including the upper left end of the rectangular area. Now, for example, the binary image information development area 11
Assuming that the rectangular area 11c on a is as shown in FIG.
The search unit 13 sets the fourth row as the top row position L of the cutout area d1,1 including the upper left end of the rectangular area 11c.

When the processing in step S41 is completed, the search means 13 determines in step S42 the dot position (column position) at the left end of the rectangular area 11c on the binary image information development area 11a by the number of dots for one word (the present embodiment). In this case, it is assumed to be 4 dots.
Are added to obtain the dot position M at the upper left corner of the cutout area d1,1 including the upper left corner of the rectangular area 11c. In the example shown in FIG. 5, the dot position at the left end of the rectangular area 11c is 7,
Since the number of dots for one word is 4, the dot position M at the left end of the cutout area d1,1 is the fifth dot.

When the dot position M is obtained in step S42, the search means 13 activates the exclusive OR means 14 by passing the dot position M and the row position L obtained in step S41 (step S42).
S43). When the exclusive OR means 14 is activated by the search means 13, it starts the process of synthesizing the binary image information stored in the binary image information development areas 11a and 11b. The combining process performed by the exclusive OR means 14 will be described later in detail.

When the exclusive OR means 14 is activated in step S43, the search means 13 determines in step S44 the value obtained by adding the number of dots for one word to the dot position M as the dot position M at the left end of the new cutout area. In the next step S45, the calculation shown in the following equation (1) is performed to determine whether or not the dot position M obtained in step S44 is beyond the right end of the rectangular area 11c.

M> A + BC (1) where, in the expression (1), A is a binary image information development area
The right end dot position of the rectangular area 11c on 11a, B is the number of dots for one word, and C is the right end dot position of the rectangular area 11c on the binary image information development area 11a divided by the number of dots for one word. Represents the remainder.

Then, when it is determined that the condition shown in Expression (1) is not satisfied, that is, when it is determined that the dot position on the left end of the new cutout area obtained in step S44 does not exceed the right end of the rectangular area 11c Returns to the process of step S43, when the search unit 13 determines that the condition shown in the equation (1) is satisfied, that is, the left end of the new cutout region obtained in step S44 is set to the right end of the rectangular region 11c. If it is determined that it has exceeded, the process of step S46 is performed.

Therefore, in the example shown in FIG. 5, since the number of dots for one word is added to the dot position M at the left end of the cutout areas d1, 4 in step S44, the determination result in step S45 is no. The search means 13 sequentially notifies the exclusive-OR means 14 of the row position L and dot position M at the upper left corner of the cutout areas d1,1 to d1,4 on the binary image information development area 11a.

In step S46, the search means 13 sets 1 in the row position L.
A process of adding the number of dots for words is performed, and in the next step S47, an operation represented by the following equation (2) is performed, so that the line position L obtained in step S46 is changed to the lower line position of the rectangular area 11c. It is determined whether or not it has exceeded.

L> X + BY (2) where X is the binary image information development area 11 in the equation (2).
a is the lower row position of the rectangular area 11c on a, B is the number of dots for one word, and Y is the lower row position of the rectangular area 11c on the binary image information development area 11a divided by the dot number for one word. Represents the remainder.

In step S47, the row position L obtained in step S46
If it is determined that does not exceed the bottom row position of the rectangular area 11c, that is, if it is determined that the condition shown in Expression (2) is not satisfied, the process returns to step S42, and it is determined that the bottom row row is exceeded. If the processing has been completed, the process waits for the processing of the exclusive OR means 14 to end (step S48), and the exclusive OR means 1
When the process of 4 is completed, the writing unit 15 is activated (step S49), and then the process is terminated.

Therefore, in the example shown in FIG. 5, the determination result in step S47 is no until the number of dots for one word is added to the row position La at the upper left corner of the cutout areas d3, 4 in step S46. The search means 13 sequentially notifies the exclusive-OR means 14 of the row position L and the dot position M at the upper left corner of the cutout areas d2,1 to d3,4,
After that, the process ends.

The exclusive OR means 14 receives the row position L and the dot position M at the upper left corner of the cut-out area to be processed from the search means 13 and, when activated, starts the processing shown in the flowchart of FIG. First, in step S61, N is set to "1", so that the line to be processed in the cutout area is set to the first line. Next, the exclusive OR means 14 converts the first bit to the fourth bit of the N-th row of the cutout area where the upper left row position and the dot position on the binary image information development area 11a are L and M, respectively. Corresponding to the first to fourth bits of the register 14a, "1" is set to the bit of the register 14a corresponding to the bit overlapping the rectangular area among the bits of the Nth row, and the other bits are set. Is set to "0" (step S62). Thereafter, the exclusive OR means 14 becomes the search means 1
The word of the binary image information of the Nth line in the cutout area on the binary image information development area 11a indicated by the row position L and the dot position M notified from 3 and the data set in the register 14a A logical AND operation in units of size is performed, and the operation result is set in the register 14a (step S63).

FIG. 7A shows the cutout area when the row position L and the dot position M at the upper left corner of the cutout area d1,1 shown in FIG. 5 are notified, and N = 1, 2, 3, 4 It shows the contents of d1, 1 and the contents of the register 14a when the processing in step S62 is performed and the contents of the register 14a when the processing in step S63 is performed. In this example, since only the third and fourth rows of the cutout area d1,1 overlap the rectangular area 11c, the processing in step S62 is performed, so that only the third and fourth bits of the register 14a are stored. “1” is set, and “0” is set in the first and second bits. FIG. 4B shows a cutout area.
FIG. 3 (c) shows the above contents when d1,2 is notified, FIG. 4 (c) shows the above contents when the cutout areas d1,4 are notified, and FIG. 4 (d) shows the cutout areas d3,1. FIG. 9E shows the contents at the time when the cutout areas d3 and 2 were notified, and FIG.
FIG. 11F shows the above contents when the cutout areas d3 and d4 are notified.

Next, the exclusive OR means 14 determines whether or not the data set in the register 14a is all "0" (step S64). Then, in step S64, the register 14a
If it is determined that the data set in is "0", N is incremented by 1 (step S66). On the other hand, if it is determined that all the bits are not “0”, the binary data of the N-th row of the cut-out area on the binary image information development area 11b indicated by the row position L and the dot position M notified from the search unit 12 After performing a logical exclusive OR operation on a word size basis between the image information and the data set in the register 14a, and writing the operation result in the N-th row of the cutout area (step S65),
The process of step S66 is performed. When the processing in step S66 ends, the exclusive OR means 14 calculates the N obtained in step S66.
Is larger than the number of dots for one word of the cutout area (step S67). Then, when it is determined that N does not exceed the number of dots for one word of the cutout area, the process returns to step S62, and when it is determined that it exceeds, the process is terminated.

When the writing means 15 is activated by the search means 13, it starts the processing shown in the flowchart of FIG.
, The row position J is the first row. Then step
In step S82, the J-th line of the binary image information on the binary image information development area 11b is input, and in step S83, the process proceeds to step S82.
In step S84, K dots are deleted from the end of the input line, and in step S84, the binary image information of the J-th line from which the last K dots have been deleted in step S83 is replaced with the J-th binary image information in the binary image information storage area 2b. Write on the line. Thereafter, the writing means 15 advances the line position J line by line (step S85), and until the line position J exceeds the number of lines of the binary image information in the binary image information development area 11b (the determination result in step S86 is yes). The above processing is repeated. That is, as shown in FIG. 9, the writing means 15 deletes the additional dots added by the writing means 12, and replaces the combined binary image information on the binary image information development area 11b with the binary image information. This is written to the storage area 2b.

In the above-described embodiment, the word size is set to four dots, but the word size is not limited to four dots.

〔The invention's effect〕

As described above, in the present invention, binary image information is synthesized by taking a logical exclusive OR in word size units. As compared with the conventional example in which image information is synthesized, there is an effect that the synthesizing process of two pieces of binary image information can be performed at a higher speed. Further, according to the present invention, an additional dot is added to each line of the binary image information, and the number of dots in each line is set to an integral multiple of the word size, and then the combining process is performed. There is also an effect that processing can be easily performed.

[Brief description of the drawings]

 FIG. 1 is a block diagram of an embodiment of the present invention, FIG. 2 is a flow chart showing an example of processing of the writing means 12, FIG. FIG. 5 is a flow chart showing an example of processing of the exclusive OR means 14, FIG. 7 is a flow chart showing an example of processing of the exclusive OR means 14, FIG. FIG. 8 is a flowchart showing an example of processing by the writing means 15, FIG. 9 is an explanatory view of the operation of the writing means 15, and FIG. 10 is an explanatory view of a conventional example. In the figure, 1... Binary image information synthesizing device 2... Storage device 2a, 2b... Binary image information storage region 11... Means 14 ... Exclusive OR means 14a ... Register 15 ... Write means

Claims (1)

(57) [Claims] 1. A binary image information synthesizing method for synthesizing binary image information in a rectangular area on first and second binary image information, wherein the first and second binary image information Writing means for writing binary image information obtained by adding an additional dot to the end of each line and making the number of dots in each line an integral multiple of the word size into the first and second binary image information development areas; A search unit for obtaining a position of a cutout region which is a rectangular cutout region in which the number of dots in the row direction is equal to the word size, starting from a word boundary, and having a portion overlapping the rectangular region; Only the binary image information included in the cutout area on the first binary image information whose position has been obtained and the bits overlapping the rectangular area of the cutout area whose position has been obtained by the search means are “ Performs a logical AND operation with the data set to 1 "in word size units. Performing an exclusive OR operation in word size units between the logical operation result of the row whose operation result is not all “0” and the binary image information of the corresponding row on the second binary image information development area, The result is the second
EXCLUSIVE-OR means for writing to a corresponding row on the binary image information development area, and added to the end of each row of the binary image information stored in the second binary image information development area A writing unit that deletes and outputs the additional dots.