JPH07334660A - Picture processor - Google Patents

Abstract

PURPOSE:To simplify the processing by subjecting original pictures to conversion like rotation, expansion, or reduction by the same processing even in the case of original pictures different in storage devices or data structures. CONSTITUTION:A picture editing means 1 generates an index table, where original picture specifying information to specify the original picture and picture elements in the original picture are held correspondingly to respective picture elements of the output picture, based on an output picture layout. An actual data read means 3 successively reads out corresponding picture element data of the original picture in accordance with the index table, and a data structure conversion means 5 converts this data into a prescribed data structure and writes it in an output picture storage means 6. An index table editing means 7 rearranges the index table to perform the conversion processing of the output picture. At the time of subjecting picture data in plural pages to the same editing processing, original picture specifying information of the index table is successively changed to that for the next page by an index table change means 8.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an image processing apparatus which edits and combines bit map image images to create a new image image.

[0002]

2. Description of the Related Art Conventionally, in order to create a new image image by editing and synthesizing a bitmap image image, the original image is once read into an image memory for image image processing and then image processing is performed. .

FIG. 14 is a block diagram showing an outline of a conventional image processing apparatus. In FIG. 14, 1 is an image editing means, 4 is an original image storage means, 4a is a magnetic disk, 4b is a RAM (random access memory), 4c is another storage device, 6 is an output image storage means, and 9 is an image memory. is there. The image editing means 1 reads the original image from the magnetic disk 4a, the RAM 4b or the other storage device 4c in the original image storage means 4 and temporarily stores it in the image memory 9.
After that, the output image is stored in the output image storage means 6 after processing such as rotation, enlargement, reduction, and composition.

Further, there are cases where there are plural pages of image data having the same image size and resolution, and there are plural types, and it is desired to perform different processing for each type and then synthesize and output. For example, as shown in FIG.
There are three types: image group A, image group B, and image group C. One image (A-n) in image group A is enlarged and one image (B-n) in image group B is enlarged. This is a case where the image is rotated 90 ° to 90 °, one image (C-n) in the image group C is reduced, and combined and output as shown in FIG.

Conventionally, in such a case, the processing is performed as follows. FIG. 16 is a flowchart showing an example of image editing processing of a conventional image processing apparatus. Step 1: Set 1 as the initial value of the value n for designating the page of the original image. Step 2 ... The n-th page image of the image group A is taken out from the original image storage means 4 and stored in the image memory 9, and then enlarged processing is performed. Step 3: The image of the nth page of the image group B is taken out from the original image storage means 4 and stored in the image memory 9, and then the rotation processing is performed. Step 4 ... The image of the nth page of the image group C is taken out from the original image storage means 4 and stored in the image memory 9, and then the reduction processing is performed. Step 5 ... The images processed in steps 2 to 4 are combined to create the output image of the nth page. Step 6 ... Add 1 to n. It is determined whether or not the number of steps 7 ... n exceeds the predetermined number of pages N, and if not, the process returns to step 2 and the same processing is repeated.

In the conventional image processing apparatus, the processing is performed in this way. Incidentally, as a conventional document relating to such an image processing apparatus, for example, Japanese Patent Laid-Open No. 2-298 is known.
76, JP-A-63-147225, JP-A-63-46064, JP-A-62-226380 and JP-A-63-61379.

[0007]

[Problems to be Solved by the Invention]

(Problem) However, the above-mentioned conventional technique has the following problems. The first problem is that access to the original image storage means 4, reading, editing and output of the image must all be performed by the image editing means 1, and the processing of the image editing means 1 becomes complicated. is there. The second problem is that there are multiple pages of image data of the same type as the original image, and there are multiple types of image data.
When different types of processing are performed and then combined and output, it is necessary to perform conversion processing for each image every time an output image of each page is created, which results in a long processing time. It is a point.

