JP3284767B2 - Image processing device - Google Patents

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 for creating a new image by editing and synthesizing a bitmap 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, an 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 unit, 4 is an original image storage unit, 4a is a magnetic disk, 4b is a RAM (random access memory), 4c is another storage device, 6 is an output image storage unit, and 9 is an image memory. is there. The image editing means 1 reads an original image from the magnetic disk 4a, the RAM 4b, or another storage device 4c in the original image storage means 4 and temporarily stores it in the image memory 9.
Thereafter, the output image is stored in the output image storage means 6 after performing processes such as rotation, enlargement, reduction, and composition.

Further, there is a case where there are a plurality of pages of image data having the same image size and resolution, there are a plurality of types, and it is desired to perform a different process for each type and then to synthesize and output. For example, as shown in FIG.
There are three types of image group A, image group B, and image group C. One image (An) of image group A is enlarged, and one image (B-n) of image group B is rightward. In this case, one image (C-n) in the image group C is reduced, and the combined image is output as shown in FIG.

Conventionally, in such a case, processing has been performed as follows. FIG. 16 is a flowchart illustrating an example of an image editing process of a conventional image processing apparatus. Step 1: Set 1 as an initial value of a value n for designating a page of an original image. Step 2... The image of the nth page of the image group A is taken out from the original image storage means 4 and stored in the image memory 9, and then the enlargement processing is performed. Step 3... The image of the n-th 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 a rotation process is performed. Step 4: The image of the n-th 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 a reduction process is performed. Step 5: The images processed in steps 2 to 4 are combined to create an n-th page output image. Step 6: Add 1 to n. Step 7... It is determined whether or not n has exceeded the predetermined page number N. If not, the process returns to Step 2 and repeats the same processing.

In a conventional image processing apparatus, processing is performed in this manner. As a conventional document related to such an image processing apparatus, for example, Japanese Patent Application Laid-Open No. 2-298
No. 76, JP-A-63-147225, JP-A-63-46064, JP-A-62-226380, JP-A-63-61379, and the like.

[0007]

[Problems to be solved by the invention]

(Problems) However, the above-described conventional technology 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, which complicates the processing of the image editing means 1. is there. The second problem is that, as an original image, there are a plurality of pages of the same type of image data, and there are a plurality of types of image data.
In the case of performing composite processing and outputting after performing different processing for each type, it is necessary to perform conversion processing of each image every time an output image of each page is created, which requires a long processing time. Is a point.

(Explanation of Problems) First, the first problem will be described. The original image storage means 4 has a magnetic disk 4
There are various storage devices such as a, RAM 4b, and other storage devices 4c, which have different access methods and data read methods. Also, the original image itself has various data structures (one for expressing colors, densities, etc.).
(The number of bits per pixel), and the data readout unit differs depending on the data structure. Therefore, the image editing means 1
When reading and editing and synthesizing an original image from a different storage means, it is necessary to read the original image while changing the access method and the reading method one by one and taking the data structure of the original image into consideration. Furthermore, editing processing such as conversion / synthesis of the read image data needs to be changed according to the data structure of the original image or to be converted to the same data structure once before processing. Therefore, the processing of the image editing means 1 becomes very complicated.

Next, the second problem will be described. FIG.
As shown in FIG. 5, as the original image, there are a plurality of pages of the same type of image data, there are a plurality of types, and each page is subjected to different processing for each type, and then combined and output. In such a case, step 2 in FIG.
As shown in FIG. 4, every time an output image of each page is created, conversion processing 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 an image processing apparatus according to the present invention, original image specifying information for specifying an original image and information in the original image corresponding to each pixel of an output image are provided. An index table that holds the pixel positions of the images, an image editing unit that creates the index table based on the layout of the output image, and an original image specified according to each pixel of the output image according to the index table. And real data reading means for sequentially reading pixel data from the pixel position. Further, a data structure converting means for converting a data structure of the pixel data read by the actual data reading means into a data structure of an output image is provided. Further, an index table editing means for converting the output image by rearranging the respective indexes of the index table is provided. Furthermore, when the same kind of image data is present for a plurality of pages as the original image, and the same edit processing is sequentially performed on the image data of each page, the original image identification of the index table is completed each time the processing for one page is completed. An index table changing means for changing the information to the next page is provided.

