JPH03232072A - System for moving binary picture information - Google Patents

Abstract

PURPOSE:To perform the move processing at a high speed by developing two binary picture information in binary picture information development areas and transferring information of a rectangular area on one binary picture information onto the other binary picture information with a word as the unit. CONSTITUTION:A moving means 4 writes data, where bits of only the part of a rectangular area 31 are 'OO', in a segmented area 32, which is retrieved from a binary picture information development area 22b of the output side by a retrieving means 3, with one row as the unit by operating AND. Only bits which are not '0' out of bits resulting from AND between one correspond ing word of a segmented area 32, which is retrieved from a binary picture information development area 22a of the input side by the retrieving means 3, and data where bits of only the part of the rectangular area 31 are '1 with one row as the unit are written by operating OR. Data where bits of only the part of the rectangular area 31 are '0' is written in one corresponding word of the segmented area 32, which is retrieved from the binary picture information development area 22a of the input side by the retrieving means 3, with one row as the unit by operating AND. Thus, the move processing is performed at a high speed.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention performs binary image information processing by converting information of a rectangular area on one of two binary image information into the other binary image information. The present invention relates to a method for moving binary image information onto image information.

[Conventional technology]

Conventionally, this type of binary image information movement method moves all dots within a rectangular area to be moved dot by dot. FIG. 11 is a diagram for explaining a conventional method for moving binary image information, in which a black dot in a rectangular area of a binary image information storage area 21a having a rectangular area to be moved is a black dot, and a white dot is The dots are treated as white dots and transferred bit by bit to the corresponding dots in the rectangular area of the binary image information storage area 21b that has the rectangular area to be moved to create the binary image information storage area 23b. Image information storage area 212
In the rectangular area of L, both black dots and white dots are changed to white dots one bit at a time, and the binary image information storage area 23
A is being created.

[Problems to be Solved by the Invention] The conventional method for moving binary image information described above has the drawback of slow processing speed because the binary image information is transferred dot by dot.

SUMMARY OF THE INVENTION An object of the present invention is to provide a method for moving binary image information that eliminates the above-mentioned drawbacks.

[Means to solve the problem]

The moving method of binary image information of the present invention is a moving method of moving information in a rectangular area on one of two binary image information onto the other binary image information. A storage means having a binary image information expansion area for storing value image information, and a memory means for arranging the lines of the binary image information on the binary image information storage area given from the outside so that each line starts from a word boundary. a writing means for writing into the binary image information development area by adding white dots between the two; a search means for carrying out a search that includes the entire rectangular area by shifting vertically or horizontally in word size units from the upper end of a rectangular area on the value image information expansion area; and separate binary image information expansion in the writing means. Means for taking one of two binary image information written in an area as an input and moving to the other output side, the clipping being searched by the search means on the binary image information development area on the output side. Only the rectangular area part of the area has a bit of 0''
The data is logically ANDed line by line, and then the binary image information expansion area on the input side is searched by the search means, and the corresponding l word of the cutout area and the rectangular area are data with bits of 1 bit. are logically ANDed row by row, only those whose result is not O are logically written, and the binary image information development area on the input side is rectangular with respect to the corresponding l word of the cutout area searched by the search means. a moving means for logically multiplying data whose bit is "O" only in the area part by row;
The writing means writes the binary image information on the binary image information development area to the binary image information storage area by deleting the white dots added between the lines so that each line starts from a word boundary. and a writing means.

〔Example〕

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

FIG. 1 is a block diagram of an embodiment of the present invention, in which storage means 1. Writing means 2. Search means 3. It is composed of a moving means 4 and a writing means 5.

Storage means 1 develops and stores two binary image information 2
It has a value image information development area.

FIG. 2 is a diagram for explaining the operation of the writing means 2. The writing means 2 writes binary image information on the binary image information area 21 given from the outside so that each row starts from a word boundary. A white dot is added between the and lines and written in the binary image information development area 22.