(Explanation of Problems) First, the first problem will be described. The original image storage means 4 includes a magnetic disk 4
There are various storage devices such as a, the RAM 4b, and the other storage device 4c, and they have different access methods and data read methods. Also, various data structures (color, density, etc.
(The number of bits per pixel), and the data read unit differs depending on the data structure. Therefore, the image editing means 1
When the original image is read from different storage means and edited and synthesized, it is necessary to read the original image while changing the access method or the reading method, and also considering the data structure of the original image. Further, in the edit processing such as conversion / combination of the read image data, it is necessary to change the processing according to the data structure of the original image, or to perform the processing after once converting to the same data structure. Therefore, the processing of the image editing means 1 becomes very complicated.

Next, the second problem will be described. Figure 1
As in the case shown in FIG. 5, there are a plurality of pages of image data of the same type as the original image, and there are a plurality of types of them. For each page, different processing is performed for each type and then combined and output. In such a case, step 2 of FIG.
4, each time the output image of each page is created, the conversion process of each image must be performed. Therefore, it takes a long processing time. An object of the present invention is to solve the above problems.

[0010]

In order to solve the above-mentioned problems, in the image processing apparatus of the present invention, the original image specifying information for specifying the original image corresponding to each pixel of the output image and the original image specifying information Index table for holding the pixel position of the output image, an image editing means for creating the index table based on the layout of the output image, and an original image identified corresponding to each pixel of the output image according to the index table. An actual data reading means for sequentially reading pixel data from the pixel position is provided. Further, the data structure converting means for converting the data structure of the pixel data read by the actual data reading means into the data structure of the output image is provided. Further, the index table editing means for converting the output image by rearranging the indexes of the index table is provided. Furthermore, when there are a plurality of pages of image data of the same type as the original image and the same editing process is sequentially performed on the image data of each page, the original image identification of the index table is specified every time the process for one page is completed. It was decided to provide an index table changing means for changing the information to that of the next page.

[0011]

[Operation] The image editing means, based on a predetermined layout of the output image, corresponds to each pixel of the output image, original image specifying information for specifying the original image, and pixel position in the original image. The image is edited by creating an index table holding and. Then, the actual data reading means reads the pixel data of the original image according to the index table. Therefore, the image editing means
The image can be edited regardless of the access method to the original image storage means, the data reading method, the data structure, the image output method, etc., and the processing is simplified.

Further, the data structure conversion means converts the data structure of the pixel data read by the actual data reading means into the data structure of the output image. Therefore, even if the data structures of the original image and the output image are different, the processing can be performed.

Further, the index table editing means performs the conversion process of the output image by rearranging each index of the index table. for that reason,
Even if the original image has a different data structure, it is possible to perform conversion processing such as rotation, enlargement, and reduction with the same processing regardless of the data structure.

Furthermore, when there are a plurality of pages of image data of the same type as the original image and the same edit processing is performed on the image data of each page, the index table changing means finishes the processing for one page. Each time, the original image specifying information in the index table is changed to that of the next page. Therefore, it is not necessary to convert each image every time an output image of each page is created, and the processing time is shortened.

[0015]

Embodiments of the present invention will now be described in detail with reference to the drawings. FIG. 1 is a block diagram showing an outline of the configuration of the present invention. Reference numerals correspond to those in FIG. 14, 2 is index table storage means, 3 is actual data reading means, 5
Is a data structure converting means, 7 is an index table editing means, and 8 is an index table changing means.

After performing a layout work for deciding which original image and how to arrange an output image, the image editing means 1 executes an index table and an identification number table as shown in FIG. It is created in the index table storage means 2 and the actual data reading means 3 is instructed to draw an output image. The identification number table is
Holds data for identifying a file or a memory area in association with each identification number “000”, “001”, ...
The index table corresponds to each pixel of the output image and has the identification number “00” as information for specifying the original image.
0 ”,“ 001 ”, ... And the relative address in them are held.

The original image storage means 4 is a magnetic disk 4a storing an original image for forming an output image, a RAM.
4b and other storage device 4c. The actual data reading means 3 sequentially reads the pixel data of the original image designated by the index from the original image storage means 4 and passes it to the data structure conversion means 5. Then, the data structure conversion means 5
Converts the data structure of the received pixel data into the data structure of the output image as necessary, and transfers it to the address of the output pixel. The index table editing means 7 edits the index table in the index table storage means 2 to perform image conversion processing such as rotation, enlargement and reduction. The index table changing means 8 changes the information specifying the original image of the index table in the index table storage means 2.

Next, the process of creating the index table by the image editing means 1 will be described. Figure 3
It is a flow chart which shows index table creation processing. Step 1 ... Decide which original images to use as the constituent elements of the output image and how to lay them out. Based on them, first, the original number such as the file name of the original image is stored in the identification number table. Stores image information. Step 2: Set "0" as the initial value of the number n that specifies the pixel of the output image. Step 3 ... It is determined whether or not n is less than or equal to the total number of pixels of the output image. Step 4 ... If the total number of pixels is less than or equal to the total number of pixels, the original image to which the n-th pixel of the output image belongs is checked according to the layout determined in Step 1, and the information is acquired. Step 5 ... Acquires the corresponding identification number from the identification number table. Step 6: The identification number and the relative address of the original image (pixel position in the original image) are stored in the index table. Step 7 ... Add 1 to n.

Next, the process of drawing the output image by the actual data reading means 3 will be described. FIG. 4 is a flowchart showing the output image drawing process. This processing is started by sending an output image drawing command from the image editing means 1 to the actual data reading means 3. Step 1: Set "0" as the initial value of the number n that specifies the pixel of the output image. It is determined whether or not step 2 ... N is less than or equal to the total number of indexes in the index table.

Step 3: If the number of indexes is less than the total number of indexes, the identification number and relative address of the nth index are acquired. Step 4 ... Acquires data such as the file name of the original image corresponding to the acquired identification number from the identification number table. Step 5 ... From the obtained file name and the like, the start address I of the original image required for actual access is obtained. Step 6 ... Read the header at the beginning of the original image,
The data structure (the number of bits per pixel) d of the original image is acquired.

Step 7 ... The pixel address of the original image is calculated based on the relative address x, the starting address I of the original image, the size h of the header, and the data structure d of the original image obtained in Step 3. In that case, the pixel address y of the original image
Is: y = I + h + d × x (1) Step 8 ... Read data for one pixel from the calculated address.

Step 9: The address of the output pixel is calculated. The address Y is Y = J + n × b (2), where n is the index number, b is the number of bits per pixel of the output image, and J is the offset (start address) of the output image. 5). Step 10 ... Data structure converting means 5 to data structure d,
The pixel data is transferred together with the output pixel address Y. Step 11 ... Add 1 to n.

