JP2000149006A - Medium in which image processing program is recorded, image processor and image processing method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To reduce data quantity and expense for processing resources by instructing only a part to be utilized, when an image from among divided objects is treated. SOLUTION: S-areas (a) to (c) are requested to make them utilizable from a processed image management object to a divided image management object so as to make corresponding S-Units (a) to (i) are made utilizable. Each piece of divided object data is inputted in the divided image management object via a function management object, substance is stored in a spool file while managing information as an area and in addition, the informed image area S-Area is developed on a memory, so as to be utilized from other object by the divided image management object. An emphasis processing is executed by an emphasis processing object, and a magnification processing is executed by a magnification processing object, after all the S-Units (a) to (i) containing the image area S-Areas are developed on the memory by the divided image management object.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a medium recording an image processing program, an image processing apparatus and an image processing method, and more particularly, to a case where page data is divided and the divided data are arranged in random order. The present invention relates to a medium recording an appropriate image processing program, an image processing device, and an image processing method.

[0002]

2. Description of the Related Art In a computer or the like, an image is represented as image data composed of pixels arranged in a dot matrix, and predetermined image processing is executed on the image data. On the other hand, in recent years, a technique of appropriately arranging object images in a virtual dot matrix area to represent one image has been used. That is, an object image representing only a character or an object image representing an image is individually prepared, and the images are completed by overlapping in a predetermined order.

[0003]

In the above-described conventional apparatus, when an object image is prepared individually and an image superimposed in a predetermined order is handled, one object image is divided into a plurality of pieces for convenience of computer processing. Often do. For example, as the size of the object image increases, the amount of data becomes extremely large, and there is a problem that the processing resources are burdened to perform the processing in an integrated manner.

SUMMARY OF THE INVENTION The present invention has been made in view of the above-mentioned problems, and it is possible to reduce a data amount by designating only a portion to be used when handling an image among divided object images. It is an object of the present invention to provide a medium, an image processing apparatus, and an image processing method in which an image processing program capable of reducing the burden on resources is recorded.

[0005]

In order to achieve the above object, according to the present invention, page data is divided, and the divided data is subjected to predetermined image processing from original image data arranged in random order. Select the required split data,
A medium storing a computer-readable image processing program for executing the same image processing on a predetermined processing area of the selected divided data, the processing area performing a predetermined image processing from the original image data A divided data selecting step of selecting divided data including: a selected divided data instruction step of instructing the divided data selected in the divided data selecting step to be in an accessible state in all the divided data; An image processing execution step of executing image processing on a predetermined processing area of the divided data designated in the divided data designation step.

In the invention according to claim 1 configured as described above, the medium on which the image processing program is recorded is:
The page data to be subjected to the image processing is divided and arranged in random order, and the divided data required for the predetermined image processing is selected from the original image data stored in the predetermined storage area. When performing image processing on the processing area, the selected divided data can be accessed at high speed. Specifically, the divided data selecting step selects divided data including a processing area for performing predetermined image processing from the original image data. Then, the selected divided data instructing step instructs the divided data selected in the divided data selecting step to an accessible state by limiting the divided data from all the divided data. When performing image processing on the divided data designated in this way,
The image processing execution step executes image processing on a predetermined processing area of the divided data. That is, the frequently used divided data selected in the divided data selecting step is limited and instructed in the selected divided data instructing step to make it available. Then, the image processing execution step executes image processing on a predetermined processing area of the designated divided data. Therefore, unnecessary divided data is not processed, and a reduction in processing speed or the like can be prevented.

[0007] The above-mentioned original image data may constitute the entire image or may comprise object images included in the image. The data format of the original image data may be bitmap data formed by pixels in a dot matrix,
The figure or the like being drawn may be vector data described by a predetermined drawing command, or may be changed as appropriate. Here, the processing area management module forms a processing area means, for example, that the original image data is for an object image included in the image and is formed by being randomly divided, The purpose is to search for a specific continuous area to be subjected to image processing by the image processing module from the divided data and form the area while connecting the areas. Of course, when the image is not divided at random, a necessary area is divided from a predetermined position to form a processing area. In the divided data selection step, it is sufficient that the divided data including the processing area for performing the predetermined image processing can be selected from the original image data, and the divided data corresponding to the processing area is searched for and extracted from the original image data. Then select it. In the selected divided data instructing step, it suffices if the selected divided data can be instructed to be accessible with limitation.
The entity of the selected divided data may be limited and held in a predetermined area to indicate that the data can be used, and access from the image processing execution step may be enabled, or the limited divided data may be indirectly specified and used. It may be. When the designated divided data can be used, for example, the entity of the corresponding divided data may be developed in a memory and used. The image processing execution step only needs to be able to execute predetermined image processing on the processing area of the designated divided data, and the content of the image processing is not particularly limited. For example, there are emphasis processing, enlargement processing, and color tone processing. Of course, each process may be performed in plural by changing parameters used for emphasis, parameters used for enlargement, and the like. Further, it is sufficient that image processing can be performed on a predetermined processing area of the selected divided data, and image processing may be performed on the entire divided data selected as the processing area, or the selected divided data may be processed. Image processing may be performed by extracting a predetermined processing area from the divided data.

Here, the recording medium may be a magnetic recording medium, a magneto-optical recording medium, or any recording medium to be developed in the future. Also, the duplication stages of the primary duplicated product, the secondary duplicated product, and the like are equivalent without any question. In addition, the present invention is not limited to the case where the present invention is used even when the supply is performed using a communication line. further,
The concept of the present invention is not completely different even when part is software and part is realized by hardware, and part is stored on a recording medium and read as needed as needed. Such a form may be adopted.

According to a second aspect of the present invention, as a specific example of designating the divided data selected in the divided data selecting step in the selected divided data designating step, a medium in which the image processing program according to the first aspect is recorded is provided. In the above, the selected divided data designating step is configured to indirectly designate the selected divided data based on position information in the original image data. In the invention according to claim 2 configured as described above, the selected divided data instructing step indirectly designates the selected divided data by position information in the original image data. That is, the selected divided data instruction step acquires position information of the selected divided data in the original image data arranged in any order.
Then, this position information is indicated to enable the use of the divided data. In the image processing execution step, image processing is performed on a predetermined processing area of the divided data that has been designated and made available. Therefore, each time the image processing is executed, it is not necessary to search and instruct the divided data required for the image processing for the entire divided data arranged in random order in the original image data, so that the processing is speeded up. be able to.