[0011]

The image editing means includes, based on a predetermined layout of the output image, corresponding to each pixel of the output image, original image specifying information for specifying the original image and a pixel position in the original image. The image is edited by creating an index table that holds. 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 irrespective of the method of accessing the original image storage means, the method of reading data, the data structure, the method of outputting the image, and the like, thereby simplifying the processing.

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 when the data structures of the original image and the output image are different, processing can be performed.

The index table editing means converts the output image by rearranging the indexes of the index table. for that reason,
Even if the data structure of the original image is different, the conversion processing such as rotation, enlargement, and reduction can be performed by the same processing regardless of the data structure.

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

[0015]

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

After deciding the layout of which original image and how to arrange the output image, the image editing means 1 stores the index table and the identification number table as shown in FIG. It is created in the index table storage means 2 and instructs the actual data reading means 3 to draw an output image. The identification number table is
.., Holding data for specifying a file or a memory area corresponding to each of the identification numbers “000”, “001”,.
The index table stores the identification number “00” as information for identifying the original image in association with each pixel of the output image.
0 "," 001 ",... And the relative addresses therein.

The original image storage means 4 includes a magnetic disk 4a for storing an original image for forming an output image, and a RAM.
4b and another storage device 4c. The actual data reading means 3 sequentially reads the pixel data of the original image specified by the index from the original image storage means 4 and passes it to the data structure conversion means 5. And 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 the data structure to the address of the output pixel. The index table editing means 7 performs image conversion processing such as rotation, enlargement, and reduction by editing the index table in the index table storage means 2. The index table changing means 8 changes information for specifying the original image of the index table in the index table storage means 2.

Next, a process of creating an index table by the image editing means 1 will be described. FIG.
It is a flowchart which shows an index table creation process. Step 1: Decide which original images are to be used as components of the output image and how to lay them out. Based on these, first, the original numbers such as the file names of the original images are stored in the identification number table. Stores image information. Step 2: "0" is set as the initial value of the number n for designating the pixels of the output image. Step 3: It is determined whether or not n is equal to or less than the total number of pixels of the output image. Step 4: If the number of pixels is equal to or less than 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 obtained. Step 5: A corresponding identification number is obtained from the identification number table. Step 6: The identification number and the relative address of the original image (the pixel position in the original image) are stored in the index table. Step 7: Add 1 to n.

Next, a process of drawing an 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: "0" is set as an initial value of a number n for specifying a pixel of the output image. Step 2: It is determined whether or not n is equal to or less than the total number of indexes in the index table.

Step 3: If the number is equal to or less than the total number of indexes, the identification number and the relative address of the n-th index are obtained. Step 4: Acquire data such as the file name of the original image corresponding to the acquired identification number from the identification number table. Step 5: The starting address I of the original image required for actual access is obtained from the acquired file name and the like. 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 obtained.

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

Step 9: The address of the output pixel is calculated. Assuming that the index Y is n, the index number is n, the number of bits per pixel of the output image is b, and the offset (head address) of the output image is J, Y = J + n × b (2) 5). Step 10: The 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 it is not necessary to convert the data structure, the data structure may be directly transferred to a predetermined address of the output image storage means 6 without transferring to the data structure conversion means 5.

Next, the process of converting the data structure in the data structure conversion means 5 will be described. FIG. 6 is a flowchart showing the data structure conversion processing. Step 1: Acquire pixel data together with the data structure and output pixel address transferred from the actual data reading means 3. Step 2: Acquire 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 not identical, convert the data structure. Step 5: Data is transferred to the output pixel address.

Here, the conversion of the data structure in step 4 will be described. For example, if the data structure of the original image is 1
If the data structure of the output image is 1 bit per pixel and the red, green, and blue components are 8 bits each, each pixel having 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 the 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.