In the above embodiment, in step 10,
Although the pixel data is transferred to the data structure conversion means 5,
When the data structure is always constant and there is no need to convert the data structure, the data structure may be directly transferred to a predetermined address of the output image storage means 6 without being transferred to the data structure conversion means 5.

Next, the processing for converting the data structure in the data structure converting means 5 will be described. FIG. 6 is a flowchart showing the data structure conversion processing. Step 1 ... Acquires the pixel data transferred from the actual data reading means 3 together with the data structure and the output pixel address. Step 2 ... Acquires the data structure and offset address of the output image. Step 3 ... It is determined whether or not the data structure of the original image acquired in Step 1 and the data structure of the output image acquired in Step 2 are the same. Step 4 ... If they are not the same, the data structure is converted. Step 5 ... Transfer the data to the output pixel address.

The conversion of the data structure in step 4 will be described. For example, the data structure of the original image is 1
If the data structure of the output image is 1 bit per pixel and each of the red, green, and blue components is 8 bits and has a total of 24 bits, the following is performed. That is, if the pixel data of the original image is "0", the output pixel data includes red, green, and blue components of "00000000".
(Binary display) = 0 On the other hand, if the pixel data of the original image is "1", the output pixel data is set to "11111111" (binary display) = 255 for the red, green, and blue components.

