JP2005065147A - Image processing apparatus, image processing system, compressed image processing data generating apparatus, image processing method, compressed image processing data generating method, and image processing program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To use image processing data with a smaller data size during image processing. <P>SOLUTION: Data are compressed from reference image processing data by predetermined compression processing and employed as image processing data. Header information indicative of whether data are rearranged and compressed according to a predetermined rule is appended at the image processing data. While the compressed image processing data are decompressed by decompression processing corresponding to the compression processing, the decompressed image processing data are rearranged according to a predetermined rule to generate reference image processing data, only if the header information appended at the decompressed image processing data contains information indicative that data are rearranged and compressed. Image data are translated with reference to the generated reference image processing data. By this configuration, predetermined image processing can be performed using image processing data with a smaller data size. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to an image processing device, an image processing system, a compressed image processing data generation device, an image processing method, a compressed image processing data generation method, and an image processing program.

  Conventionally, this type of image processing apparatus outputs image data composed of gradation data corresponding to a plurality of element colors such as RGB, which are classified by a large number of pixels, by referring to predetermined image processing data. It is converted into image data composed of data corresponding to a plurality of other element colors such as CMYK representing the output image of the apparatus. The image processing data includes a color conversion table (LUT) that defines the correspondence between image data before and after color conversion, and a dot allocation table that defines the correspondence between gradation data and data representing the amount of multiple types of dots formed , Etc. are included. Image processing data including these resources is incorporated in a printer driver or the like and supplied to the user of the image processing apparatus.

Further, as disclosed in Patent Document 1, LUT data obtained by rearranging LUT grid point data for each color component and storing the compressed LUT data is stored, the compressed LUT data is expanded, and the expanded LUT data is the same. A technique is also known in which grid point data is rearranged to form a set, and conversion processing for generating CMYK output image data from RGB input image data is performed by interpolation processing based on the rearranged LUT data.
JP 2000-22974 A

  In the conventional technology described above, the data size can be reduced by improving the compression efficiency of the LUT by rearranging and compressing the data. However, with regard to other resources used in the image processing apparatus, if the data is rearranged and compressed, the compression efficiency is decreased, or the compression processing itself is not compressed, and the program for performing the decompression compression is wasted. Processing time for performing compression / decompression may occur.

  The present invention has been made in view of the above problems, and an image processing apparatus, an image processing system, and compressed image processing data generation capable of performing predetermined image processing using image processing data having a smaller data size. An object is to provide an apparatus, an image processing method, a compressed image processing data generation method, and an image processing program.

Means for Solving the Problems and Effects of the Invention

In order to achieve the above object, an invention according to claim 1 is an image processing apparatus that converts image data based on predetermined image processing data, and includes a decompression unit and a conversion unit.
The image processing data is data compressed from the reference image processing data by a predetermined compression process, and header information is added. The header information is information indicating whether data is rearranged and compressed according to a predetermined rule.

The compressed image processing data is decompressed by decompression means corresponding to the compression processing.
When the header information added to the compressed image processing data includes information indicating that the data has been rearranged and compressed, the decompressed image processing data is rearranged according to the predetermined rule. Thus, the image processing data for reference is restored. At this time, the conversion means refers to the restored image processing data, and converts the image data composed of gradation data corresponding to a plurality of element colors into a plurality of pixels, and the output image of the image output device. Conversion into image data composed of data corresponding to a plurality of other element colors to be expressed.
On the other hand, when the header information added to the compressed image processing data does not include the information indicating that the data has been rearranged and compressed, the decompressed image processing data is used as it is for reference image processing data. And At this time, the conversion means converts the image data by referring to the decompressed image processing data.

  That is, by referring to the header information, it is possible to determine whether the compressed image processing data is rearranged and compressed data. Therefore, an image whose data size is reduced by rearranging the data. Data can be rearranged only for processing data, and image processing data compressed so as to reduce the data size can be used. Accordingly, predetermined image processing can be performed using image processing data having a smaller data size.

In the invention according to claim 2, the image processing data is added with header information only when the data is compressed from the reference image processing data by a predetermined compression process, and when the data is not compressed. Header information is not added. The added header information includes information indicating whether or not the data is rearranged and compressed according to a predetermined rule.
When header information is added to the image processing data, the image processing data is compressed image processing data. At this time, the compressed image processing data is decompressed by decompression means corresponding to the compression processing. When the header information added to the compressed image processing data includes information indicating that the data has been rearranged and compressed, the decompressed image processing data is rearranged according to the predetermined rule. Thus, the image processing data for reference is restored. When the header information added to the compressed image processing data does not include the information indicating that the data has been rearranged and compressed, the decompressed image processing data is used as image processing data for reference as it is. .
On the other hand, when header information is not added to the image processing data, the image processing data is uncompressed image processing data. At this time, the image processing data is directly used as reference image processing data.
The conversion means converts the image data by referring to the reference image processing data.

  That is, since it is possible to determine whether or not the image processing data is compressed by determining whether or not header information is added, only the image processing data whose data size is reduced by the compression processing is compressed. It is possible to perform processing, and it is possible to use image processing data that is further reduced in data size. In addition, since it is possible to determine whether or not the compressed image processing data is the data compressed after the rearrangement by referring to the header information, the data is compressed so as to further reduce the data size. The image processing data can be used. Accordingly, predetermined image processing can be performed using image processing data having a smaller data size.

The image processing data may be a variety of data such as a color conversion table, a dot allocation table, an ink weight correction table, a dither mask pattern, an index for knowing resources to be used according to a mode, and an index of a halftone dither matrix. .
The compressed image processing data includes data obtained by rearranging the reference image processing data according to the predetermined rule and compressing the reference image processing data without rearranging the data. If the data has a smaller data size, the predetermined image processing can be surely performed using image processing data having a smaller data size.
Compression information acquisition means for acquiring the compressed image processing data may be provided.

There are various combinations of the element colors of the image data. For example, there are three colors consisting of R (red), G (green) and B (blue), luminance data and two types of color difference data, brightness data and two types of color data. Chromaticity data, combination of four colors consisting of C (cyan), M (magenta), Y (yellow) and K (black), plus light cyan, light magenta, dark yellow, light black, etc. Can do.
The data corresponding to a plurality of other element colors is obtained by rearranging multi-gradation gradation data, multi-value data (including binary data) indicating the presence / absence of dot formation, and multi-value data. Various data such as raster data can be used.

The reference image processing data is provided with a rearrangement area where the data is rearranged during the compression process and an invariant area where the data is not rearranged. The compressed image processing data is provided with the reference image processing data. When header information indicating the position of the rearrangement area in the image processing data is added, the decompression means adds the position of the rearrangement area to the header information added to the compressed image processing data. When the information to be displayed is included, the reference image processing data may be generated by rearranging the decompressed image processing data in the rearrangement area included in the information. In other words, by referring to the header information, it is possible to specify the position of the rearrangement area in the image processing data and rearrange the data only in that area, so that the data size is compressed so as to further reduce the data size. Data can be used. Therefore, it is possible to perform image processing using image processing data having a smaller data size.
In the rearrangement area, the reference image processing data in the same area is compressed as it is without rearranging the data size of the data obtained by rearranging and compressing the reference image processing data in the area according to the predetermined rule. If the area is made smaller than the data size of the data, image processing using data for image processing having a small data size can be surely performed. Further, the invariant area is compressed as it is without rearranging the reference image processing data in the same area in which the data size of the data obtained by rearranging and compressing the reference image processing data in the area according to the predetermined rule is compressed. If the area is made smaller than the data size of the processed data, it is possible to reliably perform image processing using image processing data having a small data size.

  The compression processing includes a plurality of types, and the compressed image processing data is appended with header information indicating the type of the compression processing from the reference image processing data, and the decompression means When the header information added to the compressed image processing data includes information indicating the type of compression processing, the header information is compressed by decompression processing corresponding to the type of compression processing included in the information. The image processing data may be decompressed. That is, since the type of compression processing can be determined by referring to the header information, it is possible to use image processing data compressed by compression processing that further reduces the data size. Therefore, it is possible to perform image processing using image processing data having a smaller data size.

  If the header information can be added to each image processing data when there is a plurality of image processing data as in the invention according to claim 5, each image is determined by determining whether or not the header information is added. It can be determined whether or not the processing data is compressed, and it is possible to determine whether or not each compressed image processing data is compressed data after rearrangement by referring to the header information. Therefore, it is possible to use image processing data compressed so as to further reduce the data size. Therefore, it is possible to perform image processing using image processing data having a smaller data size.