Conversely, the data structure of the original image is one pixel, the red, green, and blue components are eight bits each, that is, a total of 24 bits, and the data structure of the output image is one 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, each of r, g and b is 1 (1 bit) / 2
After multiplying by 56 (8 bits), the average value is calculated. 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 equal to or more than the predetermined value.
For example, output pixel data of 0.5 or more is set to “1”.

The data structure of the original image is 12 bits per pixel, and the red, green and blue components are 4 bits each, for a total of 12 bits. The data structure of the output image is red, green and blue per pixel. Is 8 bits each, for a total of 24 bits, as follows. That is, if the values of the red, green, and blue components of the pixel data of the original image are r, g, and b, respectively, the values R, G, and B of the red, green, and blue components of the output pixel data are r and g. , B are multiplied by 256 (8 bits) / 16 (4 bits), respectively, so that R = r × (256/16) G = g × (256/16) B = b × (256/16)

(When a conversion process is performed on an output image)
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 illustrating a process of performing a rotation process on an index table to obtain a rotation output image. Here, three original images (a) and (b) shown in FIG.
FIG. 7B shows a case in which a rotated composite image as shown in FIG. 7F is obtained from FIGS. .. In each original image indicate each pixel.

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

Next, an area having the same size as the index table of FIG. 7D is secured, and the index table of FIG. 7D is subjected to a rotation process, as shown in FIG. Create an index table. The rotation process differs depending on the rotation angle. However, as shown in FIG. 7, when the image is rotated to the left by 90 °, the data of the index number 3 in the table of FIG. Is moved to the index of index number 0. Similarly, the process is performed by moving the data of index number 7 to the index of index number 1 and moving the data of index number 11 to the index of index number 2 repeatedly.

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. According to the present invention, a rotated output image obtained by combining a plurality of original images can be obtained in this manner.

When obtaining an enlarged output image, the index table editing means 7 creates an enlarged index table by overlapping the indexes of the index table at a predetermined ratio. Also, when obtaining a reduced output image,
The index table editing means 7 creates an index table which has been reduced by thinning out the indexes of the index table at a predetermined ratio.

The conversion processes such as rotation, enlargement, and reduction are performed only on the rearrangement of the index table, and are not performed on the original image itself. Can be done.

(Case where the present invention is applied to image editing in FIG. 15) Next, when image editing as shown in FIG. 15 is performed, that is, when 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 after performing different processing for each type, combining and outputting. The process in such a case is performed while the index table changing means 8 rewrites the data (for example, the file name in the identification number table) for specifying the original image in the index table.

FIG. 8 is a flowchart showing an editing process when the present invention is applied to the image editing of FIG. Step 1: Create an index table of an image (hereinafter, referred to as “enlarged A-1 image”) obtained by enlarging the image of the first page of image group A (hereinafter, referred to as “A-1 image”) by image editing means 1 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 (FIG. 9). Step 2: The image of the first page of the image group B (hereinafter, referred to as “B-1 image”) is moved to the right by the image editing unit 90.
An index table of the rotated image (hereinafter referred to as “rotated B-1 image”) is created, and is copied to a predetermined position of the output image index table in the index table storage unit 2. The details of this process will be described later (FIG. 10). Step 3: The image editing means 1 creates an index table of an image (hereinafter, referred to as "reduced C-1 image") obtained by reducing the image of the first page of the image group C (hereinafter, referred to as "C-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. 1).
1).