FIG. 3 is a diagram for explaining the operation of the search means 3, in which each row starts from a word boundary and the cutout area 32 is a square area whose number of dots on one side corresponds to the word size.
From the upper end of the rectangular area 31 on the value image information development area 22, the rectangular area 31 is softened vertically or horizontally in word size units.
Search to include the entire area.

FIG. 4 is a diagram for explaining the operation of the moving means 4, in which the moving means 4 responds to two binary image information written in separate binary image information development areas 22a and 22b by the writing means 2. is a means for using one as an input and moving to the other, and for example, on the output side, for example, the cutout region 32 searched by the search means 3 on the binary image information development region 22b,
Only the rectangular area 31 has hit "0" data written in a logical product line by line, and the binary image information expansion area 22a on the input side is written to the corresponding l word of the cutout area 32 searched by the search means 3. On the other hand, among the data in which the hit of only the rectangular area 31 is "1" is logically ANDed row by row, only those whose result is not 0 are logically summed, and the binary image information development area on the input side is written as a logical sum. 22a is retrieved by the retrieving means 3, and the data of the bit "0" is logically ANDed row by row only in the rectangular region 31 for the corresponding 17-word of the cut-out region 32.

FIG. 5 is a diagram for explaining the operation of the writing means 5, in which the writing means 5 deletes white dots added between rows in the writing means 2 so that each row starts from a word boundary. hand,
This is means for writing the binary image information on the binary image information development area 22 to the binary image storage area 21.

FIG. 6 is a flowchart of the processing of the writing means 2, and the processing of the writing means 2 will be explained with reference to FIG. 2 and FIG. First, the number of horizontal dots of the binary image information in the binary image information storage area 21 is divided by the number of dots for one word, and the remainder is subtracted from the number of dots for one word. The number K of white dots to be added is determined (step Q). Next, the line position on the binary image information storage area 21 is set to 1 in order to make it the first line of the binary image information (step Q). Next, white dots are added to the end of the second row of the binary image information on the binary image information storage area 21 by the number of dots determined in step Q, and the binary image information on the binary image information development area 22 is added. The second line of image information is output (steps O to Q). Next, advance the line position of the binary image information on the binary image information storage area 21 by one (step C), and step O until the number of lines of the binary image information on the binary image information storage area 21 is exceeded. -0 is repeated (step O).

FIG. 7 is a flow chart of the processing of the search means 3, and the processing of the search means 3 will be explained with reference to FIGS. 3 and 7. First, the first line of the rectangular area 31 on the binary image information development area 22 is set as the line position (step 2). Next, the left end position M of the cutout area 32 including the left end of the rectangular area 31 on the binary image information development area 22 is determined (step @). next,
The moving means 4 is activated (step O). Next, the left end position of the cutout area 32 is advanced by the number of dots corresponding to one word (step 0), and steps @ and o are repeated until the cutout area 32 includes the right end of the rectangular area 31 (step 0). Next, the upper end position of the cutout area 32 is advanced by the number of dots equivalent to one word, and steps C through are repeated until the cutout area 32 includes the lower end of the rectangular area 31 (step 0).

FIG. 8 is a flow chart of the processing of the moving means 4, and the processing of the moving means 4 will be explained with reference to FIGS. 4 and 8. First, in order to set the row position N in the cutout area 32 as the first row, N
is set to 1 (step @)).

Next, in the Nth row of the cutout region 32 whose upper left end is the vertical row of the binary image information development area 22b and the horizontal M dot, data whose rectangular area 31 corresponds to °'0'' is registered. 41 (step ■).

Next, the contents of the register 41 are transferred to the binary image information development area 22.
Write the logical product on the corresponding l word on b (step ■
). Next, data whose upper left end corresponds to "1°" in the rectangular area 31 in the Nth row in the cutout area 32 where the vertical row and the horizontal M dot of the binary image information development area 22a are registered. 42 (step 0).Next, the Nth row in the cutout area 32 of the binary image information expansion area 22a is logically ANDed with the contents of the register 42, and the result is transferred to the register 42.
Return to (step@). Next, the contents of the register 42 that are not "0°" are OR-written in the corresponding one word on the binary image information development area 22b (steps @, @)
. Next, the contents of the register 41 are transferred to the binary image information development area 22.
Write a logical product on the Nth line in the cutout area of a (step ■
). Above steps @.