[0010] As another specific example of designating the divided data selected in the divided data selection step in the selected divided data designating step, the invention according to claim 3 implements the image processing program according to claim 1. In the recorded medium, the selected divided data instructing step assigns a predetermined identifier to each of the divided data in any order, forms an identifier table based on the identifier of the selected divided data, and stores the selected divided data in the same order. The configuration is such that an instruction is made indirectly by an identifier table. In the invention according to claim 3 configured as described above, the selected divided data instructing step assigns a predetermined identifier to each of the divided data in any order and forms an identifier table based on the identifier of the selected divided data. Then, the selected divided data is indirectly designated by the same identifier table and made available. That is, the selected divided data indicating step includes:
When indicating the selected divided data in the divided data selection step, an identifier is assigned to each of the divided data arranged in any order,
For example, an ID number is assigned, an ID number corresponding to the selected divided data is taken out, and an identifier table is formed. The divided data selected in this way is indirectly designated and made available. The image processing execution step executes image processing on a predetermined processing area of the designated divided data. Therefore, each time the image processing is executed, it is not necessary to search and instruct the divided data required for the image processing for the entire divided data arranged in random order in the original image data, so that the processing is speeded up. be able to.

According to a fourth aspect of the present invention, there is provided a computer-readable storage medium storing the image processing program according to the first aspect of the present invention, as still another specific example of designating the divided data selected in the divided data selecting step in the selected divided data specifying step. In the medium on which the divided data is selected, the divided data selection step transfers the divided data selected in the divided data selection step to a storage area that can be accessed relatively faster than the storage area in which the original image data is stored. The instruction is given as follows. In the invention according to claim 4 configured as described above, the selected divided data instructing step allows the divided data selected in the divided data selecting step to access the divided data selected in the divided data selecting step relatively faster than the storage area in which the original image data is stored. Transfer to a possible storage area to instruct and make available. For example, when the original image data is stored in the hard disk, the selected divided data instructing step transfers the selected divided data to the main memory for storage, or transfers the selected divided data to the cache memory for storage. Therefore, in the image processing execution step, the image processing is executed using a predetermined processing area of the divided data stored in the main memory or the cache memory which can be accessed relatively faster than the hard disk. Therefore, each time the image processing is executed, it is not necessary to search and instruct the divided data required for the image processing for the entire divided data arranged in random order in the original image data, so that the processing is speeded up. be able to. When the divided data to be processed can be used in the image processing execution step, not only the original image area to be processed but also other areas may be referred to in the image processing.
Therefore, the invention according to claim 5 is based on claims 1 to 4
In the medium storing the image processing program according to any one of the above, the divided data selecting step is configured to select divided data including a processing area obtained by adding a peripheral area referred to in image processing to the processing area. In the invention according to claim 5 configured as described above, the divided data selecting step selects divided data including a processing area obtained by adding a peripheral area to be referred to in image processing to the processing area. That is, in this image processing program,
A plurality of divided data are generated to represent the original image data, and are arranged in any order. Then, divided data corresponding to a predetermined processing area is selected from the original image data, and predetermined image processing is performed. In such a case, if the divided data of the image area to be processed is made available in the image processing execution step for the sake of processing, not only the original image area to be processed but also the peripheral area referred to in the image processing is added. .

By the way, the idea of the invention is not limited to a recording medium, but includes various aspects, such that a medium recording such an image processing program is sometimes used in a state of being incorporated in a certain device. . Therefore, it can be changed as appropriate, such as software or hardware. Then, as an embodiment of the idea of the present invention, page data is divided, the divided data is selected from among the original image data arranged in random order, and the divided data required for predetermined image processing is selected. On the other hand, it can be said that an image processing apparatus that executes the same image processing naturally exists and is used. As an example,
According to a sixth aspect of the present invention, the page data is divided, the divided data is selected from the original image data arranged in any order, and the divided data required for the predetermined image processing is selected, and the predetermined processing of the selected divided data is performed. An image processing apparatus that performs the same image processing on an area, wherein the divided data selecting unit selects a divided data including a processing area for performing a predetermined image processing from the original image data, and A selected divided data instructing means for limiting the divided data selected by the divided data selecting means to an accessible state and making it available, and a predetermined processing area of the divided data made available by the selected divided data instructing means. On the other hand, the image processing apparatus is provided with image processing execution means for executing image processing. That is, the present invention is not necessarily limited to being embodied and provided in a medium in which the image processing program is recorded, and there is no difference that providing as an image processing apparatus is effective.

In this manner, the page data is divided, and the divided data required for the predetermined image processing is selected from the original image data in which the divided data is arranged in any order, and the predetermined processing area of the selected divided data is selected. However, the method of executing the same image processing need not necessarily be limited to a substantial device, and it can be easily understood that the method also functions as the method. Therefore, according to the invention according to claim 7, the page data is divided and the divided data is selected from among the original image data arranged in random order, the divided data required for predetermined image processing, and the divided data of the selected divided data is selected. An image processing method for performing the same image processing on a predetermined processing area, comprising: a division data selection step of selecting division data including a processing area for performing the predetermined image processing from the original image data; A divided data selection step in which the divided data selected in the divided data selection step is limited and instructed to be accessible and used, and a division made available in the selected divided data specifying step And an image processing execution step of executing image processing on a predetermined processing area of the data. That is, there is no difference that the present invention is not necessarily limited to a substantial image processing apparatus but is also effective as an image processing method.

[0014]

As described above, the present invention reduces the amount of data to be processed by designating only a used part when handling as image processing from among divided data arranged in a random order. Be able to
It is possible to provide a medium in which an image processing program capable of reducing a load on processing resources is recorded. Also,
According to the second aspect of the present invention, the selected divided data is indirectly instructed based on the position information of the divided data in the original image data, so that the processing speed can be increased. Further, according to the invention according to claim 3,
Since the selected divided data is indirectly instructed based on the identifier assigned to the divided data, the processing can be speeded up. Further, according to the invention of claim 4, the selected divided data is transferred to a storage area that can be accessed at high speed. Therefore, it is sufficient to access this storage area thereafter, and the processing speed is increased. Becomes possible. Further, according to the fifth aspect of the present invention, since a peripheral area to be referred to can be added to the divided data to be processed, more detailed image processing can be realized. Further, according to the present invention, when handling as image processing from among the divided data that has been divided and arranged in no particular order, it is possible to reduce the amount of data to be processed by designating only the used part. And an image processing apparatus capable of reducing the load on processing resources. Further, according to the invention according to claim 7, when handling as image processing from among the divided data that has been divided and arranged in random order, only the used portion is specified, thereby reducing the amount of data to be processed. And an image processing method capable of reducing the load on processing resources.