On the contrary, the data structure of the original image is 24 bits, that is, each of the red, green, and blue components is 8 bits per pixel, and the data structure of the output image is 1 pixel per pixel.
If it is a bit, do the following: That is, the values of the red, green, and blue components of the pixel data of the original image are r,
For g and b, 1 (1 bit) / 2 for each of r, g, and b
The average value is calculated after multiplying by 56 (8 bits). If the average value is less than a predetermined value, for example, less than 0.5, the output pixel data is set to "0", and the average is more than the predetermined value,
For example, if it is 0.5 or more, the output pixel data is set to "1".

Further, the data structure of the original image is 12 bits in total, that is, each of the red, green and blue components is 4 bits per pixel, and the data structure of the output image is red, green and blue per pixel. If the components of 8 are 8 bits each and total 24 bits, the following is performed. That is, if the red, green and blue component values of the pixel data of the original image are r, g and b, respectively, the red, green and blue component values R, G and B of the output pixel data are r and g, respectively. , B are respectively multiplied by 256 (8 bits) / 16 (4 bits) to obtain R = r × (256/16) G = g × (256/16) B = b × (256/16).

(When converting the output image) Next,
The index table editing means 7 rearranges the index table to rotate the output image,
A case where a rotation output image is obtained by performing conversion processing such as enlargement and reduction will be described. FIG. 7 is a diagram showing a process of performing rotation processing on the index table to obtain a rotation output image. Here, the three original images (a) shown in FIG.
7B shows a case where a rotation-processed composite image as shown in FIG. 7F is obtained from FIGS. The numbers 0, 1, 2, ... In each original image indicate each pixel.

First, in the identification number table of FIG.
File names of the original images (a), (b), and (C) on the magnetic disk 4a, memory addresses on the RAM 4b, and the like are registered in association with the identification numbers "000", "001", and "002". Next, an index table corresponding to the composite image before the rotation processing shown in FIG. 7C is created as shown in FIG. The processing is performed in the same manner as the processing shown in FIG.

Next, an area of the same size as the index table of FIG. 7D is secured, and the index table of FIG. 7D is rotated there, as shown in FIG. 7E. Create an index table. The rotation process differs depending on the rotation angle, but when rotating 90 ° to the left as in the case of FIG. 7, the data of index number 3 in the table of FIG. 7D is changed to the table of FIG. Move to the index number 0 of. Similarly, the process of moving the data of index number 7 to the index of index number 1 and the data of index number 11 to the index of index number 2 is repeated.

The process of obtaining the output image shown in FIG. 7F from the index table shown in FIG. 7E is performed in the same manner as the process shown in FIG. In the present invention, in this way, a rotated output image obtained by combining a plurality of original images can be obtained.

Further, when obtaining the enlarged output image, the index table editing means 7 creates the enlarged index table by overlapping the indexes of the index table at a predetermined ratio. And again, if you want to get the reduced output image,
The index table editing means 7 creates an index table which is reduced in size by thinning out the indexes of the index table at a predetermined ratio.

These conversion processes such as rotation, enlargement, reduction, etc. are performed only on the rearrangement of the index table and not on the original image itself. Therefore, the conversion processes are performed in parallel while the original image is being generated. Can be done by

(When the present invention is applied to the image editing of FIG. 15) Next, when performing the image editing as shown in FIG. 15, that is, there are a plurality of pages of image data having the same image size and resolution. There will be described a case in which there are a plurality of types, and different types of processing are performed and then combined and output. In such a case, the index table changing means 8 rewrites the data for specifying the original image in the index table (for example, the file name in the identification number table).

FIG. 8 is a flow chart showing an editing process when the present invention is applied to the image editing of FIG. Step 1 ... The image editing means 1 creates an index table of an image (hereinafter referred to as “enlarged A-1 image”) obtained by enlarging an image on the first page of the image group A (hereinafter referred to as “A-1 image”). Then, it is copied to a predetermined position of the output image index table in the index table storage means 2. The details of this processing will be described later (FIG. 9). Step 2 ... The image editing means 1 moves the image of the first page of the image group B (hereinafter, referred to as “B-1 image”) 90 to the right.
An index table of rotated images (hereinafter referred to as "rotated B-1 image") is created, and the index table is copied to a predetermined position of the output image index table in the index table storage means 2. The details of this process will be described later (FIG. 10). Step 3: The image editing means 1 creates an index table of images (hereinafter referred to as “reduced C-1 images”) obtained by reducing the images on the first page of the image group C (hereinafter referred to as “C-1 images”). Then, it is copied to a predetermined position of the output image index table in the index table storage means 2. The details of this process will be described later (see FIG. 1).
1).