Step 4: 1 is set as an initial value of n indicating the number of pages. Step 5: The actual image is read out from the original image storage unit 4 by the actual data reading unit 3 in accordance with the output image index table, and is written to the output image storage unit 6 via the data structure conversion unit 5, thereby outputting 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 it does not exceed, the index table changing means 8 stores the file name of the identification number table in the index table storage means 2 into each of the image groups 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.
This will be described in detail. FIG. 9 is a flowchart showing the process of creating an index table for an enlarged A-1 image. Step 1: An area for creating an index table of the enlarged A-1 image is stored in the index table storage means 2.
Secure separately. Assuming that the size S is W _A , the number of pixels in the vertical direction of the image group A 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" is set as an initial value of x indicating the horizontal pixel position of the enlarged A-1 image and y indicating the vertical pixel position of the enlarged A-1 image.
Is 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),
Address of the index table of the enlarged A-1 image (I
_A + W _A × L × y + L × x). Incidentally, L _P is the data length of one pixel of the expanded A-1 image, the I _A enlarged A-1
This is the start address of the index table of the image. Step 4: Add 1 to x. Step 5: x is the number of pixels W _{A in} the horizontal direction of the enlarged A-1 image
× to determine whether exceeds N _A, does not exceed yet, the flow returns to step 3. Step 6: If x exceeds W _A × N _A , set x to “0” and add 1 to y. Step 7: y is the number of pixels _{HA in} the vertical direction of the enlarged A-1 image
× to determine whether exceeds N _A, does not exceed yet, the flow returns to step 3.

Step 8: If y exceeds H _A × N _A ,
The index table of the enlarged A-1 image created in steps 1 to 7 is copied to a predetermined position of the output image index table in the index table storage means 2 with the identification number being “000”. The details of this process will be described later (FIG. 12). Step 9: A- is entered 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.
This will be described in detail. FIG. 10 is a flowchart showing a process of creating an index table for a rotated B-1 image. Step 1: An area for creating an index table of the rotated B-1 image is stored in the index table storage means 2.
Secure separately. Assuming that the number of pixels in the horizontal direction of the image group B is W _B , the number of pixels in the vertical direction is H _B , and the length of one index is L, the size S is S = W _B × H _B × L. Step 2: x indicating the horizontal pixel position of the B-1 image
Then, "0" is set as an initial value of y indicating the pixel position in the vertical direction.

Step 3: B-1 Relative address from the head of the target pixel of the image data, that is, (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 × x). Note that one between L _P rotation B-1 image
The data length of a pixel, I _B is the head address of the index table of the rotary B-1 images. Step 4: Add 1 to x. Step 5 ... x it is determined whether or not beyond the W _B, if not exceeded yet, the flow returns to step 3. Step 6 ... x is more than W _B, the x and to "0", y
Add 1 to. Step 7 ... y it is determined whether or not exceeded H _B, if not exceeded yet, the flow returns to step 3.

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

Next, regarding the processing of step 3 in FIG.
This will be described in detail. FIG. 11 is a flowchart illustrating a process of creating an index table of a reduced C-1 image. Step 1: An area for creating an index table of the reduced C-1 image is stored in the index table storage means 2.
Secure separately. Assuming that the size S 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 ,
S = W _C × H _C × L × N _C ² Step 2: "0" is set as an initial value of x indicating the horizontal pixel position of the reduced C-1 image and y indicating the vertical pixel position of the reduced C-1 image.
Is set.

Step 3... Relative addresses of the target pixel data indicated by x and 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 Incidentally, the L _P 1 pixel data length of the reduced C-1 image, I _C is the head address of the index table of the reduced C-1 images. 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
× to determine whether exceeds N _C, does not exceed yet, the flow returns to step 3. Step 6: If x exceeds W _C × N _C , set x to “0” and add 1 to y. Step 7: y is the number of pixels H _{C in} the vertical direction of the reduced C-1 image
× to determine whether exceeds N _C, does not exceed yet, the flow returns to step 3.

Step 8: If 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 being “003”. The details of this process will be described later (FIG. 12). Step 9: C- is added to the entry 003 of the identification number table.
Set the file name of one image.

Next, the processing of step 8 in FIGS. 9 to 11 will be described in detail. FIG. 12 is a flowchart showing a copy process to the output image index table. Step 1: Initial values of x indicating a horizontal pixel position and y indicating a vertical pixel position of an image (hereinafter, referred to as a converted image) after performing conversion processing such as rotation, enlargement, and reduction are set to “0” as initial values. Is set. Step 2 ... data of the index table of the address of the transformed image _{(I X + W M × L} × y + L × x), the address index table storage device _{2 (P X + W × L} ×
y + L × x) and set an identification number. In addition,
Said I _X is, I _A in FIG. 9 to 11, I _B or I _C
Those corresponding to, indicates the start address of the index table of the converted image, W _M denotes the number of pixels in the horizontal direction of the converted image, P _X is to be copied to the index table of the converted image, the index table storage device 2 shows the start address.