[0015]

Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 is a block diagram showing a computer system 10 as an example of hardware for realizing an image processing system to which an image processing program according to an embodiment of the present invention is applied. The computer system 10 includes a scanner 11a, a digital still camera 11b, and a video camera 11c as image input devices for directly inputting image data, and is connected to a computer main body 12. Each input device is capable of generating image data representing an image by dot matrix pixels and outputting the image data to the computer main unit 12. Here, the image data is displayed in 256 gradations in three primary colors of RGB. , About 167
It is possible to express 10,000 colors.

The computer main body 12 is connected to a floppy disk drive 13a, a hard disk 13b, and a CD-ROM drive 13c as external auxiliary storage devices, and the hard disk 13b stores main system-related programs. Necessary programs and the like can be read from a floppy disk or a CD-ROM as needed. The computer body 1
A modem 14a is connected as a communication device for connecting the 2 to an external network or the like. The modem 14a is connected to the external network via the same public communication line, and software and data can be downloaded and introduced.
In this example, the modem 14a accesses the outside via a telephone line. However, a configuration in which a network is accessed via a LAN adapter is also possible.

Here, among the external auxiliary storage devices, the floppy disk drive 13a and the CD-ROM drive 1
Regarding 3c, the recording medium itself can be exchanged, and when supplied in a state where image data is recorded on this recording medium, it can also be a means of an image input device. Further, when accessing a network via the modem 14a or a LAN adapter, image data may be supplied from the network, and in such a case, the image data can be used as a means of an image input device. In addition, a keyboard 15a and a mouse 15b as a pointing device are connected to operate the computer main body 12, and a speaker 18a and a microphone 18b are used for multimedia.
It has. On the other hand, a display 17a and a color printer 17b are provided as image output devices.
The display 17a has a display area of 800 pixels in the horizontal direction and 600 pixels in the vertical direction, and can display the above-mentioned 16.7 million colors for each pixel. Of course, this resolution is only an example, 640 × 48
0 pixels or 1024 x 768 pixels
It can be changed as appropriate.

A color printer 1 as a printing device
Reference numeral 7b denotes an ink-jet printer which can print an image by adding dots to printing paper as a recording medium using four color inks of CMYK. Image density is 360
High-density printing such as × 360 dpi or 720 × 720 dpi is possible, but the gradation table has a two-gradation expression such as whether or not to apply color ink. The color ink is not limited to the four color inks, and it is also possible to reduce the conspicuousness of dots by using six colors including light cyan and light magenta, which are not limited to the ink jet method. It is also possible to adopt an electrophotographic method or the like. The computer main body 1 is used for displaying or outputting to an image output device while inputting an image using such an image input device.
2, a predetermined program is executed. Of these, an operating system (OS) 12a is operating as a basic program, and the operating system 12a has a display driver (DSPDRV) for displaying on the display 17a.
A printer driver (PRT DRV) 12c that causes the printer 12b and the color printer 17b to perform print output is incorporated. These drivers 12b and 12c depend on the models of the display 17a and the color printer 17b, and can be additionally changed to the operating system 12a according to each model. Further, depending on the model, additional functions beyond the standard processing can be realized. That is, it is possible to realize various additional processes within an allowable range while maintaining a common processing system on the standard system of the operating system 12a.

The application 12d is executed on the operating system 12a as the basic program. The processing contents of the application 12d are various, and include a keyboard 15a and a mouse 1 as operation devices.
5b is monitored, and when it is operated, various external devices are appropriately controlled to execute corresponding arithmetic processing and the like. Further, the processing result is displayed on the display 17a,
For example, the data is output to the color printer 17b. In such a computer system 10, image data can be acquired by reading a photograph or the like with a scanner 11a or the like, which is an image input device, and image data photographed by a digital still camera 11b or photographed by a video camera 11c can be acquired. Image data as a moving image can be obtained. Such image data is finally displayed on the display 17a as an image output device or printed by the color printer 17b. However, there are many problems such as poor image quality if the original image data is not used. In such cases, some modifications are made. This correction is generally performed by an application 12d such as photo retouching. However, in the present image processing system, the printer driver 12c performs the same processing on the object data output when the application 12d executes the printing process. Execute the correction process.

During the printing process, the application 12d outputs object data to the operating system 12a. FIG. 2 shows a change in the processing unit of a print image. I.
Are divided object data a (1) to a for convenience of processing.
(N), and is output as raster data b (1) to b (n) that can be processed by the color printer 17b through the processing of the printer driver 12c. FIG. 3 shows a schematic configuration of the system in a state where the printer driver 12c is incorporated in the operating system 12a. The function management object P1 provided by the printer driver 12c is accessed from the API layer. P1 acquires a processed image by the processed image management object P3 while managing the divided object data by the divided image management object P2. When acquiring this processed image, the function management object P1
A required area is requested for the divided object data, and a divided image registration process is executed in advance on the divided object data as a premise of the process. That is, in order for the processed image management object P3 to notify the divided image management object P2 of the image area to be processed via the enlargement processing object P4 and the enhancement processing object P5 for executing the actual image processing, the divided image management object P3 In P2, only necessary ones of the already registered divided object data are expanded on the memory to be usable, and the expanded processing object P5 and the enlarged processing object P4 execute image processing using the expanded result. Will do.

FIG. 4 shows input divided object data and acquired processed images. In the figure,
When the original image is called a source image and the image on which the enlargement processing and the enhancement processing are performed is called a destination image, the input divided object data is divided into nine S-Units. . a to i. Here, the destination image can be processed as one, but in this case as well, it is assumed that the destination image is divided and processed, and each divided image is referred to as D-Unit. Call them AC. D-Unit. AC
It is necessary that the image area before processing is available to obtain the image data, but what is input is S-Unit. a
To i, and it is not known whether all are available. Therefore, the corresponding S-U from the processed image management object P3 to the divided image management object P2
nit. a-i are requested to be made available, and the S-Area. a to c. However, this S-Area. a to c are D-Unit. It does not coincide with A to C but includes the peripheral region. The reason why the peripheral area is included is that the image cannot be processed only by the processing target pixel when performing the image processing by the enlargement processing object P4 and the enhancement processing object P5, and the surrounding pixels must be referred to. is there.