Step 4: Set 1 as an initial value of n indicating the number of pages. Step 5: The actual data reading means 3 reads the actual data from the original image storage means 4 according to the output image index table, and writes the actual data in the output image storage means 6 via the data structure conversion means 5 to output the output image. create. Step 6 ... Add 1 to n. Step 7 ... It is determined whether or not n exceeds the total number N of pixels of the output image. Step 8 ... If not exceeded, the index table changing means 8 determines the file name of the identification number table in the index table storage means 2 for each image group A, B,
Change to the image on the next page of C. The details of this process will be described later (FIG. 13).

Next, regarding the processing of step 1 in FIG.
The details will be described. FIG. 9 is a flowchart showing the index table creation process for the enlarged A-1 image. Step 1 ... An area for creating an index table for the enlarged A-1 image is set as an index table storage means 2.
Separately secure. As for the size S, if the number of horizontal pixels of the image group A is W _A , the number of vertical pixels is H _A , the length of one index is L, and the enlargement ratio of the image group A is N _A ,
S = W _A × H _A × L × N _A ² . Step 2 ... "0" as the initial value of x indicating the pixel position in the horizontal direction of the enlarged A-1 image and y indicating the pixel position of the vertical direction.
Set.

Step 3 ... A-1 Relative address from the head of the target pixel of the image data, that is, (W _A × L _P ×
_{y ÷ N A + L P ×} x ÷ N A) a (truncated decimal),
Enlarged A-1 Image index table address (I
_A + W _A × write L × y + L × x) to. Note that L _P is the data length of one pixel of the enlarged A-1 image, and I _A is the enlarged A-1 image.
This is the start address of the image index table. Step 4 ... Add 1 to x. Step 5: x is enlarged A-1 Number of horizontal pixels of image W _A
× to determine whether exceeds N _A, does not exceed yet, the flow returns to step 3. Step 6 ... When x exceeds W _A × N _A , x is set to “0” and 1 is added to y. Step 7 ... y is the number of pixels in the vertical direction of the expanded A-1 image H _A
× to determine whether exceeds N _A, does not exceed yet, the flow returns to step 3.

Step 8 ... When y exceeds H _A × N _A ,
The index table of the enlarged A-1 image created in steps 1 to 7 is copied to the predetermined position of the output image index table in the index table storage means 2 with the identification number "000". The details of this processing will be described later (FIG. 12). Step 9 ... A-in the entry 000 of the identification number table
Set the file name of one image.

Next, regarding the processing of step 2 in FIG.
The details will be described. FIG. 10 is a flowchart showing the index table creation process for the rotated B-1 image. Step 1 ... An area for creating an index table of the rotated B-1 image is set as an index table storage means 2.
Separately secure. The size S is S = W _B × H _B × L where W _{B is} the number of pixels in the horizontal direction of the image group B, H _{B is} the number of pixels in the vertical direction, and L is the length of one index. Step 2 ... x indicating the horizontal pixel position of the B-1 image
Then, "0" is set as the initial value of y indicating the pixel position in the vertical direction.

[0041] Step 3 ... relative address from the beginning of the target pixel B-1 image data, i.e., (W _B × L _P ×
y + L _P a × x), the index table of the addresses of rotation B-1 image _{(I B + L × (H} B -y-1) + L × H
_B writes × x) to. Note that L _P is 1 of the rotated B-1 image.
The pixel data length, I _B, is the start address of the index table for the rotated B-1 image. Step 4 ... Add 1 to x. Step 5 ... It is judged whether or not x has exceeded W _B, and if it has not exceeded W _B , the procedure returns to Step 3. Step 6 ... When x exceeds W _B , x is set to “0” and y
Add 1 to. Step 7 ... It is judged whether or not y exceeds H _B, and if it does not exceed H _B , the procedure returns to Step 3.