Rectangular area 3 included in input side cutout area 32 by O
1 is copied to the cutout area 32 on the output side, and the rectangular area 31 included in the cutout area 32 on the input side is erased. Next, advance the row in the cutting area 32 by one (step @), and repeat steps @ to @ until the number of dots for one word is exceeded (
Step @).

FIG. 9 is a flow chart of the processing of the writing means 5, and the processing of the writing means 5 will be explained with reference to FIGS. 5 and 9. First, line position J of the binary image information development area 22b on the output side.
Set J to 1 in order to make this the first row of binary image information (
step 0). Next, 2 on the binary image information development area 22
From the end of the J-th line of the value image information, the number of white dots equal to the number of dots calculated in step 2 is deleted and outputted to the J-th line of the binary image information in the binary image information storage area 21 (step 2). ~@). Next, advance the line position J of the binary image information on the binary image information development area 22 by one (step ■), and step O- until it exceeds the number of lines of the binary image information on the binary image information development area 22. Repeat step 6 (step C).

FIG. 10 is a diagram showing a specific example of the processing of the embodiment shown in FIG.
This indicates that the information in the rectangular area on the binary image information storage area 21a is processed word by word and moved to the rectangular area on the binary image information storage area 21b to create the binary image storage area 23b. ing.

In addition, although the word size is shown as 4 in Fig. 4,
It is not limited to 4, but may be any integer.

〔Effect of the invention〕

As explained above, the present invention expands two pieces of binary image information into respective binary image information development areas, and uses information in a rectangular area on one of the binary image information on the other binary image information. Since the words are moved upward in units of words, there is an effect that the movement process can be performed at high speed.

[Brief explanation of drawings]

FIG. 1 is a configuration diagram of an embodiment of the present invention, and FIG. 3, 4, and 5 are diagrams for explaining the operations of the writing means, searching means, moving means, and writing means shown in FIG. 1, and FIG. 6, FIG. 7, and FIG. 8, respectively. and FIG. 9 are flowcharts of the processing of the writing means, search means, moving means, and writing means of FIG. 1, respectively, FIG. 1O is a diagram showing a specific example of the processing of the embodiment of FIG. 1, and FIG. FIG. 1 is a diagram for explaining a conventional method for moving binary image information. 1... Storage means, 2... Writing means, 3
... Search means, 4... Transportation means, 5...
...Writing means.

Claims (1)

[Claims] A binary image information development area that stores two pieces of binary image information in a movement method that moves information in a rectangular area on one piece of binary image information onto the other piece of binary image information. and storage means having a storage means having a storage means for storing the binary image information provided from the outside on the binary image information storage area, adding white dots between the lines so that each line starts from a word boundary, and storing the binary image information in the binary image information storage area. a writing means for writing into the information development area; and a cutting area, which is a square area where each row starts from a word boundary and the number of dots on one side is equal to the word size, from the upper end of the rectangular area on the binary image information development area. a search means that performs a search that covers the entire rectangular area by shifting vertically or horizontally in size units; and two binary image information written in separate binary image information development areas by the writing means. Means for moving one of them to the output side using one as an input, the bit being set to "0" only in the rectangular area portion of the cutout area searched by the search means on the binary image information development area on the output side. In addition to logically ANDing the data in each line, one word corresponding to the cutout area searched by the search means in the binary image information expansion area on the input side and data with bit "1" only in the rectangular area are written. Of the logical product results for each row, only those whose results are not 0 are logically summed, and the binary image information development area on the input side is divided into a rectangular area for one word corresponding to the cutout area searched by the search means. 2. A moving means for logically AND writing data whose bit is "0" only in the part row by row, and a white dot added between rows in the writing means so that each row starts from a word boundary. 1. A method for moving binary image information, comprising: writing means for writing binary image information on a value image information development area to a binary image information storage area.