Next, FIG. 5 and FIG. 6 show the peripheral area referred to in each image processing. Although specific processing contents are not described in detail, in the enhancement processing shown in FIG. 5, it is necessary to refer to one pixel upward and left and two pixels right and downward with respect to the target pixel. In addition, in the enlargement processing shown in FIG. 6, it is necessary to refer to one pixel rightward and leftward and downward, and two pixels upward, based on the target pixel. As a specific example of a calculation that needs to refer to the peripheral region, a filtering process is given. Applying to the example of the enhancement process and the enlargement process in this case, a filter for 4 × 4 pixels is used in the enhancement process, and a filter for 3 × 4 pixels is used in the enlargement process.
It can be said that a peripheral area is required. FIG. 7 shows a process in which a required area is notified from the processed image management object P3 to the divided image management object P2. In the figure,
When the finally acquired area of the processed image is requested to the processed image management object P3 as the first required area S-Area ', the processed image management object P3 notifies the enlarged processing object P4 of the request. Then, in the enlargement processing object P4, when its own enlargement magnification is 2 times, the image area which is the source of the necessary area S-Area 'is 1/2 times. However, the pixel to refer to is above,
The emphasis processing object P5 is notified that the right, lower, and left pixels are 1, 2, 2, and 1 pixels, respectively. Since the enhancement processing object P5 does not perform enlargement, what is originally required is an image area required for the enlargement processing object P4.
a ′, and (1, 1)
2, 2, 1) pixels. However, it is necessary to refer to the peripheral region by itself, and (2,
(1,1,1) The divided image management object P by adding pixels
Notify 2. That is, the image area S-Area to which such correction has been made is an area obtained by adding a half area of the necessary area S-Area 'and (3,3,3,2) pixels of the peripheral area thereof. . Of course, the size of such a peripheral area is determined by the enlargement processing object P4 and the enhancement processing object P.
In the other calculation examples, two pixels are required for the upper, lower, left, and right in the enhancement processing, while one pixel is required for the upper and left sides and two pixels for the right and lower parts in the enlargement processing. Some do.

On the other hand, the divided image management object P2
Individual divided object data is input via the function management object P1, and while managing information as an area, the entity is stored in a spool file to register a divided image. Since the spool file is stored on the hard disk 13b, other processing objects cannot be directly referred to or used. However, the divided image management object P2 is developed on a memory so that the image area S-Area notified as described above can be used by another object. At this time, the required image area S-Area
Is not developed on the memory as it is, as shown in FIG. 8, S-Unit. Is sufficient to include the image area S-Area. a to i are checked, and all applicable S-Unit. a to i are expanded on the memory. Here, if the number of divided object data is small, S-Unit. That includes the image area S-Area. a
It is easy to determine which i is. Each S-
Unit. The entity data of a to i is stored in the hard disk 13
b, the header information on each area is stored in a table as shown in FIG. Each table has the following S-Unit. A pointer next_ptr indicating the information start position of a to i is provided. Originally, by following this pointer, all S
-Unit. a to i can be referred to, but each S-Unit. a to i are image areas S-Area
It is necessary to repeat some comparison operations to determine whether or not they overlap with a part of, and the number of operations becomes large. On the other hand, not all S-Unit. There is no need to compare with a to i, and in reality S-Uni to be referred to
t. a to i are limited. For example, in the example shown in FIG. 9, when the S-Area is developed,
Unit. It is only necessary to refer to a to i, and the pointer next_pt in this table is temporarily
r is changed.

In this embodiment, the pointer next
_Ptr to refer to the S-Unit. a-i are transferred to form an S-Area indirectly. a
Ｉi is specified, and a configuration capable of generating an S-Area at a high speed is adopted. However, a method of generating an S-Area at a high speed is, of course, not limited. As shown in FIG. 21, the S-Unit. a ~
i may be stored in a memory such as a main memory or a cache memory that can be accessed relatively faster than a hard disk, and may be referred to when the S-Area is generated. Alternatively, as shown in FIG. Unit. a to i
D1 to D9, and the S-Units. It is also possible to form an ID table in which a to i are arranged in such an order that an original image of a source image can be formed, and refer to the ID table when generating an S-Area.

As described above, the divided image management object P2 includes all the SUs including the image area S-Area.
nit. When a to i are expanded on the memory, the enhancement processing object P5 executes the enhancement processing, and then the enlargement processing object P4 executes the enlargement processing. In the enhancement processing, (2, 1, 1, 1) pixels are required as the peripheral area of the target pixel, and the image area generated as a result of the enhancement processing is shown in FIG.
As shown by 0, the peripheral area is an area within a broken line excluding (2, 1, 1, 1) pixels. Similarly, in the enlargement processing, (1, 2, 2, 1) pixels are required as the peripheral area of the target pixel, and the image area generated as a result of the enhancement processing is defined as the peripheral area as shown in FIG. 1,2,
(2, 1) This is the area within the broken line with the pixels omitted. Of course, since the enlargement process generates interpolation of grid points inside,
The obtained processed image is enlarged twice in length and width, and as a result, it coincides with the first necessary area S-Area '.

Next, another embodiment in which the divided image management object P2 develops the S-Area on the memory will be described. FIG. 23 shows a schematic configuration of the system in a state where the printer driver 12c in this embodiment is incorporated in the operating system 12a. In the figure,
The API management layer accesses the function management object P100 provided by the printer driver 12c from the API layer. The function management object P100 manages the divided object data by the divided image management object P200 and enlarges and adjusts the color tone from the processed image management object P300. Image data on which the image processing related to
The image data for each line is acquired, and the acquired image data for each line is stacked to generate image data for forming a destination image.

Specifically, in each module, the color tone processing object P500 is
A color tone process is performed on the predetermined line-unit image data transferred from the unit 200 to form predetermined line-unit image data and transferred to the enlargement processing object P400. Next, the enlargement processing object P400 performs enlargement processing on the image data on which the color tone processing has been performed,
One line of image data is formed and transferred to the processed image management object P400, and the function management object P100
Generates a destination image by acquiring and accumulating image data line by line from the processed image management object P300.

Here, in the present embodiment, the enlargement processing object P400 needs five lines of image data including the one line and the reference line to generate one line of image data after the enlargement processing. . Accordingly, the delivery of the five lines of image data is notified to the color tone processing object P500. In addition, since the tone processing object P500 generates image data of one line after the tone processing, only the image data of the one line may be used. Therefore, it is requested that the divided image management object P200 deliver one line of image data. Of course, the number of lines required in these processes is
It is not particularly limited, and can be appropriately changed according to the processing content of each object.

Next, FIG. 24 shows the input divided object data and the obtained processed image. In the figure, the original image is called a source image, and the processed image that has been subjected to the enlargement process and the color tone process is called a destination image. The input divided object data is divided into nine S-Units. A to I. here,
Although the destination image can be processed integrally, in the present embodiment, the destination image is divided into lines and generated for each line, and the images generated for each line are stacked to form the final destination image. Is generated. Also, each divided image in units of lines that divides the destination image is referred to as a D-line. 0-n
Call. Here, n is an integer and indicates the total number of lines of the generated destination image. First, D
-Line. In order to obtain 0, the processed image management object P300 sets 1
Notify the delivery of the line. Here, the enlargement processing object P400 needs the image data of five lines as described above to execute the enlargement processing of one line. Therefore, the transfer of the five lines is notified to the next color tone processing object P500. Since the color tone processing object P500 can process one line of image data when executing the color tone processing, it notifies the divided image management object P200 of the delivery of the one line of image data.

Then, the divided image management object P20
0 is the divided image data S-Unit. A predetermined image data of one line is formed from A to I and transferred to the color tone processing object P500. Color tone processing object P500
Performs color tone processing on the transferred one-line data, and when the color tone processing is completed, the enlargement processing object P4
Since five lines are requested from 00, the divided image management object P
Notifying 200 that one line has been delivered, the divided image management object sequentially generates one line in accordance with the request and delivers it to the color tone processing object. Then, the color tone processing object P500 sequentially executes color tone processing on the transferred one-line image data. Color tone processing object P500
Transfers the five lines to the enlargement processing object P400 when the color tone processing for the five lines is completed. The enlargement processing object P400 performs the emphasis processing of the first line with reference to the last four lines of the transferred five lines. Then, both the color tone processing and the emphasis processing were performed.
A destination image of the line is generated and transferred to the processed image management object P300.

When the destination image of the first one line is generated, the destination image is sequentially generated for each line up to n lines. In generating this one-line image, the processed image management object P300 notifies the enlargement processing object P400 of the delivery of one line. Here, the enlargement processing object P400 has already delivered the five lines for which the color tone processing has been completed. Therefore, in order to treat the first one of the five lines as unreferenced and to perform the enlarging process on the second line, the tone processing object P5
00 is notified of the delivery of one line. Upon receiving this notification, the color tone processing object P500 notifies the divided image management object P200 of the delivery of one line.
The divided image management object P200 includes the S-Unit.
A predetermined line is formed from A to I, and transferred to the tone processing object P500. Color tone processing object P50
0 performs the color tone processing on the transferred one line and transfers it to the enlargement processing object P400. The enlargement processing object P400 adds the transferred one line to the end of the already transferred four lines to form a processing area of five lines, and performs the enlargement processing on the second line described above. When the enlarging process is completed for the second one line, it is transferred to the processed image management object P300. Function management object P10
A value 0 indicates that the destination image is generated by sequentially stacking the line-by-line image data on which each process has been performed by each object acquired by the processed image management object P300.

As described above, first, the divided image management object P200 develops and transfers a one-line image area on the memory to the tone processing object P500, and the tone processing object P500 executes the tone processing, and When five lines of image data are generated in the processing object P500, the enlargement processing object P40
0 and execute the enlargement process. Then, one line of image data generated from five lines is delivered to the processed image management object P300. Thereafter, a one-line delivery notification and formation between the processed image management object P300, the enlargement processing object P400, the color processing object P500, and the divided image management object P200, or the one-line image data on which the image processing has been executed Are successively delivered in the reverse direction, and are stacked by the function management object P100 to generate a destination image. In the present embodiment, one line of image data transferred from the divided image management object P200 to the color processing object P500 and five lines or one line of image data transferred from the color processing object P500 to the enlargement processing object P400 are S-Area. Needless to say, it constitutes. Further, in the present embodiment, the order in which the image processing is executed is set as the color processing object P500 → the enlargement processing object P400. However, the present invention is not limited to this. Alternatively, only one of the enlargement processing object P400 and the color tone processing object P500 may be executed by a predetermined setting.

FIG. 12 shows the printer driver 12c.
Shows the flow of the procedure in. Although FIG. 3 shows a schematic configuration of the printer driver 12c in a state where the printer driver 12c is incorporated in the operating system 12a, FIG. The process is divided into a process close to the function of the driver and a process close to the additional function, and the driver function is summarized in the left column, and the module function is summarized in the right column. That is, in procedure 1, there is a source image acquisition process as a driver function, which can be said to be a function of the function management object P1 and the divided image management object P2. Next, the procedure 2 includes a photo instance acquisition process, which is for confirming a current execution target to be processed separately and in parallel for each object image.

The above corresponds to the pre-processing, and the processing flow is as follows: in step 3, the processing image area is notified from the module side to the driver side, while in step 4, the requested processing image area is notified. The driver side registers a source image (S-Unit. A to i) including
Subsequently, in procedure 5, an emphasis process and an enlargement process are executed as image processing. In the image processing, evaluation is performed on the entire object image, and processing is performed based on the evaluation result. For example, if a certain object image is entirely dark, it may be adjusted to be bright by image processing. In this case, since the object image has been divided into divided object data,
Evaluate each object data at once,
While individually evaluating object data, it is necessary to finally summarize the evaluation for each object image.

Originally, the correspondence between the divided object data and the object image is usually not assigned, and this association must be performed by the printer driver 12c. As one method of this association,
There is a method of expanding the divided object data in the virtual area to connect the object images, and another method of judging whether or not the divided object data is the same object image based on the overlapping or adjacent state of the divided object data. Which method is adopted depends on the difference of the system.

On the other hand, as described above, in order to evaluate an object image for image processing, it is effective and simple to sample pixel information over the entire object image. Such sampling may be performed before or after the correspondence between the object image and the divided object data is known. That is, sampling can be performed for each divided object data before the corresponding relationship is known, and the sampling results can be integrated after the corresponding relationship is known. Can also be sampled. As described above, the execution timing of the sampling varies depending on the conditions, and is indicated by broken lines in FIG. 12 corresponding to the three executable timings. It should be noted that it is also possible to prepare a sampling module, even if it is performed on the driver side.

The image processing in step 5 is executed using this sampling result, and the generated image is registered as a destination image in step 6. Then, the registered destination image is output on the driver side in step 7. Then, when the destination image is finally obtained, the source image is released from the memory in step 8. Here, the release timing of the source image is not particularly limited. For example, one SA
If registration / release is performed for each area, the memory area used can be reduced, but the operation is troublesome. On the other hand, when the used memory area is less limited, it can be said that the work of registration / release need not be performed frequently.

In the above-described example, the necessary area is notified in the sense of acquiring the destination image, and the generated destination image may be expanded to an arbitrary memory area. On the other hand, there are cases where it is desired to execute the enlargement processing on the spool file itself. in this case,
The enlarged image may be added to the spool file, and the pointer of the original image file may be linked to the enlarged image file. For example, it is assumed that there is a process of reading a spool file to construct a virtual image, performing image processing, and then rewriting the original spool file. In such a case, if the enlargement processing is performed on the image file in the spool file, it is not necessary to realize the enlargement processing on the virtual image. However, if the enlargement process is performed, the image file becomes larger than the image file in the spool file, and cannot be rewritten with the enlarged image file. Therefore, the enlarged image data is added after the spool file, and the pointer link is changed.

Next, a specific method of the enlargement processing will be described. Generally, a process of generating a new pixel between lattices of an image composed of pixels in a dot matrix is widely called an enlarging process. This is to solve the problem that when the resolution of the display 17a and the resolution of the color printer 17b are different from each other, they are not displayed in a certain size if assigned in pixel units. Here, the following method is known for the enlargement processing. 1. Nearest neighbor interpolation method (simple inflated copy)

2.3 Third-order convolution interpolation (hereinafter referred to as cubic interpolation) The former is the mathematically fastest enlargement method, while the latter is capable of obtaining a beautiful enlargement result, but is mathematically It has a feature that it requires a large amount of calculation and takes time. In any case, these are called filter processing in the technical term of image processing. Here, FIG.
3 and FIG. 14 show the principle of generating an enlarged image A from an unenlarged image a using separate filters [1] and [2]. In this case, one point of the image A after the enlargement can be obtained by applying the filters [1] and [2] using the several points of the image a before the enlargement. Therefore, the calculation is essentially repeated for all the pixels of the enlarged image A.

Incidentally, there should be a difference in the processing results between the filters [1] and [2]. That is, the former appears to be rough and the latter appears to be smooth. However, when printing is performed using the enlargement result, the difference cannot always be recognized due to the limit of human eye recognition. That is, the filter [2] which requires an advanced operation
There is a case where the difference between the enlargement results cannot be recognized between the case where the enlargement is performed only by one and the case where the enlargement is performed using both the filters [1] and [2]. FIG. 15 illustrates the latter procedure,
An enlargement process is performed on the original image a using the filter [2] to generate an image a 'once, and then an enlargement process is performed using the filter [1] to obtain the image A. ing. Needless to say, the enlargement process of the filter [2] requires cubic interpolation, so that the enlargement process of the filter [1] may be realized by a driver. In this case, of course, a difference can be seen by the naked eye depending on the magnification of the filter [1] and the filter [2]. However, if the combination is in a range where such a difference is not known, the filter [2] requiring a long processing time is used. Since the area of the generated image a 'is small, high-speed processing can be expected. This is because the amount of calculation increases in proportion to the area of the image after the enlargement processing.

FIG. 16 shows the arrangement of existing grid points and interpolation points in the case of cubic interpolation, and Expression 1 shows the filter processing of this cubic interpolation by a matrix operation formula.

(Equation 1) Note that the function f (t) is represented by f (t) = {sin (πt) π / πt, and by replacing U or V with W, t0 = 1 + (W− | W |) t1 = ( W− | W |) t2 = 1− (W− | W |) t3 = 2− (W− | W |)

Such a cubic interpolation operation generally requires a large amount of operation, but can be speeded up depending on the position of the interpolation point, and more specifically, is limited to an integral multiple. Throughput can be considerably reduced. Here, the integral multiple is a magnification at which the origin is placed on the intersection of the grid lines, and does not mean the ratio of the number of grid points before and after the enlargement processing. FIG. 17 is a two-fold enlargement in this definition, and FIG. 18 is a three-fold enlargement. In the figure, the large white circle is the origin, and the small black circle is the interpolation point. As can be seen from these figures, at the magnification of an integral multiple, some of the interpolation points are arranged on the grid lines. Hereinafter, specific speed-up means will be described.

(1) Simplification of Calculation of Interpolation Points on Grid Lines In the case of enlargement by an integral multiple, some interpolation points are arranged on grid lines. Therefore, Equation 1 is simplified (the amount of calculation is reduced). That is, the fact that the interpolation point exists on the grid line means that W (either U or V) becomes zero. Therefore, t0 = 1, t1 = 0, t2 = 1, and t3 = 2. At this time, f (t) is as follows from the above equation. f (0) = 1, f (1) = 0, f (2) = 0 Therefore, the interpolation point on the X axis when the Y axis is on the grid line is

(Equation 2) The interpolation point on the Y-axis when it is on the grid line with respect to the X-axis is

(Equation 3) Will be calculated by As is clear from the equations (2) and (3), it is possible to simplify the calculation of the enlargement processing.

(2) Speedup by Preparing a Plurality of Filters Interpolation points located on a grid line at integer multiples are the most peculiar examples. By providing point-by-point filtering,
Since f (t) can be converted to a constant, arithmetic processing can be sped up. In such a case, if f (t) is converted into a constant,

(Equation 4) Will be represented by Here, A to D, K
ＮN can be uniquely determined by the location W of the interpolation point, and may be calculated in advance and stored in a table.

Here, referring to FIG. 17 for the case of double magnification in the enlargement processing, it is necessary to interpolate four points locally.
In case of enlargement, four filters are prepared. FIG. 19 shows this in a diagram. Assuming that a plurality of filter processes are prepared, f (t) can be made constant. The concrete speed-up realized by making f (t) constant is based on the following reasons. First, f
(T) can be made constant, and the speed itself can be increased. This is because conversion of f (t) into a constant means removal of the operation of the cubic interpolation function represented by f (t). Next, it is possible to increase the speed by changing the operation type. In general, even for the same multiplication for the CPU,
"Constant * variable" is faster than "variable * variable". Therefore, when Expressions 1 and 4 are compared, it can be seen that Expression 4 is faster. further,
On the other hand, the speed can be increased by substituting the multiplication of “constant * variable” in the operation table by conversion to a constant.

The effects of the above speeding-up are summarized as follows. According to the conventional method of performing one filter process in order to obtain one interpolation point, calculation of a cubic interpolation function and calculation of “variable * variable” 20 times are required. However, as described above, when a plurality of filter processes are assumed, it can be realized by 16 accesses to the operation table and 4 operations of “constant * variable”. Therefore, speedup can be realized by preparing a plurality of filters. In addition, the simplification of the calculation of the interpolation points on the grid lines described above can be realized by preparing a plurality of filter processes in the same manner. And speedup by preparing such a plurality of filter processes,
Speeding up by simplifying the equation for the interpolation point on the grid line is effective for any multiple that is an integer multiple.

(3) Other high-speed operations (a) Simplification of the arithmetic expression of a unique interpolation point in 2 n times magnification In 2 n times expansion (n is an integer of 1 or more), An interpolation point is placed on a grid line (dashed line in FIG. 17) connecting the origin at the side and a point at a half of the origin.

(Equation 5) And on the Y axis,

(Equation 6) Will be represented by In this case, by utilizing the symmetry of the vector, it is possible to: • access the calculation table sixteen times;

(B) Saving of the amount of operation by storing the operations that can be shared between the filters It has already been described that the speed can be increased by preparing the filters for the number of interpolation points. However, the operations that can be shared between the filters are stored. As a result, the amount of calculation can be reduced. (C) Example of speeding up in quadruple magnification FIG. 20 shows a coding example in quadruple magnification. The lines to which the above-described acceleration is specifically applied are annotated. In other words, the speed-up is expressed by the following techniques: copy of origin, simplified formula on grid lines, storage of computations that can be shared between filters, and simplified formula of singular point multiplied by 2 n.

As described above, the processing amount can be considerably reduced by limiting the interpolation to an integral multiple. Therefore, it has been found that locally specifying the interpolation position is effective for speeding up. In the case of applying the method of interpolation expansion by such an integral multiple, it is conceivable that the present invention is not limited to the interpolation of an integral multiple, but may be applied to the interpolation of a small number of times. Here, in another embodiment of the enlargement processing, a small number of times, specifically 1.
Consider a 25-fold interpolation magnification. FIG. 25 shows the local operation in the 1.25-fold interpolation enlargement. In the figure, the local 1.25 times means that the origin of four points is made five points including one interpolation point. That is, this means that the origin of 16 points is enlarged to 25 points including the interpolation points on the plane.

Therefore, as shown in FIG. 25, the coordinates of the interpolation point can be estimated in advance, and the efficiency of the operation and the reduction in the amount of the operation can be reduced in the same manner as in the above-described embodiment using the integral multiple of the interpolation. It is. Therefore, it is sufficient to prepare an optimum filter for each interpolation point.
Here, a filter for each interpolation point is called a child filter, and 25 pixels including the interpolation points are generated from the 16 origins. The whole filter using these child filters is called a filter 16to25. Here, the vector elements required for the child filters forming the filters 16 to 25 are shown. 1024 multiplied vector elements required for obtaining P1 to P5 P1: {0, 1024, 0, 0} P2: {VA, VB, VC, VD} P3: {VE, VF, VG, VH} P4 : {VH, VG, VF, VE} P5: {VD, VC, VB, VA} VA to VH are constants previously obtained from the three-dimensional interpolation function and its interpolation position.

As described above, in order to increase a certain image by 1.25 times, the filters 16 to 25 are periodically passed through 16 points. However, it is self-evident that, in general, there is an extra area that cannot pass through the filters 16 to 25. Therefore, when applying the filter 16to25, the influence of the reference pixel must be considered. Since the surplus area passes through another filter, the uniformity is lost and distortion occurs. However, it is assumed that this is within the error range of the human eye.

Here, the relationship between the size of the source image and the size of the destination image when passing through the filters 16 to 25 will be described. Assuming that the length of one side of the source image is sL, the length dL of one side of the destination image obtained through the filter 16to25 is as follows. DL = {(sL-1) / 4 {* 5 + 1}} is an integer part... However, if there are a plurality of continuous local places and there is no influence of the reference pixel, dL = {sL / 4} * 5 (2)

Next, it will be verified that, when the number of pixels forming the image data is a multiple of 4, the interpolation expansion of 1.25 times is performed. Specifically, in the present embodiment, "1280 pixels * 960 pixels", which is required due to interpolation expansion of a digital camera, is interpolated / expanded by 1.25 times, and corrected to "1600 pixels * 1200 pixels". Verify that In such a case, when N is an integer, the X coordinate and the Y coordinate are 4 * N pixels equal to 5
* N is converted to the number of pixels. Substituting 4 * N for sL using equation (2), dL_1 = [4 * N / 4] * 5 (3) = [N] * 5 = 5 * N It can be seen that a typical 1.25 times is available. However, when considering the overall size, equation (1)
DL_2 = [4 * (N-1) / 4] * 5 + 1 (4) = [N-1 / 4] * 5 + 1 (4-1) ) = 5 * N−4 (4-2) Equation (4-2) shows a state where four pixels are insufficient as the destination image, and equation (4-1) shows (N−
1) This indicates that the light passes through the filter 16 to 25 only once. From this, filter 1 in the source image
Pixels to which 6to25 can be applied are 4 * (N−
It can be seen that 1) point and 4N−4 (N−1) = 4 points remain unprocessed. The pixels that can be extracted by the filters 16 to 25 as the destination image are:
5 * (N-1), which means that 5N-5 (N-1) = 5 points cannot be generated. Therefore, the remaining 4
It is necessary to consider a method of generating five missing points in the destination image from the points.

FIG. 26 shows a method of generating five missing points in the destination image from the remaining four points in the source image. In the figure, three points are locally changed to four points, that is, interpolation enlargement of 4/3 = 1.333... Times (hereinafter 1.3 times). Here, the vector elements necessary for the local 1.3 times interpolation enlargement are as follows. 1024 vector elements required for obtaining P1 to P4 P1: {0, 1024, 0, 0} P2: {VK, VL, VM, VN} P3: {VX, VY, VY, VX} P4 : {VN, VM, VL, VK} VK to VN, VX, VY are constants previously obtained from the three-dimensional interpolation function and its interpolation position.

From the above, for the portion that could not be processed by the filter 16to25, the filter 12to25X in the X direction and the filter 12to25Y in the Y direction.
Use In addition, a filter 9to16 is used for a portion that cannot be multiplied by 1.25 in both the X and Y directions. Here, a correlation diagram showing the correlation between the origin and the interpolation point when using the filter 12to15Y is shown in FIG.
25X is a figure rotated 90 degrees. ). in this way,
In the 1.25-times interpolation enlargement, 1.25-times and 1.3-times interpolation enlargement is performed locally. In such a case, the filter 16to25, the filter 12to20X, the filter 12
When to20X and the filter 9to16 are used, interpolation enlargement becomes possible, and accordingly, it is possible to realize high-speed interpolation enlargement processing.