Step 8: When y exceeds H _B , the rotation B created in Steps 1 to 7 is moved to a predetermined position of the output image index table in the index table storage means 2.
-1 Image index table with identification number "00
1 ". The details of this processing will be described later (FIG. 12). Step 9 ... B-in the entry 001 of the identification number table.
Set the file name of one image.

Next, regarding the processing of step 3 in FIG.
The details will be described. FIG. 11 is a flowchart showing the index table creation process for the reduced C-1 image. Step 1 ... An index table storage means 2 is provided as an area for creating an index table of the reduced C-1 image.
Separately secure. As for the size S, when the number of pixels in the horizontal direction of the image group C is W _C , the number of pixels in the vertical direction is H _C , the length of one index is L, and the reduction ratio of the image group C is N _C ,
The _{S = W C × H C ×} L × N C 2. Step 2 ... "0" as the initial value of x indicating the pixel position in the horizontal direction of the reduced C-1 image and y indicating the pixel position in the vertical direction.
Set.

Step 3 ... Relative address of the target pixel data indicated by x, y from the beginning of the C-1 image data,
That is, (W _C × L _P × y ÷ N _C + L _P × x ÷ N _C ).
(Truncated decimal), and the index table in the address of the reduced C-1 images _{(I C + W C × L} × y + L × x)
Write to L _P is the data length of one pixel of the reduced C-1 image, and I _C is the start address of the index table of the reduced C-1 image. Step 4 ... Add 1 to x. Step 5 ... x is the number of pixels W _{C in} the horizontal direction of the reduced C-1 image
It is determined whether or not it has exceeded × N _C, and if it has not yet exceeded, the process returns to step 3. Step 6 ... When x exceeds W _C × N _C , x is set to “0” and 1 is added to y. Step 7 ... y is the number of vertical pixels H _{C of the} reduced C-1 image
It is determined whether or not it has exceeded × N _C, and if it has not yet exceeded, the process returns to step 3.

Step 8 ... When y exceeds H _C × N _C ,
The index table of the reduced C-1 image created in steps 1 to 7 is copied to the predetermined position of the output image index table in the index table storage means 2 with the identification number "003". The details of this processing will be described later (FIG. 12). Step 9 ... C-in entry 003 of the identification number table
Set the file name of one image.

Next, the process of step 8 in FIGS. 9 to 11 will be described in detail. FIG. 12 is a flowchart showing the copy processing to the output image index table. Step 1 ... “0” is set as an initial value of x indicating the pixel position in the horizontal direction and y indicating the pixel position in the vertical direction of the image (hereinafter referred to as a converted image) after conversion processing such as rotation, enlargement, and reduction. Set. Step 2 ... The data of the index table address (I _X + W _M × L × y + L × x) of the converted image is converted into the address (P _X + W × L ×) of the index table storage means 2.
y + L × x) and set the identification number. In addition,
Said I _X is, I _A in FIG. 9 to 11, I _B or I _C
Corresponding to the first address of the converted image index table, W _M indicates the number of pixels in the horizontal direction of the converted image, and P _X indicates the index table storage means for copying the converted image index table. The start address in 2 is shown.

Step 3 ... Add 1 to x. Step 4 ... It is judged whether or not x has exceeded W _M, and if it has not exceeded W _M , the process returns to Step 2. Step 5 ... When x exceeds W _M , x is set to “0” and y
Add 1 to. Step 6 ... y it is determined whether or not beyond the vertical number of pixels H _M of the converted image, does not exceed yet, Step 2
Return to.