The correspondence between the image data composed of gradation data corresponding to the plurality of element colors and the image data composed of gradation data corresponding to the plurality of other element colors is defined for a plurality of lattice points, and for each lattice point A color conversion table consisting of a data string obtained by repeating grid point data in which all gradation data for each element color are continuously arranged for all grid points is included in the image processing data. When a bit sequence of reference image processing data is represented by a ₀ , a ₁ ,..., _An (n is a positive integer) for each predetermined number of bits, a _i -a _i-1 (i is 1 to 1) n is an integer), and when a data string in which calculation results b _i obtained by reducing the number of bits are continuously arranged is included, the calculation results b _{1 to} b _i (i is an integer of ₁ to n) are sequentially continuous from the sum to calculate the a _i of each number of the predetermined bit It may decompress the compressed color conversion table by arranging allowed. Image processing can be performed using a color conversion table with good compression efficiency.

Each element color defines a correspondence between image data composed of gradation data corresponding to a plurality of other element colors and data representing the formation amount of a plurality of types of dots for the same element color. A dot allocation table consisting of a data string in which composite data in which all the data representing the formation amount of each of the plurality of types of dots is continuously arranged for each gradation value of gradation data corresponding to is repeated for all gradation values is an image Even in the case of being included in the processing data, the dot allocation table compressed by the same method can be decompressed, so that it is possible to perform image processing using a dot allocation table with good compression efficiency.
The image processing data compressed by taking the difference in this way may be compressed by another compression process. Furthermore, it is possible to perform image processing using image processing data with good compression efficiency.

  You may comprise an image processing system from the image processing apparatus of this invention, and the data generation apparatus for compressed image processing. The compressed image processing data generation device can generate the compressed image processing data by rearranging and compressing the reference image processing data according to a predetermined rule. The header information indicating that the data is rearranged and compressed in accordance with the predetermined rule is added to the compressed image processing data generated in step (b). As a result, the image processing apparatus can determine whether or not the compressed image processing data is the compressed data after the rearrangement by referring to the header information, so that the data size can be further reduced. Thus, it is possible to use image processing data that has been compressed. Accordingly, predetermined image processing can be performed using image processing data having a smaller data size.

Even with the compressed image processing data generation apparatus alone, it is possible to cause the image processing apparatus to perform predetermined image processing using image processing data having a smaller data size. That is, the apparatus described in claim 10 has the same operation and effect as described above.
In addition, the apparatus and system mentioned above may be implemented independently, and may be implemented with other methods in a state of being incorporated in a certain device. However, it can be changed as appropriate. In addition, since it is possible to proceed with processing according to a predetermined procedure corresponding to the above configuration, the present invention can also be applied as a control method, and the inventions according to claims 11 to 13 are basically also provided. Has similar actions and effects. Furthermore, the present invention can be applied to a printing system including a printing unit that forms dots and prints an image corresponding to image data, and basically has the same operation and effect.

When trying to implement the present invention, a predetermined control program may be executed by the apparatus or system. Therefore, the program described in claim 14 basically has the same operations and effects. In addition, it is conceivable that a medium on which the program is recorded is distributed and the program is appropriately read from the recording medium into a computer. Therefore, the present invention can be applied as a computer-readable recording medium on which the program is recorded. Has similar actions and effects.
Of course, it is possible to make the configuration described in claims 2 to 8 correspond to the method, the program, and the recording medium, and the configuration described in claim 9 and claim 10 to the program and the recording medium. It is also possible to correspond to.

Hereinafter, embodiments of the present invention will be described in the following order.
(1) Configuration of image processing system:
(2) Compressed image processing data generation method and compressed image processing data decompression method:
(3) Data generation processing and image processing for compressed image processing:
(4) Modification:

(1) Configuration of image processing system:
As shown in FIG. 1, an image processing system U0 according to an embodiment of the present invention is mainly composed of apparatuses U1 and U2, and both apparatuses U1 and U2 communicate with a predetermined server via an Internet network. It is also possible to do it. The printer manufacturer or the like uses the compressed image processing data generation device U1 to generate a printer driver or the like having image processing data, and the printer user or the like installs the printer driver or the like using the image processing device U2. To be executed.

  The image processing device U2 converts the input image data into output image data representing an output image of an image output device such as a printer by referring to a plurality of predetermined reference image processing data, and appropriately converts the image Control is performed to output an output image to the output device. The compressed image processing data generation device U1 generates the image processing data, but appropriately generates the compressed image processing data by reversibly compressing the reference image processing data by a predetermined compression process. The generated image processing data D1 is incorporated into a printer driver or the like, and is written into a CD-ROM 15a or the like as a recording medium and read into the image processing device U2, or is read into the image processing device U2 via a server. . In the image processing device U2, if the read image processing data is in a compressed state, the image processing data for reference is restored by performing decompression processing or the like, and the image data is converted by referring to the image processing data To do.

  As shown in FIG. 2, a printing system including an image processing device U2 includes a personal computer (PC) 10, an ink jet printer (printing device, printing means) 20, which is an image output device that outputs an image, and the like. It is configured. Of course, the computer used in the present invention is not limited to a PC. In the PC 10, the CPU 11 serving as the center of the arithmetic processing controls the entire PC via the system bus 10a. Connected to the bus 10a are a ROM 12, a RAM 13, a CD-ROM drive 15, a flexible disk (FD) drive 16, various interfaces (I / F) 17a to 17e, and a hard disk (HD) 14 via a hard disk drive. It is connected.

  The HD 14 stores an operating system (OS), an application program (APL), and the like, which are appropriately transferred to the RAM 13 by the CPU 11 during execution and executed. In addition, a plurality of image processing data D1 generated by the compressed image processing data generation device U1 is also stored, and a plurality of reference image processing data D2 generated from the plurality of data D1 is also stored. A digital camera (not shown) or the like can be connected to the USB I / F 17a, a display 18a for displaying an image corresponding to the image data based on the color image data is connected to the CRTI / F 17b, and a keyboard is connected to the input I / F 17c. A printer 18 is connected to the printer I / F 17e via, for example, a parallel I / F cable (a serial I / F cable is also possible).

The printer 20 shown in FIG. 3 prints an image corresponding to image data on a printing paper (printing medium) using CMYK ink. Of course, you may employ | adopt the printer which uses inks other than four colors. In addition, various printing apparatuses such as a bubble type printer that generates bubbles in the ink passage and discharges ink and a laser printer can be employed.
In the printer 20, a CPU 21, a ROM 22, a RAM 23, a communication I / O 24, a control IC 25, an ASIC 26, an I / F 27, etc. are connected via a bus 20 a, and the CPU 21 controls each unit according to a program written in the ROM 22.