If necessary vector elements are collected by these filters, 14 vector elements are required. Therefore, each vector element is multiplied by 0 to 255, 2
The number of operations can be reduced by using 14 operation tables formed from 56 elements. Here, assuming that the size of one element of this operation table is 4 bytes, the size of one operation table is 1024 bytes (1 KB). Since there are 14 of these, the memory required for the operation table is 14 KB.

As described above, when forming the S-Area, the S-Unit. S-Unit referenced from a to i
Is transferred in a predetermined table, stored in a memory such as a main memory or a cache memory that can be accessed at high speed, or a predetermined ID table is formed to indicate only a portion to be used for image processing. Therefore, a required processing area can be accessed at a high speed, and the amount of data to be developed in a memory can be reduced, thereby reducing the load on processing resources.

[Brief description of the drawings]

FIG. 1 is a block diagram of a computer system that executes an image processing program according to an embodiment of the present invention.

FIG. 2 is a diagram illustrating a change in a processing unit of a print image.

FIG. 3 is a diagram illustrating a schematic configuration of a printer driver in a state where the printer driver is incorporated in an operating system.

FIG. 4 is a diagram showing a processing unit of an image.

FIG. 5 is a diagram showing a peripheral area necessary for the emphasis processing.

FIG. 6 is a diagram illustrating a peripheral area necessary for the enlargement processing.