Step 3... 1 is added to x. Step 4 ... x it is determined whether or not beyond the W _M, does not exceed yet, return to step 2. Step 5: If x exceeds W _M , set x 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.
This will be described in detail. FIG. 13 is a flowchart showing the index table change processing. Step 1: Change the entry 000 of the identification number table in the index table storage means 2 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: Change the entry 001 of the identification number table in the index table storage means 2 from the file name of the nth page of the image group B to the file name of the (n + 1) th page. Step 3: Change the entry 002 of the identification number table in the index table storage means 2 from the file name of the nth page of the image group C to the file name of the (n + 1) th page.

In the above embodiment, the identification number of the identification number table is used as the original image identification information of the index table. However, the original image such as the file name is specified in the index table without using the identification number table. 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 method of accessing the original image storage means, the method of reading data, the data structure, and the method of outputting images. , You can edit the image,
The editing process is simplified. Also, if the created index table is stored, the next time the same editing processing is performed on a different original image, the original image specifying information in the index table is simply rewritten with that of the new original image. Will be possible.

Further, if a data structure converting means for converting the data structure of the pixel data read by the actual data reading means to the data structure of the output image is provided, even if the data structures of the original image and the output image are different, the processing can be performed. Will be possible. Further, if an index table editing means for converting the output image by rearranging the respective indexes of the index table is provided, even if the data structure of the original image is different, the rotation and rotation are performed by the same process regardless of the data structure. Enlargement,
Conversion processing such as reduction can be performed. Furthermore, 1
If there is provided an index table changing means for changing the original image specifying information of the index table for each page, when the same type of image data is present for a plurality of pages as the original image, the same editing process is performed on the image data of each page In addition, there is no need to perform a conversion process for each image each time an output image for each page is created, and the processing time is shortened.

[Brief description of the drawings]

FIG. 1 is a block diagram showing an outline of a 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 an index table creation process.

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 data structure conversion processing;

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 illustrating editing processing according to a third embodiment.

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

FIG. 10 is a flowchart illustrating a process of creating an index table of a rotated B-1 image;

FIG. 11 is a flowchart showing a process of creating an index table of a reduced C-1 image;

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

FIG. 13 is a flowchart showing an index table change process;

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

FIG. 15 is an explanatory diagram of image editing.

And FIG. 16 is a flowchart illustrating an example of an image editing process performed by a conventional image processing apparatus.

[Explanation of symbols]

DESCRIPTION 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 devices, 5 ... data structure conversion means, 6 ... output image storage means,
7 ... Index table editing means, 8 ... Index table changing means, 9 ... Image memory

────────────────────────────────────────────────── ─── Continuation of the front page (56) References JP-A-6-103372 (JP, A) JP-A-63-280383 (JP, A) (58) Fields investigated (Int. Cl. ⁷ , DB name) G06T 1/00 G06T 3/00 CSDB (Japan Patent Office)

Claims (4)

(57) [Claims] 1. An index table for storing 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 a layout of the output image. Image editing means for creating the index table; and 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. Image processing apparatus. 2. A data structure conversion means for converting a data structure of pixel data read by said real data reading means into a data structure of an output image.
The image processing apparatus according to any one of the preceding claims. 3. The image processing apparatus according to claim 1, further comprising an index table editing unit that performs a conversion process of an output image by rearranging each index of the index table. 4. When there are a plurality of pages of the same type of image data as an original image and the same edit processing is sequentially performed on the image data of each page, each time the processing of one page is completed, the original data of the index table is deleted. 4. The image processing apparatus according to claim 1, further comprising an index table changing unit for changing the image specifying information to that of the next page.