The communication I / O 24 is connected to the printer I / F 17e of the PC 10, and the printer 20 receives a print job composed of image data converted into CMYK and page description language transmitted from the PC 10 via the communication I / O 24. The ASIC 26 outputs applied voltage data corresponding to the CMYK data to the head driving unit 26a while transmitting / receiving a predetermined signal to / from the CPU 21. The head drive unit 26a generates an applied voltage pattern to the piezo elements incorporated in the print head from the applied voltage data, and causes the print head to eject four colors of ink in dot units. The carriage mechanism 27a and the paper feed mechanism 27b connected to the I / F 27 perform the main scanning of the print head and the sub-scan by sequentially feeding out the printing paper while appropriately performing the page break operation.
This printer can change the size of ink droplets by changing the voltage application pattern to the piezo elements, and can form three types of large, medium, and small dots. When the image data is composed of gradation data that collectively represents the formation of three types of dots with different ink amounts, and the image data is converted into dot data that represents the dot type for each pixel, the printer supports the dot data. Thus, three types of dots having different ink amounts are formed on the printing paper.

  In the PC 10, a printer driver or the like that controls the printer I / F 17e is incorporated in the OS, and executes various controls as a part of the OS. APL exchanges data with hardware via the OS. The printer driver is operated when the printing function of the APL is executed, and can perform bidirectional communication with the printer 20 via the printer I / F 19, and image data from the APL via an OS incorporating GDI or the like. Is converted into image data to be output to the printer 20 and sent to the printer 20 as a print job. The printer driver converts image data by referring to the plurality of reference image processing data D2, and performs print control on the printer 20.

FIG. 4 is a flowchart showing the printing control process, and FIG. 5 schematically shows the configuration of the image processing apparatus U2 constructed by the hardware and the control program. This apparatus U2 is comprised from each part U21-U27, and converts image data based on the reference image processing data D21-D23.
When the print execution menu displayed on the display 18a is selected by the APL printing function provided in the APL, the flow is started, and the image input unit U21 classifies a plurality of pixels corresponding to a plurality of element colors. Image data composed of tone data is input and converted into RGB data of 256 gradations in a wide RGB color space (step S105; hereinafter, description of “step” is omitted). The input image data includes data recorded on the CD-ROM 15a and the like. The image data is data in which an image is expressed by a number of pixels in a dot matrix. The image data is composed of RGB defined in the sRGB color space, and the image is composed of YUV in the YUV color system. There are data, etc. Since each component of the image data has various gradations, the image data is converted into 256 gradations (integer values of 0 to 255) for each RGB in the wide RGB color space in accordance with the definition of sRGB or YUV color system. Convert to RGB data. When the resolution is increased, new data is generated between the gradation data of adjacent pixels by linear interpolation, and when the resolution is decreased, the data is thinned out at a constant rate. Note that data may be partially read, or only a pointer indicating a buffer area in which data is stored may be passed.

Next, the color conversion unit U22 refers to the 3D-LUT (color conversion table) while sequentially moving the target pixel using the gradation data of each pixel constituting the RGB data as the conversion target, and converts the RGB data to the printer. Color conversion is performed to image data composed of gradation data corresponding to a plurality of other element colors CMYK representing 20 print images (output images). The CMYK data is also data of 256 gradations for each CMYK in which an image is represented by a number of pixels in a dot matrix.
The HD 14 has a plurality of correspondence relationships between image data composed of gradation data corresponding to RGB three-element colors before conversion and image data composed of gradation data corresponding to four-element CMYK colors after conversion. A 3D-LUT that defines the grid points (reference points) is stored. The 3D-LUT stores gradation data for each CMYK, and includes a large amount of data corresponding to, for example, 17 RGB points, that is, 17 3 grid points. If CMYK data that matches the input RGB data is not stored in the 3D-LUT, obtain CMYK data corresponding to multiple RGB data close to the RGB data, and after color conversion by interpolation such as volume interpolation Is calculated.

After the color conversion, the halftone processing unit U23 refers to the dot distribution table D22 and the ink weight correction table D23 while sequentially moving the target pixel with the gradation data of each pixel constituting the CMYK data as the conversion target, and CMYK. Predetermined halftone processing is performed on the data to make it multi-valued (quaternary), and four-tone halftone data (data representing dot formation status) for each CMYK is generated (S115). Halftone data is data indicating the presence or absence of dot formation. For example, gradation value “3” indicates that large dots are formed, gradation value “2” indicates that medium dots are formed, and gradation value “1” indicates that small dots are formed. Yes, the gradation value “0” can be data corresponding to no dot formation. Of course, it may be data of two gradations of only gradation values “1” and “0”.
The HD 14 stores the tables D22 and D23. The dot allocation table is for forming image data consisting of 256 grayscale data corresponding to the CMYK four-element colors before conversion, and large, medium, and small (plural types) dots for each CMYK four-element color after conversion. It is a table that defines the correspondence between data representing quantities and the element colors of the same CMYK. The ink weight correction table is a table that stores data that compensates for deviations in the ink discharge amount of each machine when the ink discharge amount of the reference printer is used as a reference for each CMYK ink.

After the multi-value conversion, the rasterization processing unit U24 performs a predetermined rasterization process on the halftone data and rearranges it in the order used by the printer to generate raster data for each CMYK (S120). The raster data output unit U25 outputs the raster data to the printer 20 (S125), and the flow ends. Then, the printer 20 obtains raster data representing an image, drives the print head based on these data, ejects ink onto the printing paper, and prints an image corresponding to the image data. If the printer can execute halftone processing, multi-tone CMYK data may be output to the printer as it is.
That is, the PC that converts the image data with reference to the image processing data for reference in S105 to S120 constitutes a conversion unit, and the PC that controls the printer to print an image corresponding to the converted image data in S125. Constitutes a printing control means. Note that it is possible to configure the conversion means from only a part of the processes of S110, S115, and S120.

The compression information acquisition unit U26 acquires image processing data D1 for installation. The image processing data D1 is made up of a plurality of data, including compressed data and reference image processing data itself. Also, there may be a plurality of types of compressed data, and there is image processing data compressed after data rearrangement (hereinafter also simply referred to as “after rearrangement”), without data rearrangement. There is also compressed image processing data.
When the image processing data D1 is compressed by a predetermined compression process, the decompression unit U27 decompresses the image processing data D1 by a decompression process corresponding to the compression process. Also, only when the compressed image processing data is rearranged, the decompressed image processing data is rearranged according to a predetermined rule to generate reference image processing data, and the data is compressed without being rearranged. The decompressed image processing data is referred to as reference image processing data D21 to D23.

Since the compressed image processing data generation device U1 has the same configuration as the PC 10, the description of the same configuration as the image processing device U2 is omitted.
Peripheral devices such as a color measuring device 30 and a color scanner can be connected to the USB I / F 17a. The colorimeter 30 directs the color detection unit 30a to the object to be measured, so that the colorimetric value based on the Lab color system in the CIE standard, that is, the L value representing brightness and the a value representing hue and saturation. And b values can be measured. Lab values measured by the colorimeter 30 can be read via the USB I / F 17a, and can be used to create a 3D-LUT.

  The image processing program and the compressed image processing data generation program of the present invention are configured by the printer driver, but can also be configured by APL. The HD 14 is a medium on which these programs are recorded. The medium may be a CD-ROM 15a, FD, magneto-optical disk, non-volatile memory, or the like. Of course, it is also possible to download and execute the program of the present invention from a predetermined server via the Internet network.