FIG. 7 is a diagram showing a process of notifying a necessary area from a module side to a driver side.

FIG. 8 is a diagram showing a relationship between S-Area and S-Unit.

FIG. 9 is a diagram showing an S-Unit pointer table.

FIG. 10 is a diagram illustrating a substantial processing target area when an emphasis process is performed.

FIG. 11 is a diagram illustrating a substantial processing target area when the enlargement processing is performed.

FIG. 12 is a diagram showing a procedure flow in a printer driver.

FIG. 13 is a diagram showing an enlargement process by a first filter process.

FIG. 14 is a diagram illustrating an enlargement process by a second filter process.

FIG. 15 is a diagram illustrating an enlargement process by two-stage filtering.

FIG. 16 is a diagram illustrating the relationship between grid points and interpolation points for cubic interpolation.

FIG. 17 is a diagram showing the relationship between grid points and interpolation points for double interpolation.

FIG. 18 is a diagram illustrating the relationship between grid points and interpolation points for triple interpolation.

FIG. 19 is a diagram illustrating an enlargement process by cubic interpolation using four filter processes.

FIG. 20 is a diagram illustrating a coding example in quadruple magnification.

FIG. 21 is a diagram in a case where an S-Unit to be processed is separately stored.

FIG. 22 is a diagram showing a processing area table of S-Unit.