Next, regarding the processing of step 8 in FIG.
The details will be described. FIG. 13 is a flowchart showing the index table changing process. Step 1 ... The entry number 000 of the identification number table in the index table storage means 2 is changed from the file name of the nth page of the image group A to the file name of the (n + 1) th page. Step 2 ... The entry 001 of the identification number table in the index table storage means 2 is changed from the file name of the nth page of the image group B to the file name of the n + 1th page. Step 3 ... The entry 002 of the identification number table in the index table storage means 2 is changed from the file name of the nth page of the image group C to the file name of the n + 1th page.

Although the identification number of the identification number table is used as the original image identification information of the index table in the above embodiment, the original image such as the file name is identified in the index table without using the identification number table. The information for doing so may be directly written.

[0050]

As described above, according to the image processing apparatus of the present invention, the image editing means is independent of the access method to the original image storage means, the data reading method, the data structure and the image output method. , You can edit the image,
The editing process is simplified. In addition, if the created index table is stored, the next different original image can be processed by simply rewriting the original image specifying information of the index table to the new original image when performing the same editing process as before. It will be possible.

Further, if the data structure conversion means for converting the data structure of the pixel data read by the actual data reading means into the data structure of the output image is provided, the processing can be performed even if the data structures of the original image and the output image are different. It will be possible. Further, by providing index table editing means for performing conversion processing of the output image by rearranging each index of the index table, even if the data structure of the original image is different, the same processing is performed regardless of the data structure of the original image. Expansion,
Conversion processing such as reduction can be performed. Furthermore, 1
When the index table changing means for changing the original image specifying information of the index table for each page is provided, the same type of image data exists for multiple pages as the original image, and the same editing process is performed on the image data of each page. In addition, it is not necessary to convert each image every time an output image of each page is created, and the processing time is shortened.

[Brief description of drawings]

FIG. 1 is a block diagram showing an outline of the configuration of the present invention.

FIG. 2 is a diagram showing an example of an index table and an identification number table.

FIG. 3 is a flowchart showing index table creation processing.

FIG. 4 is a flowchart showing an output image drawing process.

FIG. 5 is an explanatory diagram of a method of obtaining a pixel address of an output image from an index number.

FIG. 6 is a flowchart showing a data structure conversion process.

FIG. 7 is a diagram showing a process of performing a rotation process on an index table to obtain a rotation output image.

FIG. 8 is a flowchart showing an editing process of the third embodiment.

FIG. 9 is a flowchart showing index table creation processing for an enlarged A-1 image.

FIG. 10 is a flowchart showing an index table creation process for a rotated B-1 image.

FIG. 11 is a flowchart showing index table creation processing for a reduced C-1 image.

FIG. 12 is a flowchart showing copy processing to an output image index table.

FIG. 13 is a flowchart showing index table change processing.

FIG. 14 is a block diagram showing an outline of a conventional image processing apparatus.

FIG. 15 is an explanatory diagram of image editing.

FIG. 16 is a flowchart showing an example of image editing processing of a conventional image processing apparatus.

[Explanation of symbols]

1 ... Image editing means, 2 ... Index table storage means, 3 ... Actual data reading means, 4 ... Original image storage means, 4a
... magnetic disk, 4b ... RAM, 4c ... other storage device, 5 ... data structure conversion means, 6 ... output image storage means,
7 ... Index table editing means, 8 ... Index table changing means, 9 ... Image memory

Claims (4)

[Claims] 1. An index table holding original image specifying information for specifying an original image and a pixel position in the original image corresponding to each pixel of the output image, and based on a layout of the output image, An image editing means for creating the index table and an actual data reading means for sequentially reading pixel data from the pixel position of the original image specified corresponding to each pixel of the output image according to the index table are provided. Image processing device. 2. The data structure converting means for converting the data structure of the pixel data read by the actual data reading means into the data structure of the output image.
The image processing device described. 3. The image processing apparatus according to claim 1, further comprising index table editing means for performing conversion processing of an output image by rearranging each index of the index table. 4. When there are a plurality of pages of image data of the same type as the original image and the same editing process is sequentially performed on the image data of each page, the original of the index table is completed every time the process for one page is completed. 4. The image processing apparatus according to claim 1, further comprising index table changing means for changing the image specifying information to that of the next page.