(2) Compressed image processing data generation method and compressed image processing data decompression method:
FIG. 6 schematically shows a compressed image processing data generation method.
In the printer driver, a plurality of reference resources (image processing data) are finally incorporated. The upper part of the figure schematically shows a data string of a plurality of resources, and it is assumed that data are arranged from the top to the bottom. Although it is possible to use these resources as data for installation in the image processing apparatus as they are, the data size (hereinafter also simply referred to as “size”) becomes large. Therefore, for each of a plurality of resources, when the size is reduced when a predetermined compression process is performed, the compression process is performed and header information necessary for the decompression process is added. Here, the header information refers to information added to the start portion of the resource data string, and refers to information that is read first when the data of the resource start address is read.
In the example in the figure, it is shown that 3D-LUT etc. is compressed and header information is added, and the ink weight correction table is not compressed and is used as installation data. Has been. When all the resources are set as installation data, they are recorded on a recording medium such as a CD-ROM, supplied to the user, and read into the image processing apparatus.

  As the resource compression processing, various known compression methods can be employed as long as they can be reversibly compressed. For example, Shannon-Fano coding method, static Huffman coding method, static arithmetic coding method, zero compression method, run length compression method, dynamic Huffman coding method, Lempel-Ziv coding method, BSTW coding method, interval coding method, Pack bit A general compression process such as a method can be used. Here, the compression efficiency may be improved (the size is smaller) by performing the compression process after rearranging the resource data strings. For example, when using compression processing in which compression efficiency improves as the same data continues as in the Pack bit method, if the data sequence of resources is rearranged according to a predetermined rule so that the same continuous data increases, The size can be further reduced. In this case, the fact that the data has been rearranged is included in the header information.

  FIG. 7 schematically shows the structure of the 3D-LUT in an uncompressed state. As shown in the upper part of the figure, a cubic lattice is defined which is composed of N cubed lattice points that are spaced apart at substantially equal intervals along each axis in the RGB color space. In the figure, only the cube of 5 is drawn, but in reality, N = 9, 17, 33,... The lower part of the figure schematically shows the correspondence between RGB data and CMYK data in the LUT. For the sake of clarity, the grid point number and RGB data are shown in the LUT, but only the 8-bit gradation value of CMYK is stored, and CMYK 32 bits from the address corresponding to each gradation data constituting the RGB data. The RGB data is converted into CMYK data by referring to the gradation data of the minute. That is, the LUT is composed of a data string in which grid point data D31 in which all the gradation data for each CMYK element color is continuously arranged for each grid point is repeated for all grid points. By arranging a set of CMYK data corresponding to the same grid point in the order of the grid point numbers, it is possible to quickly read out 4-byte grid point data necessary for interpolation calculation processing at the time of image data conversion.

  However, in the 3D-LUT having the above structure, since the same data is less continuous, the compression efficiency is low in the compression process in which the compression efficiency improves as the same data continues. Therefore, the LUT data string is rearranged so that all the gradation data is continuous for each CMYK element color, and then compressed by compression processing.