FIG. 23 is a diagram illustrating a configuration of a printer driver in a state where the printer driver is incorporated in an operating system according to another embodiment.

FIG. 24 is a diagram showing a processing unit of an image in another embodiment.

FIG. 25 is a diagram showing the relationship between grid points and interpolation points for 1.25-times interpolation.

FIG. 26 is a diagram illustrating a relationship between grid points and interpolation points of 1.3-times interpolation.

FIG. 27 is a correlation diagram showing a correlation between an origin and an interpolation point when using filters 12to15Y.

[Explanation of symbols]

 10 Computer System 11a Scanner 11a2 Scanner 11b Digital Still Camera 11b1 Digital Still Camera 11b2 Digital Still Camera 11c Video Camera 12 Computer Body 12a Operating System 12b Display Driver 12c Printer Driver 12d Application 13a Floppy disk drive 13b Hard disk 13c CD-ROM drive 14a Modem 14a2 Modem 15a Keyboard 15b Mouse 17a Display 17b Color printer 18a Speaker 18b Microphone

Claims (7)

[Claims] 1. A page data is divided, and divided data required for a predetermined image processing is selected from original image data in which the divided data is arranged in random order, and the divided data is assigned to a predetermined processing area of the selected divided data. A medium on which a computer-readable image processing program for executing the same image processing is recorded, and a divided data selecting step of selecting divided data including a processing area for performing predetermined image processing from the original image data; A selected divided data instructing step of instructing the divided data selected in the divided data selecting step out of all the divided data to be in an accessible state; and An image processing execution step of executing image processing on a predetermined processing area. A medium that stores an image processing program that can be read. 2. The medium on which the image processing program according to claim 1 is recorded, wherein the step of instructing the selected divided data indirectly designates the selected divided data by position information in the original image data. A medium on which an image processing program is recorded. 3. A medium on which the image processing program according to claim 1 is recorded, wherein said step of instructing selection of divided data assigns a predetermined identifier to each of the divided data in any order and an identifier of the selected divided data. A medium storing an image processing program, wherein an identifier table is formed based on the image data, and the selected divided data is indirectly indicated by the identifier table. 4. The medium on which the image processing program according to claim 1 is recorded, wherein the selected divided data instruction step stores original image data of the divided data selected in the divided data selecting step. A medium in which an image processing program is recorded, wherein the image processing program is transferred to a storage area that can be accessed at a relatively higher speed than the storage area and is designated. 5. A medium on which the image processing program according to claim 1 is recorded, wherein the divided data selecting step is a processing in which a peripheral area referred to in image processing is added to the processing area. A medium having recorded thereon an image processing program for selecting divided data including an area. 6. The page data is divided, and divided data required for predetermined image processing is selected from original image data in which the divided data is arranged in any order, and a predetermined processing area of the selected divided data is selected. An image processing apparatus for performing the same image processing by using the divided data selecting means for selecting divided data including a processing area for performing predetermined image processing from the original image data; Means for instructing the divided data selected by the means to be accessible and restricting the use of the divided data, and an image for a predetermined processing area of the divided data made available by the selected divided data instructing means. An image processing apparatus comprising: an image processing execution unit that executes processing. 7. The page data is divided, and divided data required for predetermined image processing is selected from original image data in which the divided data is arranged in random order, and a predetermined processing area of the selected divided data is selected. An image processing method for performing the same image processing by using a divided data selection step of selecting divided data including a processing area for performing predetermined image processing from the original image data; A step of instructing the divided data selected in the step to make it accessible and restricting the use of the divided data, and a predetermined processing area of the divided data made available in the selected divided data instruction step An image processing execution step of executing image processing on the image.