FIG. 8 schematically shows how a 3D-LUT data string is rearranged and compressed. This LUT is composed of a data string in which 32-bit grid point data D31 is repeated for all grid points in an uncompressed state, and accompanying data associated with the data string, and the accompanying data is obtained from the start address As. It is assumed that a plurality of grid point data D31 are stored in a range from the address A1 to the end address Ae after the arrangement. Each grid point data is represented as c _i , m _i , y _i , k _i (i is an integer from 1 to n, n = N ³ ).
First, before compression, a data string composed of a plurality of grid point data D31 is rearranged so that all the gradation data are continuous for each CMYK element color. Here, the accompanying data is an invariable region R1 in which data is not rearranged, and a data string composed of a plurality of grid point data D31 is a rearrangement region R2 in which data is rearranged in the reference image processing data. Then, as shown in the middle of the figure, after the accompanying data that is left as it is, the gradation data group D32 by color is obtained in which all gradation data for each CMYK element color is continuous in the range of addresses A1 to Ae (for example, Y gradation data is rearranged (y ₁ , y ₂ ,..., Y _n ). Thereby, data is rearranged according to a predetermined rule, and it is set as 3D-LUT before compression.

Thereafter, the 3D-LUT before compression is compressed by a predetermined compression process to generate a compressed LUT, and header information indicating that the 3D-LUT is compressed after rearrangement according to the predetermined rule is added. Then, as shown in the lower part of the figure, header information D33 is arranged from the start address, and after that, a compressed LUT is arranged.
The header information D33 is composed of data D33a to e, which are header information in smaller units. Here, the data D33a is data having a predetermined number of bits indicating that the data has been compressed, and is a random number having a predetermined number of bytes, for example, about 5 to 10 bytes. Note that the header information itself is not added to the uncompressed resource, and the resource is compressed by reading out a predetermined byte from the start address of the resource and determining whether or not it matches the same random number. It can be determined whether or not. The data D33b is data having a predetermined number of bits indicating whether the data has been rearranged, and stores, for example, a predetermined code of 1 byte. In the case of a 3D-LUT, D33b is data indicating that the data has been rearranged. When the data is not rearranged, another predetermined code is stored at the same location. The data D33c is data having a predetermined number of bits indicating the size after compression, and the data D33d is data having a predetermined number of bits indicating the size of the LUT for reference after decompression. The data D33e is data of a predetermined number of bits representing the start address A1 of a data string composed of a plurality of grid point data D31. That is, header information indicating the position of the rearrangement region R2 in the reference image processing data is added to the compressed LUT.

When restoring the reference 3D-LUT, first, it is determined whether or not the resource is in a compressed state. Since header information D33 is added to the compressed LUT, it is determined that the LUT is in the compressed state. Then, the compressed LUT is decompressed by a predetermined decompression process corresponding to the predetermined compression process, and the pre-compression LUT is restored.
Next, it is determined whether or not the header information D33 includes information indicating that the header information added to the compressed LUT is rearranged and compressed. Since the data D33b indicating that the header information is rearranged and compressed is added, it is determined that the LUT is rearranged and compressed. Further, it is determined whether or not the header information D33 includes information indicating the position of the rearrangement area. Since the header information D33 includes data D33e representing the address A1, it is determined that the rearrangement region R2 is provided. Then, the reference 3D-LUT is restored by rearranging the LUTs before compression in the rearrangement region R2. That is, a reference LUT is generated by rearranging the data string of the decompressed LUT so that the lattice point data D31 is repeated for all lattice points for each decompressed LUT.

By adding header information indicating the position of the rearrangement area to the image processing data, the position of the rearrangement area in the image processing data is specified by referring to the header information, and the data is rearranged only in that area. Therefore, it is possible to use image processing data compressed so as to reduce the size.
Of course, the present invention can also be applied to a 3D-LUT in which the invariable region R1 is not provided. In this case, it is not necessary to add header information indicating the start address A1 of the rearrangement area R2, and the size of the header information can be reduced.

  The upper part of FIG. 9 schematically shows the structure of the dot allocation table in an uncompressed state. The dot sort table is image data consisting of gradation data corresponding to multiple CMYK element colors, and data (gradation values) representing the amount of large, medium, and small dots (multiple types of dots) for each CMYK element color Is a table that defines the corresponding relationship for each element color of the CMYK. The upper example in the figure shows a C table, and an MYK table is also provided. The dot distribution table is a data obtained by repeating composite data D34 in which all the data representing the formation amounts of large, medium, and small dots are continuously arranged for each gradation value of gradation data for each CMYK element color for all gradation values. It consists of columns. For the sake of simplicity, the table shows the gradation values before distributing the dots. However, only the gradation values representing the formation amounts of large, medium, and small 8-bit dots are stored, and before the dots are distributed. By referring to the gradation data for 24 bits of large, medium, and small from the address corresponding to the gradation value, CMYK data of 256 gradations is converted into data representing the dot formation amount for large, medium, and small dots. .

The lower side from the middle of the figure schematically shows how the data sequence of the dot allocation table is rearranged and compressed before compression. The composite data D34 for each gradation value is represented as cs _i (C small dot formation amount), cm _i (C medium dot formation amount), cl _i (C large dot formation amount), and the like.
Prior to compression, the data string composed of a plurality of composite data D34 is rearranged so that all the data representing the formation amount for each dot type are made continuous. Then, all the data representing the formation amounts for large, medium, and small dots are rearranged so as to form a continuous dot type data group D35 (for example, cs ₁ , cs ₂ ,..., Cs ₂₅₅ for C medium dot data). As a result, the data is rearranged according to a predetermined rule, and a dot distribution table before compression is obtained.

Thereafter, the table before compression is compressed by a predetermined compression process to generate a dot distribution table in a compressed state, and header information indicating that compression is performed after rearrangement according to the predetermined rule is added. Then, as shown at the bottom of the figure, header information D36 is arranged from the start address, and then a dot distribution table in a compressed state is arranged.
The header information D36 is similar to the data D33a to d described above, the data D36a indicating that the data is compressed, the data D36b indicating whether the data has been rearranged, the data D36c indicating the size after compression, and the decompressed data The data D36d representing the size of In the case of the dot distribution table, the data D36b is data indicating that the data has been rearranged.

  Here, as shown in the upper part of FIG. 10, the data (D33b, D36b) indicating whether or not the data has been rearranged includes information indicating whether or not the invariant area is provided in the image processing data. May be. In this case, the data indicating whether or not the data is rearranged is the predetermined code “C1” when the invariant area is provided and the data in the rearrangement area is rearranged, and the entire data is rearranged without the invariant area being provided. The predetermined code “C2” may be used when the data is sorted, and the predetermined code “C3” may be set when the data is not rearranged. Here, C1, C2, and C3 are mutually different values.

  When restoring the reference table, the dot distribution table in the compressed state is decompressed by a predetermined decompression process corresponding to the predetermined compression process, and the dot distribution table before compression is restored. Next, a reference dot distribution table is generated by rearranging the data sequence of the decompressed dot distribution table so that the composite data D34 is repeated for all gradation values for each gradation value of the decompressed dot distribution table. .

  A plurality of types of compression processing for compressing image processing data are provided, a type of compression processing corresponding to each of the plurality of image processing data is performed, and when decompressing image processing data in a compressed state, corresponding decompression is performed. Processing may be performed. In this case, as shown in the lower part of FIG. 10, information indicating the type of compression processing may be included in data (D33a, D36a) indicating that the data has been compressed. For example, a predetermined code “C11”, “C12”, “C13” corresponding to the type of compression processing after a random number of a predetermined number of bits indicating that the data is compressed (the same common value regardless of the contents of the header information). Or the like. Then, the compressed image processing data can be decompressed by decompression processing corresponding to the type of compression processing included in the header information.

  When the data of the 3D-LUT or the like and the dot distribution table are rearranged according to the above-described rules, the gradation values of the gradation data group D32 by color and the data group D35 by dot type change gradually when viewed in order. Data.

FIG. 11 shows a process for efficiently compressing and decompressing the 3D-LUT and the dot allocation table. When the bit sequence of the data groups D32 and D36 of the reference image processing data is represented by a ₀ , a ₁ ,..., _An (n is a positive integer) every 8 bits (predetermined number of bits),
b _i = a _i -a _i-1 (i is an integer of 1 to n) (1)
To calculate the difference. The calculation result b _i is reduced to 4 bits, for example, and the number of bits is reduced. However, since there is a negative value, the most significant bit is set to an integer value such as −8 to +7, for example.
Then, a data string in which the calculation results b _i are continuously arranged starting from a ₀ , that is, a ₀ , b ₁ , b ₂ ,..., B _n (referred to as a compressed data group) is compressed. It is included in the data string of image processing data.
The above processing is performed for all the data groups D33 and D36, and compressed image processing data is generated.

When decompressing, for each compressed data group, a _i for each 8 bits is calculated from the sum of b _{1 to} b _i (i is an integer of ₁ to n) sequentially. In particular,
a _i = a ₀ + Σb _j (j is an integer from 1 to i) (2)
It becomes. Actually, a _i = a _i−1 + b _i (3) equivalent to equation (2)
A _i can be calculated easily and quickly.
Then, the data string consisting by continuous calculation result a _i1 a top a _0, i.e., a _0, a _1, ..., included in the data sequence of the image processing data for reference to a _n.
The above processing is performed for all the compressed data groups, and the decompressed reference image processing data is generated.

As described above, specific examples of compression processing suitable for 3D-LUTs and dot allocation tables can be provided, and good compression efficiency can be obtained with simple processing of calculating differences for these tables, and Since the processing is simple, the compression processing time is short. Then, it is possible to perform image processing using a 3D-LUT or a dot allocation table with good compression efficiency.
Further, another compression process may be performed on the image processing data including the compressed data group. Then, it is possible to improve the compression efficiency of the table, and to perform image processing using the image processing data with further excellent compression efficiency.

(3) Data generation processing and image processing for compressed image processing:
FIG. 12 is a flowchart showing compressed image processing data generation processing performed by the compressed image processing data generation apparatus. When the compressed image processing data generation program stored in HD or the like is read out to the RAM and started, first, a target resource for generating an installation resource is set from a plurality of reference resources (image processing data). (Step S105. Hereinafter, description of “step” is omitted). For example, a different identification value can be assigned to each of a plurality of resources, and the identification value corresponding to the target resource can be assigned to a predetermined variable. Next, the size before compression is acquired for the target resource (S110).
Thereafter, it is determined whether the target resource is a resource for rearranging data (S115). For example, if a table T1 storing information indicating the type of resource for which data is rearranged is stored in advance in HD or the like, the table T1 is referenced, and information indicating the target resource is stored in the table T1. It is determined that the condition is satisfied, and if it is not stored, it can be determined that the condition is not satisfied. When the condition is satisfied, the reference resource data is rearranged according to a predetermined rule as illustrated in FIG. 8 or FIG. 9 (S120). When the condition is not satisfied, the process proceeds to S125 without rearranging the reference resource data. In the case of rearranging the data of only the rearrangement area in the resource, the data of the rearrangement area start address is acquired, and the data of the rearrangement area is rearranged according to a predetermined rule.

  In S125, the target resource with the data rearranged or the target resource with no data rearranged is compressed by a predetermined compression process as illustrated in FIG. 11 to generate a compressed resource. When a plurality of types of compression processes are provided, for example, as shown in the upper part of FIG. 13, a compression process storing information defining the correspondence between the resource type T21 and the information T22 indicating the type of compression process. The correspondence table T2 is stored in advance in HD or the like, the information representing the type of compression processing corresponding to the target resource is read from the table T2 with reference to this table T2, and the compression processing corresponding to the information (in FIG. 10) (Exemplified in the lower row). Here, when a plurality of compression processes are provided corresponding to the resources, information indicating the type of the compression process is sequentially read from the top every time S125 is performed. Therefore, for example, when the target resource is a 3D-LUT, the compression processing by the compression method corresponding to the information “2” indicating the compression processing type is first performed, and when S125 is performed again, the compression processing type is represented. A compression process using a compression method corresponding to the information “1” is performed.

  Next, as illustrated in FIG. 8 and FIG. 9, data indicating that the data is compressed from the reference resource by a predetermined compression process, the size of the resource after decompression, and the compressed (compressed state) Header information including the resource size and the like is temporarily generated and added to the head of the compressed resource (S130). Here, when the data is rearranged in S120, header information indicating that the data has been compressed after the rearrangement is added according to a predetermined rule. However, when the data of only the rearrangement area is rearranged, header information indicating that ( In FIG. 10, “C1”) is added, and when all the data is rearranged, header information (“C2”) indicating that fact is added. On the other hand, when the data is not rearranged, header information (“C3”) indicating that the data is compressed without being rearranged is added. If a plurality of types of compression processing are provided, for example, as shown in the lower part of FIG. 13, information defining the correspondence between information T31 indicating the type of compression processing and a predetermined code T32 added to the header information is provided. The stored compression processing code table T3 is stored in advance in HD or the like, and a code having a predetermined number of bits corresponding to the type of compression processing performed is read from the table T3 with reference to the table T3. It is included at the end of the data representing compression (illustrated as D33a and D36a in FIGS. 8 and 9).

  Thereafter, the size of the compressed resource after the compression processing is acquired (S135). Next, it is determined whether or not the size of the compressed resource is smaller than the size of the original resource before the compression process (S140). When the condition is satisfied, the compressed resource is stored in the image processing data area for installation provided in the RAM or HD (S145), and the process proceeds to S160. When the condition is not satisfied, it is determined whether there is another compression process to be performed on the resource before compression (S150). For example, when there is a plurality of data indicating the type of compression processing corresponding to the target resource in the compression processing correspondence table T2 and there is a compression processing that is not executed, the condition is satisfied, and the process returns to S125. When the condition is not satisfied, the original reference resource is stored in the image processing data area for installation (S155), and the process proceeds to S160. By performing the processing of S140 to S155, the header information is added to each of the plurality of image processing data only when the data is compressed from the reference image processing data by the predetermined compression processing. The header information includes information indicating whether or not the data has been compressed after rearrangement according to a predetermined rule.

In S160, it is determined whether installation data has been generated for all resources. When the condition is not satisfied, the process returns to S105, sets the target resource from other resources for which no installation data is generated, and repeats the above-described processing. When the conditions are satisfied, a printer driver is generated by combining a plurality of installation resources and a predetermined program, stored in the HD, and recorded in a recording medium such as a CD-ROM (S165), and the flow ends.
The processing of S140 to S155 is performed because the size of the resource may not be smaller than the original size even when the compression processing is performed by adding header information indicating that the compression processing has been performed to the resource. . As a result, it is possible to perform compression processing only for image processing data whose size is reduced by the compression processing, and not to perform compression processing for image processing data whose size is not reduced by the compression processing. The size of the image processing data is smaller than when the same compression processing is uniformly performed on the image processing data. In addition, since appropriate compression processing can be performed on each of the plurality of image processing data, the size of the image processing data is further reduced in this respect. Furthermore, in the case of image processing data that can be expected to greatly improve compression efficiency by rearranging data only in the rearrangement area, such as the 3D-LUT described above, the same compression processing is uniformly performed on the entire image processing data. The size is smaller than when performing. Of course, the size of the image processing data that can be expected to greatly improve the compression efficiency by rearranging the data is smaller than when the compression processing is performed without rearranging the data by performing the compression processing after the rearrangement. . In particular, by reordering the data for image processing data that is reduced in size by rearranging the data, and by preventing the data from being rearranged for image processing data that is not reduced in size even if the data is rearranged, Becomes smaller. Therefore, when image processing is performed, it is possible to perform predetermined image processing using image processing data having a smaller size.

FIG. 14 is a flowchart illustrating the decompression process performed by the image processing apparatus. When the image processing program stored in HD or the like is read out to the RAM and started, the printer driver for installation is acquired from the recording medium by reading the printer driver for installation from a CD-ROM and storing it in the HD or the like. (S205). The PC 10 that performs the process of S205 constitutes a compressed information acquisition unit. Next, a target resource for generating a reference resource from among a plurality of installation resources (image processing data) is set (S210).
Thereafter, it is determined whether header information is added to the target resource (S215). For example, whether or not the random number having the predetermined number of bits shown in FIG. 10 is stored at the beginning of the target resource, that is, whether the predetermined number of bits is read from the start address of the target resource and is the same as the random number Judgment can be made.
When header information is not added, the target resource is not compressed. Therefore, the target resource is stored as it is in the reference image processing data area provided in the RAM or the like (S220), and the process proceeds to S250.

When header information is added, the target resource is subjected to predetermined compression processing. In this case, first, it is determined whether or not the header information includes information indicating that the data has been rearranged and compressed (S225). For example, the determination can be made based on whether the data indicating whether the data shown in FIGS. 8 and 9 has been rearranged is the code “C1” or “C2” shown in FIG.
When the condition that the data is rearranged is satisfied, first, the resource in the compressed state is decompressed by a predetermined decompression process corresponding to the compression process performed on the resource (S230). When a plurality of types of compression processing are provided, the last predetermined number of bits indicating that the data has been compressed is read out, and the compression processing code table T3 shown in the lower part of FIG. Information indicating the type of compression processing may be read and decompression processing corresponding to the compression processing corresponding to the information may be performed. Next, the decompressed resource data is rearranged according to the data rearrangement rule (illustrated in FIGS. 8 and 9) performed on the resource to generate a reference resource (S235). The process proceeds to S245. When the data of only the rearrangement area in the resource is rearranged, for example, when it is determined whether the header information includes the code “C1” shown in FIG. The data of the start address of the rearrangement area is acquired from the above, and the data of the rearrangement area is rearranged according to a predetermined rule.

On the other hand, when the condition is not satisfied in S225, the data in the compressed resource is not rearranged. In this case, the decompression process similar to S230 is performed, and the reference resource is generated without rearranging the data by decompressing the target resource (S240), and the process proceeds to S245.
In S245, the generated reference resource is stored in the reference image processing data area, and the process proceeds to S250.
In S250, it is determined whether or not resources have been stored in the reference image processing data area for all resources. When the condition is not satisfied, the process returns to S210, sets the target resource from other resources not stored in the reference image processing data area, and repeats the above-described processing. When the condition is satisfied, a printer driver is generated by combining a plurality of reference resources and a predetermined program, stored in the HD, and the flow ends.
The PC 10 that performs the processes of S210 to S250 constitutes a thawing unit.

When the printer driver is installed, the print control process shown in FIG. 4 is performed to convert the image data with reference to a plurality of reference image processing data, and the image data is converted into the image data based on the converted image data. The corresponding image can be printed on the printer.
With the above processing, a reference resource can be generated from a resource that has been subjected to three types of processing: uncompressed, compressed only, and compressed after data rearrangement, with a single decompression logic. This makes it possible to compress resources that cannot be reordered, prepare the data to be passed to the decompression logic in a way that is optimal for the type of resource, and what processing has been done. It is convenient because it can be passed to the decompression logic without being particularly conscious.

According to the present invention, the following useful effects can be obtained.
By determining whether or not header information is added, it is possible to determine whether or not the image processing data is compressed. Then, the compression processing can be performed on the image processing data whose size is reduced by the compression processing, and the compression processing is not performed on the image processing data whose size is not reduced depending on the compression processing. If there is a plurality of image processing data, each image processing data can be processed so that the size is smaller, so image processing using image processing data having a smaller data size is performed. It becomes possible.
Further, by referring to the header information, it is possible to determine whether or not the data is rearranged before the compression processing of the image processing data. Then, data can be rearranged for image processing data that is reduced in size by rearranging data, and data can be prevented from being rearranged for image processing data that does not decrease in size when data is rearranged. In particular, when there are a plurality of image processing data, the image processing data can be processed so that the size of each image processing data becomes smaller. It is possible to perform the used image processing.
Further, by providing a rearrangement area and an immutable area in the image processing data, the data is rearranged using the area whose size is reduced by rearranging the data as the rearrangement area. It is possible to prevent the data from being rearranged by setting the non-changeable area as an invariable area, and in this respect, it is possible to perform image processing using image processing data having a smaller data size.
Furthermore, since multiple types of compression processing can be performed on the image processing data, it is possible to perform image processing using the image processing data compressed by the compression processing that further reduces the data size. Become.
It is to be noted that information indicating whether or not the data has been compressed after sorting is used as header information, information indicating the position of the sorting area is used as header information, and information indicating the type of compression processing is used as header information. This information can be quickly acquired and necessary processing such as decompression can be performed simply by reading some data from the beginning of the data sequence of the image processing data. Here, if these pieces of information are associated with the image processing data in a format other than the header information, it is necessary to search the image processing data in order to acquire the information attached to the image processing data. Processing becomes complicated and processing time is also required. By adding these pieces of information as header information, processing such as decompression can be simplified and processing time can be shortened.

(4) Modification:
The computer and the image output apparatus that can be used when carrying out the present invention can have various configurations.
For example, the printer may be integrated with a computer or may be a dedicated product that prints only a single color image. Of course, in addition to the printing device, a display device that displays an image expressed in a predetermined color space may be used as the image output device according to the present invention.

  FIG. 15 is a flowchart illustrating processing performed by the compressed image processing data generation device according to the modification. When the same processing as S105 to S115 in FIG. 12 is performed and it is determined that the target resource is a resource for rearranging data, first, compression processing similar to S125 is performed (S305), and header information is generated by processing similar to S130. Are added to the resource (S310), and the size of the resource after the compression processing is obtained by the same processing as S135 (S315). Thereafter, the original reference resource data is rearranged in the same process as in S120 (S320), the same type of compression process as in S305 is performed (S325), and the header information is generated in the same process as in S310 to generate resources. Add (S330), and acquire the size of the resource after the compression processing by the same processing as S315 (S335).

  Then, the process is branched according to the size of the generated two types of compressed resources (S340). When the size of the resource compressed after the rearrangement is smaller than the size of the resource compressed without the rearrangement, the resource compressed after the rearrangement is stored in the area of the image processing data for installation provided in the RAM or the like (S345). ), Go to S160. On the other hand, if the size of the resource compressed after the rearrangement is equal to or larger than the size of the resource compressed without the rearrangement, the compressed resource without rearranging the data is stored in the image processing data area for installation (S350). The process proceeds to S160.

In the image processing apparatus, whether or not data is rearranged before the compression processing of the image processing data can be determined by referring to the header information.
By performing the above processing, only image processing data that is reduced in size by rearranging data is automatically rearranged, and image processing data that is not reduced in size even if data is rearranged. I can't. Therefore, it is possible to perform image processing using image processing data having a smaller data size.
As described above, according to the present invention, it is possible to perform predetermined image processing using image processing data having a smaller data size according to various aspects.

1 is a block diagram showing a schematic configuration of an image processing system. 1 is a block diagram showing a schematic configuration of a printing system. FIG. 2 is a block diagram illustrating a schematic configuration of a printer. 5 is a flowchart showing processing performed by the image processing apparatus. The figure which shows the structure of an image processing apparatus typically. The figure which shows typically the data generation method for compressed image processing. The figure which shows typically the structure of 3D-LUT in the state which is not compressed. The figure which shows typically a mode that the data sequence of 3D-LUT is rearranged and compressed. The schematic diagram of a mode that rearranges and compresses the data row | line | column of a dot allocation table. The figure which shows typically the structure of the data contained in header information. The figure which shows typically the process which compresses a table efficiently and decompress | decompresses. 7 is a flowchart showing compressed image processing data generation processing. The schematic diagram of the structure of a compression process corresponding | compatible table and a compression process code table. The flowchart which shows a decompression | decompression process. The flowchart which shows the data generation process for compressed image processing in a modification.

Explanation of symbols

DESCRIPTION OF SYMBOLS 10 ... Personal computer (PC), 11 ... CPU, 12 ... ROM, 13 ... RAM, 14 ... Hard disk (HD), 20 ... Inkjet printer (printing apparatus), D1, D2 ... Image processing data, D22 ... Dot distribution table D23: Ink weight correction table, D31: Lattice point data, D32: Tone data group by color, D33, D36 ... Header information, D34 ... Composite data, D35 ... Data group by dot type, R1 ... Invariant region, R2 ... Rearrangement area, U0 ... image processing system, U1 ... compressed image processing data generation device, U2 ... image processing device, U21 ... image input unit, U22 ... color conversion unit, U23 ... halftone processing unit, U24 ... rasterization processing unit , U25 ... raster data output unit, U26 ... compression information acquisition means, U27 ... decompression means

Claims (14)

Based on predetermined image processing data, image data consisting of gradation data corresponding to a plurality of element colors for each of a plurality of pixels corresponds to a plurality of other element colors representing the output image of the image output device. An image processing apparatus that converts image data consisting of processed data,
The image processing data is compressed from the reference image processing data by a predetermined compression process, and header information indicating whether the data is rearranged and compressed according to a predetermined rule is added. And
Information indicating that the compressed image processing data is decompressed by decompression processing corresponding to the compression processing and the header information added to the compressed image processing data is rearranged and compressed. Decompressing means for generating the image processing data for reference by rearranging the decompressed image processing data according to the predetermined rule only when
An image processing apparatus comprising: conversion means for converting the image data with reference to the generated image processing data for reference. Based on predetermined image processing data, image data consisting of gradation data corresponding to a plurality of element colors for each of a plurality of pixels corresponds to a plurality of other element colors representing the output image of the image output device. An image processing apparatus that converts image data consisting of processed data,
The image processing data is added with header information only when the data is compressed from the reference image processing data by a predetermined compression process. The header information is rearranged according to a predetermined rule. Information indicating whether or not
When the header information is added to the image processing data, information indicating that the image processing data is decompressed by decompression processing corresponding to the compression processing and is rearranged and compressed into the header information. The image processing data for reference is generated by rearranging the decompressed image processing data according to the predetermined rule only when the header information is included, and the header information is added to the image processing data. When the image processing data is the reference image processing data,
An image processing apparatus comprising: conversion means for converting the image data with reference to the reference image processing data. The reference image processing data is provided with a rearrangement area where data is rearranged during the compression process and an invariant area where data is not rearranged,
Header information indicating the position of the rearrangement area in the reference image processing data is added to the compressed image processing data,
The decompression means, when the header information added to the compressed image processing data includes information indicating the position of the rearrangement area, the decompressed image processing of the rearrangement area included in the information The image processing apparatus according to claim 1, wherein the image processing data for reference is generated by rearranging the data for use. The compression process is provided with a plurality of types.
Header information indicating the type of compression processing from the image processing data for reference is added to the compressed image processing data,
When the header information added to the compressed image processing data includes information indicating the type of compression processing, the decompression means performs decompression processing corresponding to the type of compression processing included in the information. 4. The image processing apparatus according to claim 1, wherein the compressed image processing data is decompressed. The image processing data is composed of a plurality of pieces, and header information is added only when each of the plurality of pieces of image processing data is compressed from the reference image processing data by a predetermined compression process. The header information includes information indicating whether or not the data is rearranged and compressed according to a predetermined rule.
For each of the plurality of image processing data, the decompression means generates the reference image processing data when the header information is added to the image processing data, and generates the reference image processing data. 3. The image processing apparatus according to claim 2, wherein the image processing data is used as the reference image processing data when the header information is not added. The reference image processing data includes a plurality of correspondence relationships between image data composed of gradation data corresponding to the plurality of element colors and image data composed of gradation data corresponding to the plurality of other element colors. Including a color conversion table consisting of a data string in which grid point data in which all the gradation data for each element color are continuously arranged and arranged for each grid point is repeated for all grid points.
The compressed image processing data includes a color conversion table in which the data sequence of the color conversion table is rearranged so that all the gradation data is continuous for each element color and compressed by the compression process, The compressed color conversion table is appended with header information indicating that the data has been rearranged and compressed according to the predetermined rule,
The decompression means decompresses the compressed color conversion table by a decompression process corresponding to the compression process and arranges all gradation data for each element color continuously for each grid point of the decompressed color conversion table. The color conversion table for reference is generated by rearranging the data sequence of the color conversion table that has been decompressed so as to repeat the grid point data for all grid points,
The image processing apparatus according to claim 5, wherein the conversion unit performs color conversion on the image data with reference to the reference color conversion table. The image processing data for reference has the same correspondence relationship between the image data composed of the gradation data corresponding to the plurality of other element colors and the data representing the formation amounts of a plurality of types of dots for the same element colors. The composite data in which all the data representing the formation amount for each of the plurality of types of dots is continuously arranged for each gradation value of the gradation data corresponding to each element color is repeated for all gradation values. Includes a dot sorting table consisting of data strings,
In the compressed image processing data, there is a dot sorting table in which the data row of the dot sorting table is rearranged so that all the data representing the formation amount for each type of dot is continuous and compressed by the compression processing. Included in the compressed dot allocation table is added header information indicating that the data has been rearranged and compressed according to the predetermined rule,
The decompression means decompresses the compressed dot allocation table by a decompression process corresponding to the compression process, and continues all data representing the formation amount for each type of dot for each gradation value of the decompressed dot allocation table. The dot distribution table for reference is generated by rearranging the data array of the dot distribution table that has been decompressed so that the composite data arranged in a repeated manner is repeated for all gradation values,
The image processing apparatus according to claim 5, wherein the conversion unit converts the image data with reference to the reference dot allocation table. In the compressed color conversion table, when the bit sequence of the image processing data for reference is represented by a ₀ , a ₁ ,..., _An (n is a positive integer) for each predetermined number of bits, a a data string in which calculation results b _i obtained by calculating _i −a _i-1 (i is an integer of ₁ to n) and reducing the number of bits are continuously arranged are included,
The decompression means calculates the compressed values by sequentially calculating a _i for each predetermined number of bits from the total sum of the calculation results b _{1 to} b _i (i is an integer of ₁ to n) and arranging them in succession. 8. The image processing apparatus according to claim 6, wherein the color conversion table is decompressed. A compressed image processing data generating device that compresses reference image processing data by a predetermined compression process to generate compressed image processing data; and
By generating the reference image processing data from the compressed image processing data and referring to the reference image processing data, a plurality of pixels corresponding to a plurality of element colors are obtained. An image processing system configured to convert image data composed of tone data into image data composed of data corresponding to a plurality of other element colors representing an output image of the image output device,
The compressed image processing data generation device can generate the compressed image processing data by rearranging and compressing the reference image processing data according to a predetermined rule. Header information indicating that the data is rearranged and compressed in accordance with the predetermined rule is added to the compressed image processing data generated in
The image processing apparatus includes:
Information indicating that the compressed image processing data is decompressed by decompression processing corresponding to the compression processing and the header information added to the compressed image processing data is rearranged and compressed. Decompressing means for generating the image processing data for reference by rearranging the decompressed image processing data according to the predetermined rule only when
An image processing system comprising: conversion means for converting the image data with reference to the generated image processing data for reference. By generating the image processing data for reference from the compressed image processing data compressed from the reference image processing data by a predetermined compression process, and referring to the reference image processing data, An image for converting image data composed of gradation data corresponding to a plurality of element colors for a plurality of pixels into image data composed of data corresponding to a plurality of other element colors representing an output image of the image output apparatus A compressed image processing data generation device for generating image processing data in the same compression state used in a processing device,
The image processing apparatus decompresses the compressed image processing data by a decompression process corresponding to the compression process, and rearranges and compresses the compressed image processing data into header information added to the compressed image processing data. The decompression means for generating the reference image processing data by rearranging the decompressed image processing data according to the predetermined rule only when the information indicating that the information is included, and the generated decompression means Conversion means for converting the image data with reference to the image processing data for reference,
The compressed image processing data generation device can generate the compressed image processing data by rearranging and compressing the reference image processing data in accordance with a predetermined rule. A compressed image processing data generation device, wherein header information indicating that the data has been rearranged and compressed according to the predetermined rule is added to the compressed image processing data generated in step (b). Based on predetermined image processing data, image data consisting of gradation data corresponding to a plurality of element colors for each of a plurality of pixels corresponds to a plurality of other element colors representing the output image of the image output device. An image processing method for converting to image data composed of processed data,
The image processing data is compressed from the reference image processing data by a predetermined compression process, and header information indicating whether the data is rearranged and compressed according to a predetermined rule is added. And
Information indicating that the compressed image processing data is decompressed by decompression processing corresponding to the compression processing and the header information added to the compressed image processing data is rearranged and compressed. The decompression step of generating the reference image processing data by rearranging the decompressed image processing data according to the predetermined rule only when
A conversion step of converting the image data with reference to the generated image processing data for reference. The image processing data for reference is compressed by a predetermined compression process to generate compressed image processing data,
By generating the reference image processing data from the compressed image processing data and referring to the reference image processing data, a plurality of pixels corresponding to a plurality of element colors are obtained. An image processing method for converting image data composed of tone data into image data composed of data corresponding to a plurality of element colors representing an output image of an image output device,
The image processing data for reference can be generated by rearranging and compressing the reference image processing data according to a predetermined rule to generate the compressed image processing data. Header information indicating that the data has been rearranged and compressed according to the same predetermined rule,
Information indicating that the compressed image processing data is decompressed by decompression processing corresponding to the compression processing and the header information added to the compressed image processing data is rearranged and compressed. The image processing data for reference is generated by rearranging the decompressed image processing data according to the predetermined rule only when the image processing data for reference is generated, and the generated image processing data for reference is referred to. And converting the image data. By generating the image processing data for reference from the compressed image processing data compressed from the reference image processing data by a predetermined compression process, and referring to the reference image processing data, An image for converting image data composed of gradation data corresponding to a plurality of element colors for a plurality of pixels into image data composed of data corresponding to a plurality of other element colors representing an output image of the image output apparatus A compressed image processing data generation method for generating image processing data in the same compression state used in a processing apparatus,
The image processing apparatus decompresses the compressed image processing data by a decompression process corresponding to the compression process, and rearranges and compresses the compressed image processing data into header information added to the compressed image processing data. The decompression means for generating the reference image processing data by rearranging the decompressed image processing data according to the predetermined rule only when the information indicating that the information is included, and the generated decompression means Conversion means for converting the image data with reference to the image processing data for reference,
The image processing data for reference can be generated by rearranging and compressing the reference image processing data according to a predetermined rule to generate the compressed image processing data. A method for generating compressed image processing data, comprising adding header information indicating that the data has been rearranged and compressed in accordance with the predetermined rule. Based on predetermined image processing data, image data consisting of gradation data corresponding to a plurality of element colors for each of a plurality of pixels corresponds to a plurality of other element colors representing the output image of the image output device. An image processing program for causing a computer to perform a function of converting to image data composed of processed data,
The image processing data is compressed from the reference image processing data by a predetermined compression process, and header information indicating whether the data is rearranged and compressed according to a predetermined rule is added. And
Information indicating that the compressed image processing data is decompressed by decompression processing corresponding to the compression processing and the header information added to the compressed image processing data is rearranged and compressed. The decompression function for generating the reference image processing data by rearranging the decompressed image processing data according to the predetermined rule only when
An image processing program for realizing a conversion function for converting the image data with reference to the generated image processing data for reference.

Images