Image processing device, image processing method, and computer program

The color conversion system addresses color degeneracy and saturation issues by adjusting color mapping information, ensuring colors remain distinct and vibrant in printed outputs.

JP2024160615APending Publication Date: 2024-11-14CANON KK
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
JP2023075816
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Filing Date
2023-05-01
Publication Date
2024-11-14

AI Technical Summary

Technical Problem

Existing color mapping technologies, such as 'perceptual' and 'absolute colorimetric' mapping, often result in decreased saturation and color degeneracy issues, where the distance between colors after mapping differs from the original distance, leading to colors being recognized as the same when they should be distinct.

Method used

A color conversion system that includes a correction unit to adjust color conversion information, combining first and second color conversion information to apply to specific application targets, thereby reducing color degeneracy by increasing the distance between colors in a color space.

Benefits of technology

The system effectively reduces color degeneracy by ensuring that colors maintain their distinctiveness after mapping, preserving saturation and improving color recognition in printed outputs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2024160615000001_ABST
    Figure 2024160615000001_ABST
Patent Text Reader

Abstract

To provide a technique for enabling color conversion with a small degree of color degeneracy.SOLUTION: Based on first color conversion information and second color conversion information, and / or a first application target corresponding to the first color conversion information and a second application target corresponding to the second color conversion information, color conversion information that combines the first color conversion information and the second color conversion information is generated as color conversion information to be applied to the first application target and the second application target.SELECTED DRAWING: Figure 1
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present invention relates to color mapping techniques. [Background technology]

[0002] There is known an image processing device that receives a digital document described in a specific color space, maps each color in the color space to a color gamut that can be reproduced by a printer, and outputs the result. Patent Document 1 describes "perceptual" mapping and "absolute colorimetric" mapping. Patent Document 2 describes the determination of whether or not to perform color space compression and the direction of compression for an input color image signal. [Prior art documents] [Patent documents]

[0003] [Patent Document 1] JP 2020-27948 A [Patent Document 2] Japanese Patent Application Publication No. 07-203234 Summary of the Invention [Problem to be solved by the invention]

[0004] When the "perceptual" mapping described in Patent Document 1 is performed, the saturation may be reduced even for colors that the printer can reproduce in the color space of the digital document. Furthermore, when the "absolute colorimetric" mapping is performed, color degeneration may occur in which the distance between multiple colors included in the digital document, which is outside the printer's reproduction color gamut, becomes smaller after mapping than the distance between the colors before mapping. Furthermore, in Patent Document 2, a unique compression is performed in the saturation direction on the input color image signal, so there are concerns about the effect of reducing the degree of color degeneration. The present invention provides a technology that enables color conversion that reduces the degree of color degeneration. [Means for solving the problem]

[0005] One aspect of the present invention comprises a correction means for correcting color conversion information used for color conversion, and a conversion means for performing color conversion using the color conversion information corrected by the correction means, and is characterized in that the correction means generates color conversion information by combining the first color conversion information corrected by the correction means and the second color conversion information corrected by the correction means, and / or a first application object corresponding to the first color conversion information and a second application object corresponding to the second color conversion information, as color conversion information to be applied to the first application object and the second application object. Effect of the Invention

[0006] According to the configuration of the present invention, it is possible to perform color conversion with a small degree of color degeneration. [Brief description of the drawings]

[0007] [Figure 1] FIG. 1 is a block diagram showing an example of a system configuration. [Diagram 2] 3 is a flowchart of the overall processing of the image processing device 101. [Diagram 3] 10 is a flowchart showing details of the process in step S103. [Figure 4] FIG. 4 is a schematic diagram for explaining the process of step S202. [Diagram 5] 5A and 5B are schematic diagrams for explaining a color degeneration determination process. [Figure 6] 5A and 5B are schematic diagrams illustrating color degeneration correction processing. [Figure 7] FIG. 13 is a diagram showing a correction table for expanding lightness in the lightness direction. [Figure 8] FIG. 4 is a schematic diagram for explaining the process of step S202. [Figure 9] 11 is a flowchart of a series of processes for performing color degeneration correction for each area after an area is set for a single page. [Figure 10] FIG. 4 is a diagram for explaining an example of a page of input image data input in step S101. [Figure 11] 13 is a flowchart showing the area setting process in step S303 performed on a tile-by-tile basis. [Figure 12] A diagram showing how a page can be tiled. [Figure 13] 6A and 6B are diagrams showing unit tiles after the area setting process is completed. [Figure 14] FIG. 2 is a diagram illustrating a recording head 115. [Figure 15] FIG. 13 is a diagram showing an example of a GUI display. [Figure 16] 11A and 11B are diagrams showing examples of image data to which color degeneration correction is performed. [Figure 17] 1 is a flowchart showing a gamut mapping flow. [Figure 18] 10 is a flowchart showing details of the process in step S506. [Figure 19] FIG. 11 is a diagram showing an example of a list of information acquired for each page in step S601. [Figure 20] 11A to 11C are diagrams illustrating a TBL synthesis process. [Figure 21] 13 is a flowchart of a TBL synthesis process. [Figure 22] 11A and 11B are diagrams for explaining a process of setting a combination of TBLs to be synthesized. [Diagram 23] 4 is a flowchart of a gamut mapping process. [Figure 24] FIG. 13 is a diagram for explaining a fifth embodiment. [Diagram 25] 4 is a flowchart of a gamut mapping process. [Figure 26] 10 is a flowchart showing details of the process of step S902. [Figure 27] FIG. 4 is a diagram showing an example of manuscript data. [Figure 28] 1 is a flowchart showing an overall flow. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0008] Hereinafter, the embodiments will be described in detail with reference to the attached drawings. Note that the following embodiments do not limit the invention according to the claims. Although the embodiments describe a number of features, not all of these features are essential to the invention, and the features may be combined in any manner. Furthermore, in the attached drawings, the same reference numbers are used for the same or similar configurations, and duplicated descriptions are omitted.

[0009] [First embodiment] First, the terms used in this specification are defined as follows.

[0010] (Color Gamut) A color gamut refers to the range of colors that can be reproduced in an arbitrary color space. It is also called a color reproduction range, color gamut, or gamut. In addition, a color gamut volume is an index that indicates the width of this color gamut. A color gamut volume is a three-dimensional volume in an arbitrary color space. The chromaticity points that make up the color gamut may be discrete. For example, a specific color gamut may be represented by 729 points on the CIE-L*a*b*, and the points between them may be calculated using known interpolation calculations such as tetrahedral interpolation and cubic interpolation. In such a case, the corresponding color gamut volume can be calculated and accumulated according to the interpolation calculation method, for example, the volume of a tetrahedron or cube on the CIE-L*a*b* that makes up the color gamut.

[0011] Although the color reproduction area and color gamut in this specification are not limited to a specific color space, the color reproduction area in the CIE-L*a*b* space is used as an example for explanation. Similarly, the numerical values ​​of the color reproduction area in this specification indicate the volume when cumulatively calculated in the CIE-L*a*b* space on the premise of tetrahedral interpolation.

[0012] (Gamut Mapping) Gamut mapping is a conversion process between different color gamuts, for example, mapping an input color gamut to an output color gamut. Conversion within the same color gamut is not called gamut mapping. Common examples are Perceptual, Saturation, and Colorimetric in ICC profiles. Mapping may be performed using one 3DLUT. Also, mapping may be performed after color space conversion to a standard color space. For example, if the input color space is sRGB, it is converted to the CIE-L*a*b* color space. Mapping is performed to the output color gamut on the CIE-L*a*b* color space. Mapping may be performed using a 3DLUT or a conversion formula. Also, conversion between the color space at the time of input and the color space at the time of output may be performed simultaneously. For example, the color space at the time of input may be sRGB, and at the time of output, it may be converted to RGB values ​​or CMYK values ​​specific to the recording device.

[0013] (Manuscript data) The original data refers to the entire input digital data to be processed, and may be data for one page (single page) or multiple pages. The single page data may be expressed as image data or as drawing commands. When the single page data is expressed as drawing commands, rendering may be performed based on the drawing commands to convert the data into image data before processing. The image data is image data composed of multiple pixels arranged two-dimensionally. The pixels hold information representing colors in a color space. Examples of information representing colors include RGB values, CMYK values, K values, CIE-L*a*b* values, HSV values, and HLS values.

[0014] (Color degeneracy) In this specification, color degeneracy is defined as a state where the distance between colors after mapping in a predetermined color space becomes smaller than the distance between colors before mapping when gamut mapping is performed on any two colors. Specifically, assume that there are colors A and B in a digital manuscript, and color A is converted to color C and color B is converted to color D by mapping to the printer's color gamut. In this case, color degeneracy is defined as a state where the distance between colors C and D is smaller than the distance between colors A and B. When color degeneracy occurs, colors that were recognized as different in the digital manuscript are recognized as the same color when printed. For example, in a graph, different items are made to have different colors so that they are recognized as different items. When color degeneracy occurs, different colors are recognized as the same color, which may cause a problem that different items in the graph are mistakenly recognized as the same item. The predetermined color space for calculating the distance between colors may be any color space. For example, these include the sRGB color space, Adobe RGB color space, CIE-L*a*b* color space, CIE-LUV color space, XYZ color space, xyY color space, HSV color space, and HLS color space.

[0015] <System configuration example> First, an example of the configuration of a system according to this embodiment will be described with reference to the block diagram of Fig. 1. As shown in Fig. 1, the system according to this embodiment has an image processing device 101 and a recording device 108, and is configured so that the image processing device 101 and the recording device 108 can communicate data with each other via a wired and / or wireless network 107 such as a LAN. Note that the network 107 may be a wireless communication network using a USB hub or a wireless access point, a connection using a Wifi Direct communication function, or the like.

[0016] First, a description will be given of the image processing device 101. The image processing device 101 is a computer device such as a PC (personal computer), a tablet terminal device, a smartphone, or a server.

[0017] The CPU 102 executes various types of processing using computer programs and data stored in the RAM 103. As a result, the CPU 102 controls the overall operation of the image processing device 101, and executes or controls various types of processing described as processing performed by the image processing device 101. For example, the CPU 102 acquires a command from a user via an HID (Human Interface Device) I / F (not shown), and executes various types of image processing according to the acquired command or a computer program stored in a storage medium 104.

[0018] The RAM 103 has an area for storing computer programs and data loaded from the storage medium 104, and an area for storing data received from an external device via the data transfer I / F 106. The RAM 103 also has a work area used when the CPU 102 and the image processing accelerator 105 execute processing. In this way, the RAM 103 can provide various areas as appropriate.

[0019] The storage medium 104 is a non-volatile memory device such as a hard disk. The storage medium 104 stores an OS (operating system), computer programs and data for causing the CPU 102 and the image processing accelerator 105 to execute various processes described as processes performed by the image processing device 101, and the like. The computer programs and data stored in the storage medium 104 are loaded into the RAM 103 as appropriate under the control of the CPU 102, and become targets for processing by the CPU 102 and the image processing accelerator 105.

[0020] The image processing accelerator 105 is hardware capable of executing image processing at a higher speed than the CPU 102. The image processing accelerator 105 is started by the CPU 102 writing parameters and data required for image processing to a predetermined address in the RAM 103. The image processing accelerator 105 reads the parameters and data and then executes image processing on the data. However, the image processing accelerator 105 is not an essential element, and equivalent processing may be executed by the CPU 102. Specifically, the image processing accelerator 105 is a GPU or an electric circuit designed specifically for it. The parameters may be stored in the storage medium 104 or may be obtained from an external device via the data transfer I / F 106. The data transfer I / F 106 is a communication interface for performing data communication with an external device via a network 107.

[0021] Next, a description will be given of the recording device 108. The recording device 108 is a device that has a function of printing (recording) images and characters on a print medium such as paper, and is, for example, a printer or a multifunction machine.

[0022] The CPU 111 executes various processes using computer programs and data stored in the RAM 112. As a result, the CPU 111 controls the overall operation of the recording device 108, and executes or controls various processes that will be described as processes performed by the recording device 108.

[0023] The RAM 112 has an area for storing computer programs and data loaded from the storage medium 113, and an area for storing data received from an external device via the data transfer I / F 110. The RAM 112 also has a work area used when the CPU 111 and the image processing accelerator 109 execute processing. In this way, the RAM 112 can provide various areas as appropriate.

[0024] The storage medium 113 is a non-volatile memory device such as a hard disk. The storage medium 113 stores an OS (operating system), computer programs and data for causing the CPU 111 and the image processing accelerator 109 to execute various processes described as processes performed by the recording device 108, and the like. The computer programs and data stored in the storage medium 113 are loaded into the RAM 112 as appropriate under the control of the CPU 111, and become targets for processing by the CPU 111 and the image processing accelerator 109.

[0025] The image processing accelerator 109 is hardware capable of executing image processing at a higher speed than the CPU 111. The image processing accelerator 109 is started by the CPU 111 writing parameters and data required for image processing to a predetermined address of the RAM 112. After reading the parameters and data, the image processing accelerator 109 executes image processing on the data. However, the image processing accelerator 109 is not an essential element, and equivalent processing may be executed by the CPU 111. Specifically, the image processing accelerator 109 is a GPU or an electric circuit designed specifically for it. The parameters may be stored in the storage medium 113 or may be obtained from an external device via the data transfer I / F 110. The data transfer I / F 110 is a communication interface for performing data communication with an external device via the network 107.

[0026] Here, we will explain the image processing performed by the CPU 111 or the image processing accelerator 109. The image processing is, for example, processing to generate data indicating the ink dot formation positions in each scan by the print head 115 based on the print data acquired from the image processing device 101. The CPU 111 or the image processing accelerator 109 performs color conversion processing and quantization processing of the acquired print data.

[0027] The color conversion process is a process of separating colors into ink densities to be handled by the recording device 108. For example, the acquired recording data includes image data representing an image. If the image data is data representing an image in color space coordinates such as sRGB, which is the representation color of a monitor, the data representing the image in the sRGB color coordinates (R, G, B) is converted into ink data (CMYK) handled by the recording device 108. The color conversion method is realized by a matrix calculation process, a process using a three-dimensional LUT (lookup table), a four-dimensional LUT, or the like.

[0028] The recording device 108 of this embodiment uses black (K), cyan (C), magenta (M), and yellow (Y) inks, as an example. Therefore, RGB image data is converted into image data having 8-bit color information for each of K, C, M, and Y. The color information for each color corresponds to the amount of each ink applied. Although the number of ink colors is exemplified by four colors, K, C, M, Y, and K, other ink colors, such as light-density light cyan (Lc), light magenta (Lm), and gray (Gy) inks, may be used to improve image quality. In that case, ink signals corresponding to those colors are generated.

[0029] After the color conversion process, a quantization process is performed on the ink data. The quantization process is a process for reducing the number of gradation levels of the ink data. In this embodiment, quantization is performed using a dither matrix in which threshold values ​​for comparison with the ink data value for each pixel are arranged. After the quantization process, binary data is ultimately generated that indicates whether or not a dot will be formed at each dot formation position.

[0030] After image processing, the binary data is transferred to the recording head 115 by the recording head controller 114. At the same time, the CPU 111 performs recording control via the recording head controller 114 to operate a carriage motor that operates the recording head 115, and further to operate a transport motor that transports the print medium. The recording head 115 scans over the print medium, and an image is formed on the print medium by the recording head 115 ejecting ink droplets onto the print medium.

[0031] In the following, the recording head 115 will be described as having recording nozzle rows (115c, 115m, 115y, 115k) for four color inks of cyan (C), magenta (M), yellow (Y), and black (K). The recording head 115 will be described with reference to FIG.

[0032] In this embodiment, an image is recorded in a unit area of ​​one nozzle row by multiple scans N times. The recording head 115 has a carriage 116, nozzle rows 115k, 115c, 115m, and 115y, and an optical sensor 118. The carriage 116 carrying the nozzle rows 115k, 115c, 115m, and 115y and the optical sensor 118 can be moved back and forth along the X direction (main scanning direction) in the figure by the driving force of a carriage motor transmitted via a belt 117. As the carriage 116 moves in the X direction relative to the printing medium, ink droplets are ejected in the gravity direction (-Z direction in the figure) from each nozzle of the nozzle rows 115k, 115c, 115m, and 115y based on the recording data. As a result, an image of 1 / N main scans is recorded on the printing medium placed on the platen 119. When one main scan is completed, the print medium is transported along a transport direction that intersects with the main scan direction (-Y direction in the figure) a distance corresponding to the width of 1 / Nth of a main scan. Through these operations, an image the width of one nozzle row is recorded on the print medium over N multiple scans. By alternately repeating such main scans and transport operations, an image is gradually formed on the print medium. In this way, it is possible to control so that image recording on a specified area is completed.

[0033] <Overall flow> The overall processing of the image processing device 101 will be described with reference to the flowchart in Fig. 2. In this embodiment, the processing according to the flowchart in Fig. 2 makes it possible to increase the distance between colors in a predetermined color space for color combinations that cause color degeneration, thereby reducing the degree of color degeneration.

[0034] 2 is realized, for example, by the CPU 102 reading a computer program stored in the storage medium 104 into the RAM 103 and executing the program. Note that a part or all of the processing according to the flowchart in FIG. 2 may be executed by the image processing accelerator 105.

[0035] In step S101, the CPU 102 acquires manuscript data stored in the storage medium 104 into the RAM 103. Note that the method for acquiring manuscript data into the RAM 103 is not limited to a specific method. For example, the CPU 102 may acquire manuscript data received from an external device via the data transfer I / F 106 into the RAM 103.

[0036] Then, the CPU 102 performs color information acquisition to acquire image data (input image data) including color information from the original data acquired in the RAM 103. The image data includes values ​​representing colors expressed in a predetermined color space as color information. In color information acquisition, values ​​representing colors are acquired from the original data. Examples of values ​​representing colors include sRGB data, Adobe RGB data, CIE-L*a*b* data, CIE-LUV data, XYZ color system data, xyY color system data, HSV data, and HLS data.

[0037] In step S102, the CPU 102 performs color information conversion on the image data using color conversion information stored in advance in the storage medium 104. The color conversion information according to this embodiment is a gamut mapping table, and gamut mapping is performed on the color information of each pixel of the image data. The image data after gamut mapping is stored / saved in the RAM 103 or the storage medium 104 by the CPU 102. Specifically, the gamut mapping table is a three-dimensional lookup table. The three-dimensional lookup table can calculate a combination of output pixel values ​​(Rout, Gout, Bout) for a combination of input pixel values ​​(Rin, Gin, Bin). When the input pixel values ​​Rin, Gin, and Bin each have 256 gradations, it is preferable to use table Table 1

[0256]

[0256]

[0256] [3], which has a total of 16,777,216 sets of output pixel values ​​of 256 x 256 x 256, as the gamut mapping table.

[0038] In this embodiment, the color conversion of the image data is performed using such a gamut mapping table. Specifically, the CPU 102 performs the following process on each pixel (each pixel having color information (Rin, Gin, Bin)) of the image data acquired in step S101, thereby acquiring image data in which each pixel has color information (Rout, Gout, Bout).

[0039] Rout=Table1[Rin][Gin][Bin][0]...(Formula 1) Gout=Table1[Rin][Gin][Bin][1]...(Formula 2) Bout=Table1[Rin][Gin][Bin][2]...(Formula 3) Also, known techniques for reducing the table size of the gamut mapping table may be used, such as reducing the number of grids in the gamut mapping table from 256 grids to, for example, 16 grids and determining the output value by interpolating table values ​​of multiple grids.

[0040] In step S103, the CPU 102 creates a color degeneration correction table (TBL) using the image data acquired in step S101, the image data after gamut mapping acquired in step S102, and the gamut mapping table. The format of the color degeneration correction table is the same as the format of the gamut mapping table. Details of the process in step S103 will be described later.

[0041] In step S104, the CPU 102 generates corrected image data that has been subjected to color degeneration correction by converting color information of the image data acquired in step S101 using the table after color degeneration correction created in step S103. The generated corrected image data is stored / saved in the RAM 103 or the storage medium 104 by the CPU 102.

[0042] In step S105, the CPU 102 outputs the corrected image data generated in step S104 to an external device via the data transfer I / F 106. For example, the CPU 102 may generate print data by converting the corrected image data into data in a print format, and output the print data to the recording device 108. The gamut mapping may be mapping from the sRGB color space to the color reproduction gamut of the recording device 108. In this case, it is possible to suppress a decrease in saturation and color difference due to gamut mapping into the color reproduction gamut of the recording device 108.

[0043] Next, details of the process in step S103 above will be described with reference to the flowchart in Fig. 3. In step S201, CPU 102 detects unique color information contained in the image data acquired in step S101, and registers the detected color information in a unique color list stored / preserved in RAM 103 or storage medium 104. The unique color list is initialized by CPU 102 at the start of the process in step S201 (emptying the unique color list).

[0044] The CPU 102 performs a color information detection process for each pixel included in the image data. The CPU 102 then determines whether the color information of the pixel is different from the unique color information detected up to that point, and if it determines that the color information of the pixel is unique color information, it registers the color information of the pixel in the unique color list. As a method of determination, it determines whether the color information of the target pixel is color information included in the unique color list, and if not, it registers the color information of the target pixel in the unique color list. Through such processing, it is possible to register the unique color information included in the image data in the unique color list.

[0045] In the above, if the image data is sRGB data, each has 256 gradations, and therefore unique color information is detected from a total of 16,777,216 colors, 256 x 256 x 256. In this case, the amount of color information becomes enormous, and the processing speed decreases. Therefore, the CPU 102 may detect unique color information discretely. For example, the number of colors may be reduced from 256 gradations to 16 gradations, and then the unique color information may be detected. When reducing the number of colors, it is sufficient to reduce the number of colors to the color information of the nearest grid. As described above, unique color information can be detected from a total of 4096 colors, 16 x 16 x 16, and the processing speed is improved.

[0046] In step S202, the CPU 102 detects the number of color-degenerated combinations of color information among the unique color information combinations included in the image data based on the unique color list generated in step S201. The process of step S202 will be described with reference to the schematic diagram of FIG.

[0047] A color gamut 401 is the color gamut of the input image data. A color gamut 402 is the color gamut of the image data generated from the input image data by gamut mapping in step S102. The input image data includes color information 403 and color information 404. The color information 405 is color information obtained by performing gamut mapping on the color information 403. The color information 406 is color information obtained by performing gamut mapping on the color information 404. If a color difference 408 between the color information 405 and the color information 406 is smaller than a color difference 407 between the color information 403 and the color information 404, it is determined that color degeneration occurs. The determination process is repeated the number of times corresponding to the number of combinations of color information registered in the unique color list. The Euclidean distance in the color space is used as a method for calculating the color difference. In this embodiment, the Euclidean distance in the CIE-L*a*b* color space (hereinafter, referred to as color difference ΔE) is used as a suitable example for explanation. Since the CIE-L*a*b* color space is a visually uniform color space, the Euclidean distance can be approximated to the amount of change in color information. Therefore, when the Euclidean distance in the CIE-L*a*b* color space is small, humans perceive the color information as being closer, and when it is large, humans perceive the color information as being farther apart. Color information in the CIE-L*a*b* color space is represented in a color space with three axes, L*, a*, and b*. Color information 403 is represented by L403, a403, and b403. Color information 404 is represented by L404, a404, and b404. Color information 405 is represented by L405, a405, and b405. Color information 406 is represented by L406, a406, and b406. If the input image data is represented in another color space, it is converted to the CIE-L*a*b* color space using a known technique. Color difference 407 (ΔE 407 ) and color difference 408 (ΔE 408 ) can be calculated according to the following (Equation 4) and (Equation 5), respectively.

[0048]

number

[0049] ΔE 408 is ΔE 407 If it is smaller than ΔE408 If the difference in color information is not large enough to distinguish the difference, it is determined that there is color degeneracy. This means that if the color information 405 and the color information 406 have a color difference that can be distinguished as different color information based on human visual characteristics, it can be determined that there is no need to correct the color difference. Based on visual characteristics, the color difference ΔE that can be distinguished as different color information is 2.0. In other words, ΔE 408 is ΔE 407 is smaller than ΔE 408 If it is smaller than 2.0, it may be determined that color degeneration occurs.

[0050] In step S203, CPU 102 determines whether or not the "number of combinations of color information that are color-degenerated" detected in step S202 is 0. If the result of this determination is that the "number of combinations of color information that are color-degenerated" is 0, processing proceeds to step S204. On the other hand, if the "number of combinations of color information that are color-degenerated" is not 0, it is determined that the image data requires color degeneration correction, and processing proceeds to step S205. In step S204, CPU 102 sets the image data to be excluded from color degeneration correction (no correction) since the image data does not require color degeneration correction.

[0051] On the other hand, color degeneration correction changes color information. Therefore, color changes occur even for combinations of color information that are not color degenerated, resulting in unnecessary color changes. Therefore, the need for color degeneration correction may be determined based on the total number of unique color information combinations and the number of color information combinations that are color degenerated. Specifically, it may be determined that color degeneration correction is necessary when the number of color information combinations that are color degenerated is more than half of the total number of unique color information combinations. In this way, the adverse effects of color changes caused by color degeneration correction can be suppressed.

[0052] In step S205, the CPU 102 performs color degeneration correction on the combination of colors that degenerate based on the image data, the image data after gamut mapping, and the gamut mapping table. Details of the process in step S205 will be described with reference to FIG.

[0053] Color information 403 and color information 404 are input color information included in the input image data. Color information 405 is color information obtained by converting color information 403 using gamut mapping. Color information 406 is color information obtained by converting color information 404 using gamut mapping. In FIG. 4, the combination of color information 403 and color information 404 indicates color degeneracy. Thus, color degeneracy can be corrected by separating color information 405 and color information 406 from each other by a color distance in a predetermined color space. Specifically, a correction process is performed to increase the color distance between color information 405 and color information 406 beyond the color distance at which the color information can be distinguished as different colors based on human visual characteristics. The color distance at which the color information can be distinguished as different colors based on visual characteristics is ΔE of 2.0 or more. More preferably, ΔE 407 It is desirable that the color degeneration correction process is approximately equal to that of the combinations of color information that are subject to color degeneration. The results of color degeneration correction for the number of combinations of color information are managed by storing the color information before and after correction in a table. In FIG. 4, the color information is color information in the CIE-L*a*b* color space. Therefore, it is also possible to convert the color information into the color space of the input image data and the output image data. In that case, the color information before correction in the color space of the input image data and the color information after correction in the color space of the output image data are stored in a table.

[0054] Next, the above-mentioned color degeneration correction will be described in detail. 408 The color difference correction amount 409 that widens the color difference ΔE is calculated from the above. The color difference ΔE that can be recognized as different color information due to visual characteristics is 2.0 and ΔE 408 The difference between the two is the color difference correction amount 409. More preferably, ΔE 407 and ΔE 408 The difference between these is the color difference correction amount 409. The result of correcting the color information 405 by the color difference correction amount 409 on the extension line of the color information 405 from the color information 406 in the CIE-L*a*b* color space is color information 410. The color information 410 is obtained by subtracting ΔE 408The color difference ΔE between the color information 406 and the color information 410 is the sum of the color difference ΔE and the color difference correction amount 409. In the above, the color information 406 is on an extension line from the color information 405, but this is not limited to this in the present embodiment. 408 As long as the color difference obtained by combining the amount of color difference correction 409 and the color difference correction amount 409 is different, the direction may be any of the lightness direction, saturation direction, and hue angle direction in the CIE-L*a*b* color space. Also, the direction may be a combination of the lightness direction, saturation direction, and hue angle direction, not just one direction. Furthermore, in the above, the color degeneration is corrected by changing the color information 405, but the color information 406 may be changed. Also, both the color information 405 and the color information 406 may be corrected. When correcting the color information 406, since it cannot be corrected to the outside of the color gamut 402, the color information 406 is corrected (moved) to the boundary surface of the color gamut 402. Then, the color degeneration correction may be performed by correcting the color information 405 for the insufficient color difference ΔE.

[0055] Next, in step S206, CPU 102 changes the gamut mapping table (GMTBL) using the result of the color degeneration correction performed in step S205. The gamut mapping table before the change is a table for converting color information 403, which is an input color, into color information 405, which is an output color. Based on the result of the color degeneration correction performed in step S205, the gamut mapping table is changed to a table in which color information 403, which is an input color, is converted into color information 410, which is an output color. The change of the gamut mapping table is repeated the number of times equal to the number of color combinations that are color degenerated.

[0056] In other words, when CPU 102 determines that the first color information included in a first region in the image data and the second color information included in a second region in the image data are a combination of color degenerate information, CPU 102 corrects the color conversion information so that the color difference between the first color information and the second color information before and after color conversion is within a predetermined color difference.

[0057] By carrying out the above-mentioned processing, the gamut mapping table after the color degeneration correction can be applied to the input image data, and the distance between colors can be increased for combinations of color information that are color degenerate among the unique color information combinations that the input image data has. As a result, color degeneration can be reduced for combinations of color information that are color degenerate. This is because, when the input image data is sRGB data, the gamut mapping table is created on the premise that the input image data has color information of 16,777,216 colors. The gamut mapping table created under this premise is created taking into consideration color degeneration and saturation even for color information that the input image data does not have. In this embodiment, the gamut mapping table can be corrected adaptively to the input image data by detecting color information that the input image data has. Then, a gamut mapping table limited only to color information that the input image data has can be created. As a result, suitable adaptive gamut mapping can be performed for the input image data, and color degeneration can be reduced.

[0058] In this embodiment, the processing has been described for the case where the input image data is one page, but the input image data may be multiple pages. When the input image data is multiple pages, the processing according to the flowchart in Fig. 2 may be performed for all pages. Furthermore, the processing according to the flowchart in Fig. 2 may be performed for each page. This makes it possible to reduce the degree of color degeneration caused by gamut mapping even when the input image data is multiple pages.

[0059] However, when correction is performed for each page, a new TBL after color degeneration correction is created for each page. When the TBL after color degeneration correction is applied to image data in the image processing device 101 having the configuration shown in Fig. 1, the TBL after color degeneration correction stored in the RAM 103, for example, is transferred to a cache memory of the CPU 102 and applied. At this time, if the TBL after color degeneration correction created for each page is the same, the transfer process is completed only once, but if the TBL after color degeneration correction is different for each page, the transfer process is generated as many times as the number of TBL after color degeneration correction, and an increase in the overall processing time due to the increase in the number of pages becomes an issue.

[0060] An example of image data of an original to be subjected to color degeneration correction is shown in Fig. 16. Fig. 17 shows a gamut mapping flow in this embodiment. In Fig. 17, the same step numbers are given to the same processing steps as those shown in Fig. 2, and the description of those processing steps is omitted.

[0061] In step S501, the CPU 102 analyzes pages of image data that have not yet been analyzed. In step S502, the CPU 102 determines whether or not color degeneration correction is necessary based on the results of the analysis in step S501. If it is determined that color degeneration correction is necessary, the process proceeds to step S503, and if it is determined that color degeneration correction is not necessary, the process proceeds to step S505.

[0062] Here, the criterion for determining that color degeneration correction is necessary may be when color degeneration occurs as a result of mapping the input colors in the page, or when color degeneration occurs at a predetermined rate or more in the input colors in the page. Here, it is assumed that color degeneration correction is necessary for all of the image data (original pages) 1600, 1602, and 1604 of the original in FIG.

[0063] In step S503, the CPU 102 creates a color degeneration-corrected TBL for the page for which it has been determined that color degeneration correction is necessary. The method of creating the color degeneration-corrected TBL is the same as in step S103.

[0064] In step S504, the CPU 102 stores / preserves the color degeneration corrected TBL created in step S504 in the RAM 103 or the storage medium 104. In step S505, the CPU 102 determines whether the analysis process in step S501 has been performed on image data of all pages.

[0065] If it is determined that the analysis process of step S501 has been performed on the image data of all pages, the process proceeds to step S506. On the other hand, if there is still image data of pages that have not yet been subjected to the analysis process of step S501, the process proceeds to step S501.

[0066] In step S506, the CPU 102 performs a synthesis process for the color degeneration corrected TBL. Details of the process in step S506 will be described with reference to the flowchart in FIG.

[0067] In FIG. 16, a manuscript page 1600 has a pie chart object 1601, a manuscript page 1602 has a pie chart object 1603, and a manuscript page 1604 has an illustration object 1605 and an illustration object 1606.

[0068] In step S601, CPU 102 acquires information on the input color of the page for which the color degeneration corrected TBL was created in step S503 (information on the input color of the page, its hue angle, and whether it is a color common to colors present on other pages).

[0069] 19 shows an example of a list of information acquired for each page in step S601. Table 1901 is a list of information acquired from manuscript page 1604, table 1902 is a list of information acquired from manuscript page 1603, and table 1903 is a list of information acquired from object 1605 in manuscript page 1604.

[0070] In step S602, the CPU 102 determines whether or not there is a color common to other pages in the input colors of each page that has been subjected to color degeneration correction. The common color may be the exact same color or a color within a predetermined color difference. An example of color difference calculation is shown below.

[0071] The color difference is calculated using Euclidean distance in a color space, and in this embodiment, as a suitable example, Euclidean distance in the CIE-L*a*b* color space (hereinafter, referred to as color difference ΔE) is used. Since the CIE-L*a*b* color space is a perceptually uniform color space, numerical color changes and differences in the CIE-L*a*b* color space can approximate changes perceived by the human eye. Take input color 1607, which is one of the input colors of original page 1600, and input color 1610, which is one of the input colors of original page 1602, as an example.

[0072] An input color 1607 is represented by L1607, a1607, and b1607 in the CIE-L*a*b* color space, and an input color 1610 is represented by L1610, a1610, and b1610. A color difference ΔE 1611 between the input color 1607 and the input color 1610 can be calculated according to the following (Equation 6).

[0073]

number

[0074] Color difference ΔE 1611 is 0, the input color 1607 and the input color 1610 are the same color and are determined to be common colors. 1611However, if the difference in color is not large enough to distinguish it, the human eye cannot recognize it as a different color, so it can be determined that the input color 1607 and the input color 1611 are common colors. In terms of visual characteristics, the color difference ΔE that can be distinguished as different colors is 2.0. In other words, the color difference ΔE 1611 is between 0 and 2.0, the color is determined to be a common color.

[0075] In this example, one common color exists between manuscript page 1602 and manuscript page 1604, and does not exist in any other page combinations. The "Common Color?" tab in table 1901 shown in Fig. 19 indicates whether the corresponding input color is a common color, and the "Common Color" tab indicates which input colors the input color is common to.

[0076] Next, in step S602, the CPU 102 judges whether or not there is a TBL that can be combined. Here, the conditions for judging that the TBLs can be combined will be described. The condition for the first TBL and the second TBL to be combined is that there is no common color between the pages on which the TBLs are created. An example will be described with reference to Figs. 16 and 19. A TBL is created for the three original pages shown in Fig. 16. That is, the first TBL is created for page 1600, the second TBL is created for page 1602, and the third TBL is created for page 1604. Here, when judging whether the second TBL and the third TBL can be combined, Table 1901, which is the input color information of the second TBL, and Table 1903, which is the input color information of the third TBL, are referenced. It is found that a common color exists in the image data 1602, and that this is the input color 1614, that is, color information that exists in the image data 1604. Here, the input color 1613 and the input color 1614 are common colors at the time of input, but the corrections performed may differ depending on the color distribution of each page. Therefore, the output colors after each is corrected by color degeneration correction are not necessarily common colors. If the output color corresponding to the input color 1613 and the output color corresponding to the input color 1614 are not common colors, the correction process of outputting different output colors for the same input color cannot be expressed by TBL. From the above, the second TBL and the third TBL are determined to be impossible to combine because a common color exists in the input colors of the created image data. On the other hand, the first TBL and the second TBL can be combined. This is because a common color exists in the image data 1602, but the common input color does not exist in the image data 1600. Similarly, the first TBL and the third TBL can also be combined. However, for example, the TBL obtained by combining the first TBL and the second TBL and the third TBL cannot be combined because a common color exists between the combined second TBL and the input color of the third TBL to be combined. In this example, the three TBLs are reduced to two by the compositing process. If there are no common colors on all pages, it is possible to composite all TBLs.

[0077] If the above determination is made in step S602 and it is determined that no synthesizable TBL exists, the process according to the flowchart in FIG. 18 ends, and the process proceeds to step S507.

[0078] On the other hand, if it is determined that there is a TBL that can be combined, the process proceeds to step S603. In step S603, the CPU 102 performs a TBL combination process. The TBL combination process will be described with reference to FIG.

[0079] Gamut mapping table 2001 shows the gamut mapping table used when performing gamut mapping in step S102. Each row of gamut mapping table 2001 describes the RGB values ​​(output values) that are output as a result of performing gamut mapping for the input RGB values ​​(input values). The results of performing color degeneration correction on this gamut mapping table 2001 are TBL after color degeneration correction 2002 and TBL after color degeneration correction 2003.

[0080] In the color degeneration-corrected TBL 2002, color degeneration correction is performed on the fourth, sixth, and seventh rows of the gamut mapping table 2001. In the color degeneration-corrected TBL 2003, color degeneration correction is performed on the first, second, third, and eighth rows of the gamut mapping table 2001. Since the input values ​​are common to each color degeneration-corrected TBL, it is possible to combine the respective TBLs by duplicating the rows on which color degeneration correction is performed to the corresponding rows of the combined TBL. The combined TBL is the combined color degeneration-corrected TBL 2004. And, the combined color degeneration-corrected TBL 2004 is applied to the application target corresponding to the color degeneration-corrected TBL 2002 and the application target corresponding to the color degeneration-corrected TBL 2003 instead of the color degeneration-corrected TBL 2002 and the color degeneration-corrected TBL 2003.

[0081] When the TBL compositing process in step S603 is completed, the TBL compositing process in step S506 is completed, and the process proceeds to step S507. In step S507, the CPU 102 applies the combined color degeneration corrected TBL to each page in the same manner as in step S104 described above, thereby correcting the page.

[0082] By the above-mentioned processing, the number of post-color-reduction-corrected TBLs generated for each page is reduced when the input colors for each page are different, without reducing the effect of color redundancy correction, thereby reducing the TBL transfer time and shortening the overall processing time.

[0083] In this embodiment, the judgment is performed for the input color of each page, but the judgment may be performed for the color degeneration corrected TBL generated for each page, and the TBL may be composited based on the result. The TBL composite process in this case will be described with reference to the flowchart in Fig. 21. In each flowchart described below, the process at the step numbers already mentioned in the previous explanations has already been explained, so the explanation will be omitted or will be briefly explained.

[0084] In step S701, the CPU 102 sets a combination of TBLs to be composited. Here, it is assumed that the combination of the post-color degeneration correction TBL 2202 and the post-color degeneration correction TBL 2203 shown in FIG.

[0085] Next, in step S702, the CPU 102 detects the corrected grid for each TBL. For example, the first, second, third, and eighth rows in the color degeneration corrected TBL 2202 and the first, sixth, and seventh rows in the color degeneration corrected TBL 2203 correspond to the corrected grid.

[0086] Next, in step S703, the CPU 102 judges whether or not there is an identical grid to be corrected between the compositing target TBLs. In this example, since the first row corresponds, it is judged that "there is an identical grid to be corrected between the compositing target TBLs" (YES), and the process proceeds to step S704.

[0087] Here, for example, when the combination of the TBL 2201 after color degeneration correction and the TBL 2202 after color degeneration correction is set as the combination to be combined, there is no identical grid to be corrected. Therefore, it is determined that "there is no identical grid to be corrected between the TBLs to be combined" (NO), and the process proceeds to step S603.

[0088] In step S704, the CPU 102 judges whether or not the correction values ​​are the same. Here, the correction values ​​being the same may mean that the correction values ​​are the same for colors, or may be within a predetermined color difference. The method of calculating the color difference is as described above. In this example, the process proceeds assuming that the same colors are the same. For example, the correction values ​​of the first row of the TBL 2202 after color degeneration correction are Rout1', Gout1', and Bout1', while the correction values ​​of the first row of the TBL 2203 after color degeneration correction are Rout1", Gout1", and Bout1", which are not identical. Therefore, in this case, the result of the judgment is NO, and the TBL combination process is not performed. Here, for example, if the TBL 2201 after color degeneration correction and the TBL 2103 after color degeneration correction are the combination to be combined, the sixth and seventh rows are the judgment targets of this process. In this case, the correction values ​​of the TBL 2201 after color degeneration correction and the TBL 2103 after color degeneration correction are both Rout6', Gout6', and Bout6' and Rout7', Gout7', and Bout7', which are the same correction values. Therefore, in this case, the result of the judgment is YES, and the process proceeds to step S603.

[0089] In step S705, the CPU 102 determines whether the above process has been performed for all combinations. At this time, since it may be possible to further combine another TBL with the combined TBL, the combinations to be processed also include the combined TBL.

[0090] If the result of such determination is that the above processing has been performed for all combinations, the processing according to the flowchart in Fig. 21 ends, and the processing proceeds to step S507. In step S507, CPU 102 corrects each page by applying the combined color degeneration corrected TBL to the page in the same manner as in step S104 above. On the other hand, if any combinations remain for which the above processing has not been performed, the processing proceeds to step S701.

[0091] By the above-mentioned process, the number of post-color-reduction-corrected TBLs generated for each page is reduced without reducing the effect of color-reduction correction, except when the TBL values ​​are different in the same grid, thereby reducing the TBL transfer time and shortening the overall processing time.

[0092] 15 may be displayed on a display screen (not shown) of the image processing device 101 to enable various settings related to correction in response to user operations. User operations on the GUI are input by the user operating a user interface such as a keyboard, mouse, or touch panel connected to the image processing device 101, for example.

[0093] In "Color correction," radio buttons are provided to enable the setting of performing driver correction (first row), performing ICM correction (second row), or performing no correction (third row), and the setting corresponding to the radio button selected by the user's operation is made.

[0094] "Adaptive gamut mapping" has radio buttons that allow the user to set whether gamut mapping is performed (first row) or not (second row), and the setting corresponding to the radio button selected by the user's operation is made.

[0095] Note that the above-described GUI configuration, setting contents, setting methods, GUI operation methods, devices for displaying the GUI, etc. are merely examples and are not intended to be limiting.

[0096] [Second embodiment] In the following embodiments including this embodiment, the difference from the first embodiment will be described, and unless otherwise specified, it is assumed that the embodiment is the same as the first embodiment. In the above-mentioned first embodiment, color degeneration correction is performed for each single color. Therefore, depending on the combination of color information in the input image data, the degree of color degeneration is reduced, but a change in color tone may occur. Specifically, when color degeneration correction is performed on two color information with different hue angles, if the color information is changed by changing the hue angle, the color tone will be different from the color tone of the color information in the input image data. For example, if color degeneration correction is performed on blue and purple colors by changing the hue angle, the purple color will change to red. If the color tone changes, the user may be reminded of a device problem such as poor ink ejection.

[0097] In the first embodiment described above, the color degeneration correction is repeated for the number of combinations of unique color information that the input image data has. Therefore, the distance between the color information can be reliably increased. However, when the number of combinations of unique color information that the input image data has increases, the distance between the color information may become smaller with respect to other unique color information after the change as a result of changing the color information to increase the distance between the color information. Therefore, the CPU 102 needs to repeat the color degeneration correction in step S205 so that the expected distance between the color information is obtained for all combinations of unique color information that the input image data has. However, the processing to increase the distance between the color information becomes enormous, so the processing time increases. In this embodiment, the color degeneration correction is performed in the same correction direction for multiple unique color information as one color information group for each predetermined hue angle. In order to correct multiple unique color information as one color information group, a unique color information serving as a reference is selected from the color information group. The correction direction is limited to the lightness direction, so that the change in color tone can be suppressed. By correcting a plurality of unique color information as one color information group, it becomes unnecessary to process all combinations of color information contained in the input image data, and processing time can be reduced.

[0098] FIG. 5 is a schematic diagram for explaining the color degeneration judgment process in this embodiment, and is a diagram showing two axes, the a* axis and the b* axis, in the CIE-L*a*b* color space, in a plane (a*b* plane). The hue range 501 represents a range in which a plurality of unique color information within a predetermined hue angle is treated as one color information group. In FIG. 5, the hue angle of 360 degrees is divided into six equal parts, so the hue range 501 represents a range from 0 degrees to 60 degrees. The hue range is preferably a hue range that can be recognized as the same color. For example, the hue angle in the CIE-L*A*B* color space is in units of 30 degrees to 60 degrees. When it is 60 degrees, it is possible to separate six colors, red, green, blue, cyan, magenta, and yellow. When it is 30 degrees, it is also possible to separate by color information between the color information separated by 60 degrees. As shown in FIG. 5, the hue range may be determined fixedly. It may also be determined by unique color information included in the input image data. The CPU 102 detects the number of color information combinations that are color degenerate within the hue range 501 by the above-mentioned process for the unique color information combinations that the input image data has. In FIG. 5, color information 504, color information 505, color information 506, and color information 507 represent input colors. In FIG. 5, it is determined whether or not color degeneration occurs for the combinations of four color information, color information 504, color information 505, color information 506, and color information 507. This process is repeated for all hue ranges. In this way, the number of color information combinations that are color degenerate for each hue range can be detected. In FIG. 5, six combinations of color information that are color degenerate are detected. In this embodiment, the hue range is set for every 60 degrees of hue angle, but this is not limited to this. For example, the hue range may be determined for every 30 degrees of hue angle, or the hue range may be determined without dividing equally. Preferably, the range of hue angles is set as the hue range so as to be visually uniform. Since color information in the same color information group is visually perceived as the same color information, color degeneration correction can be performed on the same color information. Furthermore, for each hue range, the number of combinations of color information that are color degenerated in two hue ranges, including adjacent hue ranges, may be detected.

[0099] FIG. 6 is a schematic diagram for explaining the color degeneration correction process in this embodiment. FIG. 6 is a diagram showing two axes, the L* axis and the C* axis in the CIE-L*a*b* color space, in a plane. L* represents lightness, and C* represents saturation. In FIG. 6, color information 601, color information 602, color information 603, and color information 604 are input colors. Color information 601, color information 602, color information 603, and color information 604 represent color information included within the range (hue angle range) of the hue range 501 in FIG. 5. Color information 605 is color information obtained after the color information 601 is color-converted by gamut mapping. Color information 606 is color information obtained after the color information 602 is color-converted by gamut mapping. Color information 607 is color information obtained after the color information 603 is color-converted by gamut mapping. Color information 604 after color conversion by gamut mapping represents the same color information.

[0100] First, the CPU 102 determines unique color information that serves as the basis for the color degeneration correction process for each hue range. As a suitable example, the maximum lightness color, the minimum lightness color, and the maximum saturation color are determined as the reference colors. In Fig. 6, color information 601 is the maximum lightness color, color information 602 is the minimum lightness color, and color information 603 is the maximum saturation color.

[0101] Next, the CPU 102 calculates a correction factor R from the number of unique color information combinations and the number of color-degenerated color information combinations in the target hue range for each hue range. A suitable calculation formula is shown below.

[0102] Correction rate R = number of degenerate color information combinations / number of unique color information combinations The correction rate R is smaller if the number of combinations of color information that are color-degenerated is smaller, and is larger if the number of combinations of color information that are color-degenerated is larger. As described above, the more combinations of color information that are color-degenerated, the stronger the color degeneration correction can be applied. In FIG. 6, it is shown that there are four colors within the range of the hue range 501 in FIG. 5. Therefore, the number of unique combinations of color information is six. Of these, the number of combinations of color information that are color-degenerated is four. In this case, the correction rate R is 0.667. In FIG. 6, all combinations are color-degenerated by gamut mapping. However, even after gamut mapping, if the difference is greater than the minimum distinguishable color difference, the color information is not considered to be color-degenerated. Therefore, the combinations of color information 604 and color information 603, and color information 604 and color information 602 are not considered to be color-degenerated color information. The minimum distinguishable color difference ΔE is 2.0.

[0103] Next, the CPU 102 calculates a correction amount for each hue range from the correction rate R, the maximum lightness color, the minimum lightness color, and the maximum saturation color. As the correction amount, a correction amount Mh on the side brighter than the maximum saturation color and a correction amount Ml on the side darker than the maximum saturation color are calculated.

[0104] Color information 601, which is the maximum lightness color, is represented as L601, a601, and b601. Color information 602, which is the minimum lightness color, is represented as L602, a602, and b602. Color information 603, which is the maximum saturation color, is represented as L603, a603, and b603. A suitable correction amount Mh is a value obtained by multiplying the color difference ΔE between the maximum lightness color and the maximum saturation color by a correction rate R. A suitable correction amount Ml is a value obtained by multiplying the color difference ΔE between the maximum saturation color and the minimum lightness color by a correction rate R. The calculation formulas for the correction amounts Mh and Ml are shown in the following (Formula 7) and (Formula 8), respectively.

[0105]

number

[0106] As described above, the color difference ΔE to be retained after gamut mapping can be calculated. The color difference ΔE to be retained after gamut mapping is the color difference ΔE before gamut mapping. In FIG. 6, the correction amount Mh is a value obtained by multiplying the color difference ΔE 608 by the correction rate R, and the correction amount Ml is a value obtained by multiplying the color difference ΔE 609 by the correction rate R. Furthermore, if the color difference ΔE before gamut mapping is larger than the minimum distinguishable color difference, the color difference ΔE to be retained may be larger than the minimum distinguishable color difference ΔE. By processing as described above, the color difference ΔE reduced by gamut mapping can be restored to a distinguishable color difference ΔE. Furthermore, the color difference ΔE to be retained may be the color difference ΔE before gamut mapping. In this case, it is possible to approach the ease of distinction before gamut mapping. Furthermore, the color difference ΔE to be retained may be larger than the color difference before gamut mapping. In this case, it is possible to make it easier to distinguish than before gamut mapping.

[0107] Next, CPU 102 generates a color degeneration post-correction table for each hue range. The color degeneration post-correction table is a correction table for expanding the lightness in the lightness direction based on the lightness of the maximum saturation color, the correction amount Mh, and the correction amount Ml. In FIG. 6, the lightness of the maximum saturation color is the lightness L603 of the color information 603. The correction amount Mh is the color difference ΔE608. The correction amount Ml is the color difference ΔE609. A method for creating a table that expands the lightness in the lightness direction will be described below.

[0108] The correction table that expands the lightness in the lightness direction is a 1DLUT (one-dimensional lookup table). The input is the lightness before correction, and the output is the lightness after correction. The lightness after correction is determined by three points: the minimum lightness after correction, the lightness of the maximum saturation color after gamut mapping, and the maximum lightness after correction. The maximum lightness after correction is the lightness obtained by adding a correction amount Mh to the lightness of the maximum saturation color after gamut mapping. The minimum lightness after correction is the lightness obtained by subtracting a correction amount Ml from the lightness of the maximum saturation color after gamut mapping. The table that expands the lightness in the lightness direction is created by linearly changing the minimum lightness after correction and the lightness of the maximum saturation color after gamut mapping, and linearly changing the lightness of the maximum saturation color after gamut mapping to the minimum lightness after correction. In FIG. 6, the maximum lightness before correction is the lightness L601 of the color information 601, which is the maximum lightness color. The minimum lightness before correction is the lightness L602 of the color information 602, which is the minimum lightness color. The lightness of the maximum saturation color after gamut mapping is the lightness L607 of the color information 607. The maximum lightness after correction is the lightness L610 obtained by adding the color difference ΔE608, which is the correction amount Mh, to the lightness L607. The minimum lightness after correction is the lightness L611 obtained by subtracting the color difference 609, which is the correction amount Ml, from the lightness L607. FIG. 7 shows a correction table for expanding the lightness in the lightness direction in FIG. 6. In this embodiment, as a suitable example, the color degeneration correction is performed by converting the color difference ΔE to a lightness difference. In terms of visual characteristics, the lightness difference is highly sensitive. Therefore, by converting the saturation difference to a lightness difference, even a small lightness difference can be perceived as having a color difference ΔE in terms of visual characteristics. In addition, in terms of the relationship between the sRGB color gamut and the color gamut of the recording device 108, the lightness difference is smaller than the saturation difference. Therefore, by converting to a lightness difference, the narrow color gamut can be effectively utilized. In this embodiment, as a suitable example, the lightness of the maximum saturation color is not changed. As described above, the most saturated color is not changed, so the color difference ΔE can be corrected while maintaining saturation. Correction of values ​​greater than the maximum brightness and less than the minimum brightness can be indefinite, since they are not included in the input image data. When using an interpolated correction table, values ​​greater than the maximum brightness and less than the minimum brightness are also referenced, so values ​​can be set to result in a linear change, as shown in Figure 7.As described above, the capacity of the correction table can be reduced by reducing the number of grids, and the processing time required for transferring the correction table can be reduced.

[0109] Moreover, if the maximum brightness after correction exceeds the maximum brightness of the color gamut after gamut mapping, the CPU 102 performs maximum value clipping processing. In the maximum value clipping processing, the difference between the maximum brightness after correction and the maximum brightness of the color gamut after gamut mapping is subtracted from the entire correction table. In this case, the brightness of the maximum saturation color after gamut mapping is also changed to the low brightness side. As described above, if the unique color information of the input image data is biased toward the high brightness side, the color difference ΔE can be improved by also using the brightness gradation on the low brightness side. Furthermore, if the minimum brightness after correction is lower than the minimum brightness of the color gamut after gamut mapping, the CPU 102 performs minimum value clipping processing. In the minimum value clipping processing, the difference between the minimum brightness after correction and the minimum brightness of the color gamut after gamut mapping is added to the entire correction table. As described above, if the color information of the input image data is biased toward the low brightness side, the color degeneration can be reduced by also using the brightness gradation on the high brightness side.

[0110] Next, CPU 102 applies the color degeneration correction table created for each hue range to the gamut mapping table. First, it determines which hue angle of the color degeneration correction table to apply based on the color information of the output color of the gamut mapping. For example, if the hue angle of the output color of the gamut mapping is 25 degrees, it applies the color degeneration correction table of hue range 501 in FIG. 5. Then, it applies the determined color degeneration correction table to the output color of the gamut mapping table for correction. The corrected color information is set as the new output color after gamut mapping.

[0111] As described above, by applying the color degeneration correction table created based on the reference color to color information other than the reference color, the correction direction is limited to the lightness direction, thereby suppressing changes in color tone. Furthermore, it is no longer necessary to perform color degeneration correction processing for all unique combinations of color information contained in the input image data, thereby reducing processing time.

[0112] Furthermore, the color degeneration correction table of adjacent hue ranges may be blended according to the hue angle of the output color of the gamut mapping. For example, when the hue angle of the output color of the gamut mapping is Hn degrees, the color degeneration correction table of the hue range 501 and the color degeneration correction table of the hue range 502 are blended. Specifically, the lightness value of the output color after the gamut mapping is corrected with the color correction table of the hue range 501 to obtain the lightness value Lc501. The lightness value of the output color after the gamut mapping is corrected with the color correction table of the hue range 502 to obtain the lightness value Lc502. The angle H501 is the intermediate hue angle of the hue range 501, and the angle H502 is the intermediate hue angle of the hue range 502. The corrected lightness value Lc501 and the corrected lightness value Lc502 are interpolated according to the hue angle of the output value after the gamut mapping according to each hue angle. The formula for calculating Lc is the following (Formula 9).

[0113]

number

[0114] As described above, by blending the color degeneration correction table to be applied depending on the hue angle, it is possible to reduce the abrupt change in correction strength due to a change in hue angle. If the color space of the corrected color information is different from the color space of the output color after gamut mapping, the color space is converted to make it the output color after gamut mapping. For example, if the color space of the corrected color information is the CIE-L*a*b* color space, a search is performed to make it the output color after gamut mapping.

[0115] Furthermore, if the corrected value is outside the color gamut after gamut mapping, mapping is performed to the color gamut after gamut mapping. A suitable mapping method is color difference minimum mapping that prioritizes lightness and hue. Color difference minimum mapping that prioritizes lightness and hue calculates the color difference ΔE by the following calculation formula (Formula 10). Let Ls, as, and bs be the color information of the color that exceeds the color gamut in the CIE-L*a*b* color space. Let Lt, at, and bt be the color information of the color within the color gamut after gamut mapping. Let ΔL be the lightness difference, ΔC be the saturation difference, and ΔH be the hue difference. Let Wl be the lightness weight, Wc be the saturation weight, Wh be the hue angle weight, and ΔEw be the weighted color difference. In this case, the formulas for calculating the weighted color difference ΔEw are the following (Formula 10) to (Formula 14).

[0116]

number

[0117] Because the color difference ΔE has been extended in the lightness direction, color degeneration correction can be performed more correctly by mapping with more importance placed on lightness than on saturation. In other words, the lightness weight Wl is greater than the saturation weight Wc. Furthermore, because hue has a large effect on color, mapping with more importance placed on hue than lightness and than saturation can minimize the change in color before and after correction. In other words, the hue weight Wh is greater than or equal to the lightness weight Wl and greater than the saturation weight Wc. As described above, the color difference ΔE can be corrected while maintaining the color.

[0118] Furthermore, the color space may be converted when performing color difference minimum mapping. It is known that the color change in the saturation direction is not equal to the hue in the CIE-L*a*b* color space. Therefore, if the change in the hue angle is suppressed by increasing the weight of the hue, the color is not mapped to a color of equal hue. Therefore, the color space may be converted to one in which the hue angle is bent so that the color change in the saturation direction is equal to the hue. As described above, even if weighted color difference minimum mapping is performed, the change in color can be suppressed. In FIG. 6, color information 605 after gamut mapping for color information 601 is corrected to color information 612 by the color degeneration correction table. Since color information 612 exceeds the color gamut 616 after gamut mapping, it is mapped to the color gamut 616. Color information 612 is mapped to color information 614. As a result, when the input of the corrected gamut mapping table is color information 601, the output is color information 614.

[0119] In this embodiment, a color degeneration correction table is created for each hue range. A color degeneration correction table may be created by combining adjacent hue ranges. Specifically, the number of combinations of color information that are color degenerated in the hue range 501 and the hue range 502 in FIG. 5 is detected. Next, the number of combinations of color information that are color degenerated in the hue range 502 and the hue range 503 is detected. By detecting one hue range by overlapping it, it is possible to suppress a sharp change in the number of combinations of color information that are color degenerated when crossing the hue range. In this case, a suitable hue range is preferably a hue angle range in which the two hue ranges can be combined and recognized as the same color information. For example, the hue angle in the CIE-L*A*B* color space is 30 degrees. In other words, one hue angle range is 15 degrees. In this way, it is possible to suppress a sharp change in correction strength across the hue range.

[0120] In this embodiment, a color difference ΔE is corrected in the lightness direction by treating a plurality of unique color information as one color information group. As a visual characteristic, the sensitivity to lightness difference differs depending on saturation. The sensitivity to lightness difference of low saturation is higher than that of high saturation. Therefore, the correction amount in the lightness direction may be controlled by the saturation value. In low saturation, the correction amount is small, and in high saturation, the correction amount is the above-mentioned correction amount. Specifically, when the color degeneration corrected table is applied to the gamut mapping table, the lightness value Ln before correction and the lightness value Lc after correction are divided internally by the saturation correction rate S as shown in the following (Equation 16). The saturation correction rate S is calculated by the saturation value Sn of the output color of the gamut mapping and the maximum saturation value Sm of the color gamut after gamut mapping at the hue angle of the output color of the gamut mapping as shown in the following (Equation 15).

[0121]

number

[0122] Furthermore, the amount of correction may be set to zero in the low saturation color gamut. As described above, color change on the gray axis can be suppressed. As described above, color degeneration correction can be performed according to visual sensitivity, so overcorrection can be suppressed.

[0123] [Third embodiment] In the second embodiment described above, color degeneration correction is performed for each hue range. Therefore, when the color information of the input image data has different hue angles and the brightness difference after gamut mapping is low, discrimination may decrease. When the color information is high saturation and the hue angle is different, the distance between the color information is sufficient to be discriminated even after gamut mapping. However, when the brightness difference is low, discrimination becomes difficult. In this embodiment, when the brightness difference after gamut mapping is reduced to a predetermined color difference ΔE or less, a correction is performed to increase the brightness difference, thereby suppressing the deterioration of discrimination.

[0124] The color degeneracy judgment process in this embodiment will be described. In step S202 in this embodiment, the CPU 102 detects the number of combinations of color information that are lightness degenerated among the combinations of unique color information included in the image data based on the unique color list generated in step S201. The process of step S202 in this embodiment will be described with reference to the schematic diagram of FIG.

[0125] The vertical axis in FIG. 8 is the lightness L in the CIE-L*a*b* color space. The horizontal axis is the projection onto an arbitrary hue angle plane. A color gamut 801 is the color gamut of the input image data. A color gamut 802 is the color gamut after gamut mapping in step S102. The input image data includes color information 803 and color information 804. The color information 805 is the color information after the color information 803 is color converted by gamut mapping. The color information 806 is the color information after the color information 804 is color converted by gamut mapping. If the lightness difference 808 between the color information 805 and the color information 806 is smaller than the lightness difference 807 between the color information 803 and the color information 804, it is determined that the lightness difference has decreased. This is repeated as many times as the number of combinations of unique color information included in the image data. The lightness difference in the CIE-L*a*b* color space is a suitable method for calculating the lightness difference. Color information in the CIE-L*a*b* color space is represented by a three-axis color space of L*, a*, and b*. Color information 803 is represented by L803, a803, and b803. Color information 804 is represented by L804, a804, and b804. Color information 805 is represented by L805, a805, and b805. Color information 806 is represented by L806, a806, and b806. If the input image data is represented in another color space, it is converted to the CIE-L*a*b* color space using a known technique. The calculation formulas for the lightness difference ΔL807 and the lightness difference ΔL808 are the following (Formula 17) and (Formula 18), respectively.

[0126]

number

[0127] When the lightness difference ΔL808 is smaller than the lightness difference ΔE807, it is determined that the lightness difference has decreased. Furthermore, when the lightness difference ΔL808 is not large enough to distinguish the color difference, it is determined that the color has degenerated. This means that if the color information 805 and the color information 806 have a lightness difference large enough to distinguish them as different colors based on human visual characteristics, it can be determined that there is no need to correct the lightness difference. An example of a lightness difference ΔL that can distinguish them as different colors based on visual characteristics is 0.5. In other words, when the lightness difference ΔL808 is smaller than the lightness difference ΔL807 and when the lightness difference ΔL808 is smaller than 2.0, it may be determined that the lightness difference has decreased.

[0128] Next, the color degeneration correction process in step S205 in this embodiment will be described with reference to Fig. 8. The CPU 102 calculates a correction factor T from the number of unique color information combinations in the input image data and the number of color information combinations with reduced brightness difference. A suitable calculation formula is shown below.

[0129] Correction rate T = number of color information combinations with reduced brightness difference / number of unique color information combinations The correction rate T is smaller if the number of combinations of color information with reduced brightness difference is small, and is larger if the number of combinations of color information with reduced brightness difference is large. As described above, the more combinations of color information with reduced brightness difference there are, the stronger the color degeneration correction can be applied.

[0130] Next, brightness difference correction is performed based on the correction rate T and the brightness before gamut mapping. The brightness Lc after brightness difference correction is the value obtained by internally dividing the difference between the brightness Lm before gamut mapping and the brightness Ln after gamut mapping by the correction rate T. The calculation formula is as follows:

[0131] Lc = Tx (Lm - Ln) + Ln The above brightness difference correction is repeated the number of times equal to the number of unique color information in the input image data. In FIG. 8, brightness L803 of color information 803 and brightness L805 of color information 805 are corrected for brightness difference using a correction rate T. This results in color information 809. Since color information 809 is outside the gamut after gamut mapping, the above-mentioned search is performed and it is mapped to color information 810 within the gamut after gamut mapping. The same process is performed for color information 804. As described above, gamut mapping with wider brightness difference can be performed on the colors included in the image data, and the degree of color degeneration due to gamut mapping can be reduced.

[0132] This embodiment may be performed simultaneously with the second embodiment. In that case, the brightness difference correction process is performed on the reference color of the color degeneration correction process. By correcting the brightness difference of the reference color, it is also possible to process the brightness difference correction of other color information. As described above, it is possible to reduce color degeneration and the decrease in brightness difference due to gamut mapping, and further reduce changes in color tone.

[0133] [Fourth embodiment] In the first, second and third embodiments described above, the processing is performed on the entire input image data. The color information included in the input image data may have different meanings even if it is the same color information. For example, the color information used in the graph and the color information used as part of the gradation have different meanings in terms of identification. For the color information used in the graph, it is important to distinguish it from other color information in the graph, so it is necessary to perform strong color degeneration correction. However, for color information used as part of the gradation, it is important to perform weak color degeneration correction because the gradation with the color information of the surrounding pixels becomes important. There are cases where these two pieces of color information are the same color information and are corrected at the same time. In that case, if the color degeneration correction of the color information in the graph is emphasized, the color degeneration correction is applied strongly and the gradation in the gradation is impaired. On the other hand, if the gradation in the gradation is emphasized, the color degeneration correction is applied weakly and the identification of the color information in the graph is impaired. Furthermore, the number of unique combinations of color information that reduce the degree of color degeneration increases, and the reduction effect decreases. This is remarkable when the input image data is multiple pages and the color degeneration correction process is performed on the entire multiple pages. Even if the input image data is for one page, the color degeneration correction process is performed on the entire page, so the same problem occurs.

[0134] In this embodiment, by setting multiple regions even for multiple pages, color degeneration correction processing can be performed independently for each region. Then, the color degeneration correction processing of the target color information can be performed with an appropriate correction strength according to the surrounding color information. As described above, color information in a graph can be corrected with emphasis on distinctiveness, and color information in a gradation can be corrected with emphasis on gradation.

[0135] Fig. 9 shows a flow chart of a series of processes in this embodiment, in which a region is set for a single page, and then color degeneration correction is performed for each region. It shows the flow of processing. In Fig. 9, the same process steps as those in Fig. 2 are given the same step numbers, and the description of those process steps is omitted.

[0136] In step S303, the CPU 102 sets an area for the input image data. Details of step S303 will be described later. In step S304, the CPU 102 selects an unselected area from the areas set in step S303 as a selected area, and creates the above-mentioned color degeneration corrected TBL for the selected area. Then, in step S305, the CPU 102 applies the color degeneration corrected TBL created in step S304 for the selected area to the selected area to perform correction.

[0137] In step S306, CPU 102 determines whether or not all of the areas set in step S303 have been selected as selected areas. If the result of this determination is that all of the areas set in step S303 have been selected as selected areas, the process proceeds to step S105. On the other hand, if any areas set in step S303 remain that have not yet been selected as selected areas, the process proceeds to step S304.

[0138] Here, the area setting process in step S303 above will be described in detail. Fig. 10 is a diagram for explaining an example of a page of input image data input in step S101 of Fig. 9 in this embodiment. Here, it is assumed that the data (document data) of page 1000 illustrated in Fig. 10 is described in PDL. PDL is an abbreviation for Page Description Language, and is composed of a set of drawing commands on a page-by-page basis. The types of drawing commands are defined for each PDL specification, but in this embodiment, the following three types are used as an example.

[0139] Command 1) TEXT drawing command (X1, Y1, color, font information, string information) Command 2) BOX drawing command (X1, Y1, X2, Y2, color, fill shape) Command 3) IMAGE drawing command (X1, Y1, X2, Y2, image file information) Other drawing commands may be used as appropriate depending on the application, such as a DOT drawing command for drawing a point, a LINE drawing command for drawing a line, a CIRCLE drawing command for drawing an arc, etc. For example, a general PDL such as PDF (Portable Document Format) proposed by Adobe (registered trademark), XPS proposed by Microsoft (registered trademark), or HP-GL / 2 proposed by HP (registered trademark) may be used.

[0140] 10 represents one page, and as an example, the number of pixels is 600 pixels wide and 800 pixels high. An example of a PDL corresponding to the document data of page 1000 in FIG.

[0141] <PAGE=001> <text> 50,50,550,100,BLACK,STD-18,"ABCDEFGHIJKLMNOPQR"< / text> <text> 50,100,550,150,BLACK,STD-18,"abcdefghijklmnopqrstuv"< / text> <text> 50,150,550,200,BLACK,STD-18,"1234567890123456789"< / text> <box> 50,350,200,550,GRAY,STRIPE< / box> 250,300,580,700,“PORTRAIT.jpg” <PAGE=001> is a tag that indicates the number of pages in this embodiment. Normally, PDL is designed to be able to describe multiple pages, so tags that indicate page breaks are described in the PDL. In this example, up to indicates that this is the first page. In this embodiment, this corresponds to page 1000 in FIG. 10. If there is a second page, the above PDL is followed by<PAGE=002> will be described.

[0142] The second line <text> From the third line< / text> This is drawing command 1, which corresponds to the first line of area 1001 in Figure 10. The first two coordinates indicate the coordinates (X1, Y1) of the upper left corner of the drawing area, and the next two coordinates indicate the coordinates (X2, Y2) of the lower right corner of the drawing area. Next, it is written that the color is BLACK (black: R=0, G=0, B=0), the font is "STD" (standard), the character size is 18 points, and the string to be written is "ABCDEFGHIJKLMNOPQR".

[0143] The fourth line <text> From the 5th line< / text> The above is drawing command 2, which corresponds to the second line of area 1001 in Fig. 10. The first four coordinates and two character strings indicate the drawing area, character color, and character font, respectively, just like command 1, and state that the character string to be written is "abcdefghijklmnopqrstuv".

[0144] Line 6 <text> From the 7th line< / text> The first four coordinates and two character strings indicate the drawing area, text color, and text font, just like drawing command 1 and drawing command 2, and state that the text string to be written is "1234567890123456789".

[0145] Line 8 <box> from< / box> The above is drawing command 4, which corresponds to area 1002 in FIG. 10. The first two coordinates indicate the upper left coordinates (X1, Y1) which are the drawing start point, and the next two coordinates indicate the lower right coordinates (X2, Y2) which are the drawing end point. Next, a color of GRAY (gray: R=128, G=128, B=128) and a fill shape of STRIPE, which is a striped pattern, are specified. In this embodiment, the direction of the stripes is a line in the lower right direction, but the angle and period of the lines may also be specified in the BOX command.

[0146] Next, from line 9 to line 10 The IMAGE commands from to correspond to area 1003 in Fig. 10. The first two coordinates indicate the upper left coordinates (X1, Y1) of the drawing start point, and the next two coordinates indicate the lower right coordinates (X2, Y2) of the drawing end point. Next, it is written that the file name of the image existing in area 1003 is "PORTRAIT.jpg", which indicates that it is a JPEG file, a commonly used image compression format. And the statement on line 11 indicates that drawing of the page has ended.

[0147] In actual PDL files, in addition to the above group of drawing commands, there are cases where the "STD" font data and the "PORTRAIT.jpg" image file are also included as one file. This is because when the font data and image files are managed separately, the character and image portions cannot be formed with drawing commands alone, and there is insufficient information to form the image in Figure 10. Also, area 1004 in Figure 10 is an area where no drawing commands exist, and is blank.

[0148] In the case of a document page described in PDL such as page 1000 in Fig. 10, the area setting process in step S303 in Fig. 9 can be realized by analyzing the above PDL. Specifically, the start and end points of the drawing Y coordinates of each drawing command are as follows, and are continuous in area.

[0149] Drawing command Y start point Y end point First TEXT command 50 100 Second TEXT command 100 150 Third TEXT instruction 150 200 BOX instruction 350 550 IMAGE instruction 300 700 We can also see that the BOX and IMAGE commands are both 100 pixels away from the TEXT command in the Y direction. Next, the start and end points of the drawing X coordinates for the BOX and IMAGE commands are as follows, and we can see that they are 50 pixels away in the X direction.

[0150] Drawing command X start point X end point BOX instruction 50 200 IMAGE instruction 250 580 Based on the above, three areas can be set as follows:

[0151] Area X start point Y start point X end point Y end point First area 50 50 550 200 Second area 50 350 200 550 Third area 250 300 580 700 In addition to the above-described configuration in which the area is set by analyzing the PDL, the area may be set using the drawing result. Such a configuration will be described below. Fig. 11 is a flow chart showing the process of setting the area in units of tiles in step S303.

[0152] In step S401, the CPU 102 divides the page into a plurality of unit tiles. In this embodiment, the page is divided into "unit tiles each having a size of 30 pixels vertically and horizontally", but the size of the unit tiles is not limited to a specific size. First, the CPU 102 sets an array Area_number

[20]

[27] for holding area numbers to be set for each unit tile. As described above, the page is 600×800 pixels, and there are 20 unit tiles in the horizontal (X) direction and 27 in the vertical (Y) direction, each having a size of 30 pixels vertically and horizontally.

[0153] Fig. 12 is a diagram showing an image of tile settings for a page in this embodiment. A page 1200 in Fig. 12 represents the entire page. An area 1201 in Fig. 12 is an area drawn in accordance with a TEXT drawing command, an area 1202 is an area drawn in accordance with a BOX drawing command, an area 1203 is an area drawn in accordance with an IMAGE drawing command, and an area 1204 is an area that is not drawn at all.

[0154] In step S402, CPU 102 determines for each unit tile whether the unit tile is a blank tile. As described above, this determination may be made based on the start and end points of the XY coordinates of the drawing command, or tiles in which all pixel values ​​in the actual unit tile are R=G=B=255 may be detected as blank tiles. Whether to make the determination based on the drawing command or the pixel values ​​may be determined based on the processing speed and detection accuracy. In step S403, CPU 102 sets the initial values ​​of each value as follows:

[0155] Set the area number "0" for the unit tiles that are determined to be blank tiles in step S402. Set the area number "-1" for unit tiles that were not determined to be blank tiles (determined to be non-blank tiles) in step S402 - Set the maximum area number to "0" Specifically, set it as follows:

[0156] Blank tile(x1,y1) :area_number[x1][y1]=0 Non-blank tile(x2,y2):area_number[x1][y1]=-1 Maximum area number: max_area_number=0 That is, at the completion of the process of step S402, "0" or "-1" is set as the area number for all unit tiles. In step S404, CPU 102 searches for a unit tile with "-1" set as the area number. Specifically, CPU 102 determines whether area_number[x][y]=-1 for the range of x=0 to 19 and y=0 to 26, and searches for a unit tile corresponding to a combination of x and y that satisfies area_number[x][y]=-1 as a blank tile. When a unit tile with an area number of "-1" is detected for the first time, the process proceeds to step S405.

[0157] In step S405, CPU 102 determines whether or not there is a unit tile with "-1" set as its area number. If the result of this determination is that there is a unit tile with "-1" set as its area number, the process proceeds to step S406. On the other hand, if there is no unit tile with "-1" set as its area number, the process proceeds to step S410.

[0158] In step S406, the CPU 102 increments the maximum area number value by 1, and sets the area number of the unit tile determined to be a blank tile to the updated maximum area number value. Specifically, if area_number[x3][y3]=-1, the following process is performed.

[0159] max_area_number=max_area_number+1 area_number[x3][y3]=max_area_number For example, since this is the first time that the process of step S406 is executed and detection is performed for the first time, the maximum area number value is "1", and therefore the area number of this tile is set to "1". After that, max_area_number is incremented by 1 each time step S406 is executed. After that, in steps S407 to S409, the process of expanding consecutive non-blank tiles into the same area is performed.

[0160] In step S407, CPU 102 searches for a unit tile whose area number is -1 and is adjacent to the unit tile with the maximum area number. Specifically, the following determination is made for the range of x=0 to 19 and y=0 to 26.

[0161] if (area_number[x][y]=max_area_number) if((area_number[x-1][y]=-1)or (area_number[x+1][y]=-1)or (area_number[x][y-1]=-1)or (area_number[x][y+1]=-1)) → An adjacent tile with area number "-1" was found. else → No adjacent tiles with region number "-1" are found When the search in step S407 detects the first adjacent tile with area number "-1", the process proceeds to step S408. In step S408, CPU 102 determines whether or not the adjacent tile with area number "-1" has been detected.

[0162] If the result of this determination is that an adjacent tile with area number "-1" is detected, the process proceeds to step S409. On the other hand, if an adjacent tile with area number "-1" is not detected, the process proceeds to step S404.

[0163] In step S409, the CPU 102 sets the region number of the unit tile adjacent to the adjacent tile with region number "-1" to the maximum region number. Specifically, the position of the adjacent tile with region number "-1" (position of the tile of interest) is set to (x4, y4), and the following process is performed.

[0164] if((area_number[x4-1][y4]=-1) area_number[x4-1][y4]=max_area_number if((area_number[x4+1][y4]=-1) area_number[x4+1][y4]=max_area_number if((area_number[x4][y4-1]=-1) area_number[x4][y4-1]=max_area_number if((area_number[x4][y4+1]=-1) area_number[x4][y4+1]=max_area_number Once the area numbers of the adjacent tiles have been updated in step S409, processing proceeds to step S407, where the search continues to check whether there are any other adjacent non-blank tiles. If there are no more non-blank adjacent tiles, i.e., if there are no more tiles to which the maximum area number should be assigned, processing proceeds to step S404.

[0165] If the area numbers of all unit tiles are not "-1", that is, if all unit tiles are blank tiles or any of the unit tiles has an area number set, it is determined that no unit tile with area number "-1" exists.

[0166] In step S410, CPU 102 sets the maximum region number value as the number of regions. That is, the maximum region number value set so far becomes the number of regions present on the page. This ends the region setting process within the page.

[0167] Fig. 13 is a diagram showing each unit tile after the area setting process is completed. Page 1300 in Fig. 13 represents the entire page. Area 1301 in Fig. 13 is an area drawn according to a TEXT drawing command, area 1302 is an area drawn according to a BOX drawing command, area 1303 is an area drawn according to an IMAGE drawing command, and area 1304 is an area that has not been drawn at all. In this case, the result of area setting is as follows:

[0168] ·Number of areas=3 ·Area number=0 Blank area 1304 Area number = 1 Text area 1301 Area number = 2 Box area 1302 Area number = 3 Image area 1303 As shown in Fig. 13, each region is spatially separated by at least one blank tile. In other words, unit tiles that are not separated by even one blank tile are considered to be adjacent to each other and are processed as the same region.

[0169] Human vision has the characteristic that it is relatively easy to perceive the difference between two colors that are spatially adjacent or very close, but relatively difficult to perceive the difference between two colors that are spatially separated. In other words, the result of "outputting in a different color" described above is easily perceivable when it is performed on the same color that is spatially adjacent or very close, but is difficult to perceive when it is performed on the same color that is spatially separated.

[0170] In this embodiment, the areas considered to be different areas are separated by a predetermined distance or more on the paper surface. When printed on A4 size paper, the distance is preferably 0.7 mm or more. The preferable distance may be changed depending on the size of the paper to be printed on. It may also be changed depending on the expected observation distance. Furthermore, even if the areas are not separated by a predetermined distance on the paper surface, they may be considered to be different areas if they are different objects. For example, even if the image area and the box area are not separated by a predetermined distance, they may be set as different areas because they are different types of objects.

[0171] In this embodiment, pixel positions regarded as the same region are within a predetermined distance on the paper surface with the background color in between. Examples of the background color are white, black, and gray. The background color may also be a color defined in the image data. The predetermined distance is preferably less than 0.7 mm when printed on A4 size paper. The preferable distance may be changed depending on the paper size to be printed. Also, it may be changed depending on the expected observation distance. Furthermore, even if the pixel positions are within a predetermined distance on the paper surface, they may be regarded as different regions if they are different objects. For example, even if the image region and the box region are within a predetermined distance, they may be set as different regions because the types of objects are different.

[0172] As described above, in this embodiment, by dividing the regions in this manner, it is possible to limit the number of combinations of color information that are the subject of color degeneration correction processing. By limiting the number of combinations of color information, it is possible to perform the same color degeneration correction on regions that have the same color distribution, even if they are different regions. As a result, it is possible to obtain the same correction result for graphs that use the same color information but are separated as regions.

[0173] Furthermore, by limiting the number of combinations of color information that are the subject of color degeneration correction processing, the color gamut for providing distance between color information can be increased, and the degree of color degeneration can be reduced.

[0174] As described above, in this embodiment, even within the same page, spatially separated parts are set as separate areas, and suitable mapping is set for each, thereby making it possible to reduce both the decrease in saturation and the degree of color degeneration.

[0175] Also, in step S303, the CPU 102 may divide the manuscript data into a plurality of "partial pages". Here, the "partial pages" in this embodiment will be described. As described above, the manuscript data to be printed is document data consisting of a plurality of pages. The "partial pages" represent how the plurality of pages included in the document data are grouped together to be used as the target for creating the above-mentioned color degeneracy correction gamut mapping table. For example, assume that the document data is composed of the first to third pages. If each page is to be used as the target for creating the mapping table, the first, second, and third pages are each "partial pages". Also, if the first and second pages and the third page are to be used as the target for creating the mapping table, the first and second pages are "partial pages", and the third page is also a "partial page". Also, the "partial pages" are not limited to groups of pages included in the document data. For example, a part of the area of ​​the first page may be used as the "partial page". In step S303, the manuscript data is divided into a plurality of "partial pages" according to a group of "partial pages" determined in advance. The group of "partial pages" may be specified by the user.

[0176] As described above, in this embodiment, even within multiple pages, partial pages can be set as separate areas and a gamut mapping table after color degeneration correction can be applied to each of them, thereby reducing both the decrease in saturation and the degree of color degeneration.

[0177] In this embodiment, correction processing is performed for each region. When applying the color degeneration-corrected TBL to an image in the image processing device 101 having the configuration shown in Fig. 1 in the process according to the flowchart shown in Fig. 9, the color degeneration-corrected TBL stored in the RAM 103 is transferred to a cache memory of the CPU 102 and applied. Therefore, when the number of regions increases, a transfer time is generated in proportion to the number of regions, which causes an increase in the overall processing time.

[0178] This can be solved by performing the TBL synthesis process described in the first embodiment on the region. A flowchart of the gamut mapping process is shown in FIG.

[0179] In step S801, CPU 102 performs an analysis process of the set area. In this analysis process, the area is the subject of the page analysis in step S501, and in step S502, CPU 102 judges whether color degeneration correction is necessary for the area. The criterion for judging that color degeneration correction is necessary may be that the area is a graphic area, that color degeneration has occurred as a result of mapping the input color of the area, or that color degeneration has occurred at a predetermined rate or more in the input color of the area. If it is judged that color degeneration correction is necessary as a result of this judgment, the process proceeds to step S304, and if it is judged that color degeneration correction is not necessary, the process proceeds to step S306.

[0180] In step S802, CPU 102 stores the color degeneration corrected TBL created in step S304 in RAM 103. In step S306, it is determined whether the analysis process of step S801 has been performed for all areas. If the result of this determination is that the analysis process of step S801 has been performed for all areas, the process proceeds to step S506. On the other hand, if there are areas that have not yet been subjected to the analysis process of step S801, the process proceeds to step S801. In step S506, CPU 102 performs synthesis processing of the color degeneration corrected TBL stored in RAM 103 in step S802.

[0181] By the above-mentioned processing, the number of post-color-reduction-corrected TBLs generated for each page is reduced when the input colors for each page are different, without reducing the effect of color redundancy correction, thereby reducing the TBL transfer time and shortening the overall processing time.

[0182] Furthermore, in this embodiment, the judgment is performed on the input color of the region, but the judgment may be performed on the color degeneration corrected TBL generated for each region, and the composition process may be performed on the TBL based on the result.

[0183] By the above-mentioned processing, the number of post-color-reduction-corrected TBLs generated for each page is reduced, except when the TBL values ​​are different in the same grid, without reducing the effect of color-reduction correction, thereby reducing the TBL transfer time and shortening the overall processing time.

[0184] [Fifth embodiment] When the image processing accelerator 105 is used to perform the process according to the flowchart in Fig. 23, the upper limit of the number of calculation circuits that apply the color degeneration-corrected TBL to image data is determined by the characteristics of the image processing accelerator 105. Therefore, when the number of areas in the image data exceeds the upper limit of the number of calculation circuits, the color degeneration-corrected TBL is transferred between the processing of the area that exceeds the upper limit and the other areas. Such a case will be described using Fig. 24 as an example.

[0185] An original page 2400 includes an area 2401, an area 2402, and an area 2403. Also, a first color degeneration corrected TBL is created for the area 2410, a second color degeneration corrected TBL is created for the area 2402, and a third color degeneration corrected TBL is created for the area 2403. If the number of arithmetic circuits is two, the area 2403 and the third color degeneration corrected TBL are one higher. The arithmetic circuit applies the correction table to each pixel from the top left of the original page. At this time, the areas processed by the arithmetic circuit are in the order of area 2401 → area 2403 → area 2401 → area 2402 → area 2403 → area 2401 → area 2403. In this case, the transfer of the correction table is performed at the timing of switching the areas from area 2401 → area 2402 and area 2402 → area 2403, which takes time for transfer. As a result, the processing speed decreases, which is a problem. This is the same even if the processing is performed by the CPU 102. In this embodiment, a processing flow that makes it possible to suppress a decrease in processing speed even if the processing is performed by the CPU 102 will be described, but the following processing may be performed by the image processing accelerator 105. The gamut mapping processing in this embodiment will be described with reference to the flowchart in FIG.

[0186] In step S901, the CPU 102 associates a flag indicating that color degeneration correction is necessary with the corresponding region and stores it in the RAM 103. Then, the CPU 102 performs this process for all regions without creating or saving a post-color degeneration correction TBL.

[0187] After that, in step S902, the CPU 102 performs area joining processing. Details of the processing in step S902 will be described with reference to the flowchart in Fig. 26. In the following, description will be given taking the image data of the document in Fig. 27 as an example.

[0188] In step S1001, the CPU 102 acquires color information of an area stored in the RAM 103 in association with a flag indicating that color degeneration correction is necessary. In step S1002, the CPU 102 sets a combination of areas (combination target areas) for which a determination is made as to whether or not to perform composition.

[0189] In step S1003, the CPU 102 determines whether color information of the same hue angle exists. As described in the second embodiment, when correction is performed for the same hue angle, if the joining area includes a color that is not a common color but has the same hue angle, the correction result will change. Therefore, combinations that include only colors that do not have the same hue angle and for which the correction result does not change are selected as joining targets.

[0190] If the result of this determination is that color information with the same hue angle exists (NO), the process proceeds to step S1005. On the other hand, if color information with the same hue angle does not exist (YES), the process proceeds to step S1004.

[0191] In step S1004, the CPU 102 joins the regions to be joined and sets one new region that includes all of the regions to be joined. The process of step S1004 will be described with reference to FIG.

[0192] 27 includes a plurality of graphic areas. Areas 2702, 2703, 2705, and 2706 are graphic areas, and are areas associated with flags indicating that color degeneration correction is required in this processing. Area 2702 has input colors 2708-2710, area 2703 has input colors 2711-2714, area 2705 has input colors 2715-2716, and area 2706 has input colors 2717-2718.

[0193] It is assumed that the input color 2713 is equal to the input color 2715 and is a common color. It is also assumed that the other input colors, that is, the input color 2708, the input color 2709, the input color 2710, the input color 2711, the input color 2712, the input color 2714, the input color 2716, the input color 2717, and the input color 2718, are not common colors with any of the other colors.

[0194] When an area without a common color is set as a joining target for the main image data 2700, an area 2707 including the three areas 2702, 2703, and 2706 is newly set in step S1004. Then, including the area newly set by this process, area analysis is performed again, and a color degeneration corrected TBL is created for each area. In FIG. 27, a color degeneration corrected TBL is created for the areas 2706 and 2706. Here, without setting the area 2707, the areas 2702, 2703, and 2706 may be regarded as one area, area analysis may be performed again, and a color degeneration corrected TBL may be created. That is, the areas do not have to be continuous on the image data, and it is sufficient that the correction process can be performed on all areas including a common color. For example, areas existing on different pages may be set as joining targets, and processing may be performed by regarding them as the same area.

[0195] In step S1005, CPU 102 determines whether the above process has been performed for all area combinations. If the result of this determination is that the above process has been performed for all area combinations, the process according to the flowchart in Fig. 26 ends. On the other hand, if there are any area combinations for which the above process has not been performed, the process proceeds to step S1002.

[0196] Since it may be possible to combine another area with the combined area, the combined area is also included in the combination. As a result of the processing in step S902, the areas 2702, 2703, and 2706 are processed as a single area 2707 thereafter.

[0197] The above-mentioned process maintains the effect of color degeneration correction, and reduces the number of regions to be corrected when there are no colors with the same hue angle. For example, in FIG. 24, when the hue angles of the input colors of region 2401 and region 2402 are different and they are joined, the number of regions and the number of TBLs after color degeneration correction are reduced to two, and no transfer of TBLs after color degeneration correction occurs. This reduces the number of times that the number of calculation circuits is exceeded, and improves the processing speed.

[0198] In addition, in this embodiment, the judgment is performed on the input color of the region, but the judgment may be performed on the color degeneration corrected TBL generated for each region, and the region and the TBL may be combined based on the result. The overall flow is shown in FIG.

[0199] The process up to step S502 is as described above. For the areas determined to require color degeneration correction, a color degeneration-corrected TBL is created for each area in step S304, and the created color degeneration-corrected TBL is stored in RAM 103 in step S802. After this process is performed for all areas, TBL synthesis process is performed in step S506. The flow of this process is the same as that of the first embodiment, but for the TBL for each area, not for each page, and is as shown in FIG.

[0200] Next, in step S1101, the CPU 102 joins together the areas to which the color degeneration-corrected TBLs have been combined. When the color degeneration-corrected TBLs are combined in step S506, the combined TBL obtained by the combination is the color degeneration-corrected TBL for a plurality of areas. In other words, the correction result does not change even if the areas to which the combined TBL is applied are treated as the same area.

[0201] Then, CPU 102 applies the composite TBL composited in step S506 to the areas joined in this step. In step S1102, it is determined whether this process has been completed for all TBLs or all areas. If the condition that this process has been completed for all TBLs or all areas is satisfied, the process proceeds to step S105, and if the condition is not satisfied, the process proceeds to step S1101.

[0202] The above-mentioned process reduces the number of regions to be corrected while maintaining the effect of color degeneration correction, except when the TBL values ​​are different in the same grid. For example, in FIG. 24, when the hue angle of the input color is different between the region 2401 and the region 2402, the correction target grid of the TBL after color degeneration correction to be created is not the same, so the regions are joined and the TBLs are combined. Furthermore, even if the input color is common between the region 2401 and the region 2402, when the TBL values ​​are the same in the same grid, the regions are joined and the number of regions and the number of TBLs after color degeneration correction are reduced. This reduces the number of times that exceeds the number of calculation circuits, and improves the processing speed.

[0203] In addition, the speed of area analysis in step S801 can be improved by changing the resolution of the image data input in step S101, i.e., the image data for creating the TBL after color degeneration correction, and the image data to which the TBL after color degeneration correction is applied in step S1101, and lowering the resolution of the image data for creating the TBL after color degeneration correction.

[0204] On the other hand, by lowering the resolution, the result of gamut mapping performed in step S102 is not retained. Therefore, it is necessary to perform gamut mapping (application of a lookup table) again in step S1101 for the area determined not to require color degeneration correction. As a result, when the number of areas not requiring correction in the image data exceeds the upper limit of the number of arithmetic circuits, or when the number of areas exceeds the upper limit of the number of arithmetic circuits, the speed decreases. To address this, in the area joining process in step S902 in FIG. 28, for areas where a TBL after color degeneration correction has been created, joining process is performed on all areas where a TBL after color degeneration correction has not been created, as in the flowchart in FIG. 26. This reduces the number of times the number of arithmetic circuits is exceeded when performing gamut mapping again in areas where a TBL after color degeneration correction has not been created in step S1101, which occurs when the resolution is changed, and improves the processing speed.

[0205] The numerical values, processing timing, processing order, processing subject, data (information) structure / acquisition method / send destination / send source / storage location, etc. used in each of the above embodiments are given as examples to provide a concrete explanation, and are not intended to be limited to these examples.

[0206] In addition, a part or all of the embodiments described above may be used in appropriate combination. In addition, a part or all of the embodiments described above may be used selectively.

[0207] (Other embodiments) The present disclosure can also be realized by a process in which a program for implementing one or more functions of the above-described embodiments is supplied to a system or device via a network or a storage medium, and one or more processors in a computer of the system or device read and execute the program. It can also be realized by a circuit (e.g., ASIC) that implements one or more functions.

[0208] The invention of this specification includes the following image processing device, image processing method, and computer program. (Item 1) a correction means for correcting color conversion information used in color conversion; a conversion means for performing color conversion using the color conversion information corrected by the correction means; Equipped with The correction means is Based on the first color conversion information corrected by the correction means and the second color conversion information corrected by the correction means, and / or based on a first application target corresponding to the first color conversion information and a second application target corresponding to the second color conversion information, color conversion information obtained by combining the first color conversion information and the second color conversion information is generated as color conversion information to be applied to the first application target and the second application target. 13. An image processing device comprising: (Item 2) The correction means is When the color difference between the first application object and the second application object is not within a predetermined color difference range, color conversion information obtained by combining the first color conversion information and the second color conversion information is generated as color conversion information to be applied to the first application object and the second application object. 2. The image processing device according to item 1, (Item 3) The correction means is If the correction value of the same grid corrected by the first color conversion information and the second color conversion information is within a predetermined color difference, color conversion information obtained by combining the first color conversion information and the second color conversion information is generated as color conversion information to be applied to the first application object and the second application object. 2. The image processing device according to item 1, (Item 4) The image processing device described in item 1, characterized in that when the color conversion information to be applied to the first application object is not corrected to the first color conversion information by the correction means and the color conversion information to be applied to the second application object is not corrected to the second color conversion information by the correction means, the conversion means performs color conversion using the same color conversion information for the first application object and the second application object. (Item 5) 3. The image processing device according to item 2, wherein the predetermined color difference is a hue angle difference at which the color information of the first application target and the color information of the second application target are recognized as the same color. (Item 6) 6. The image processing device according to item 5, wherein the difference in hue angle is from 30 degrees to 60 degrees on the a*b* plane in the CIE-L*a*b* color space. (Item 7) 3. The image processing device according to item 2, wherein the predetermined color difference is 2.0. (Item 8) 2. The image processing device according to item 1, wherein the first application target and the second application target are graphic areas. (Item 9) 2. The image processing device according to item 1, wherein the first application object and the second application object are pages. (Item 10) An image processing method performed by an image processing device, comprising: a correction step in which a correction unit of the image processing device corrects color conversion information used for color conversion; a conversion step in which a conversion means of the image processing device performs color conversion using the color conversion information corrected in the correction step; Equipped with In the correction step, Based on the first color conversion information corrected in the correction process and the second color conversion information corrected in the correction process, and / or based on a first application target corresponding to the first color conversion information and a second application target corresponding to the second color conversion information, color conversion information obtained by combining the first color conversion information and the second color conversion information is generated as color conversion information to be applied to the first application target and the second application target. 13. An image processing method comprising: (Item 11) A computer program for causing a computer to function as each of the means of the image processing device according to any one of items 1 to 9.

[0209] The invention is not limited to the above-described embodiments, and various modifications and variations are possible without departing from the spirit and scope of the invention. Accordingly, the following claims are appended to apprise the public of the scope of the invention. [Explanation of symbols]

[0210] 101: Image processing device 102: CPU 103: RAM 104: Storage medium 105: Image processing accelerator 106: Data transfer I / F 107: Network 108: Recording device 109: Image processing accelerator 110: Data transfer I / F 111: CPU 112: RAM 113: Storage medium 114: Recording head controller 115: Recording head

Claims

1. a correction means for correcting color conversion information used in color conversion; a conversion means for performing color conversion using the color conversion information corrected by the correction means; Equipped with The correction means is Based on the first color conversion information corrected by the correction means and the second color conversion information corrected by the correction means, and / or based on a first application target corresponding to the first color conversion information and a second application target corresponding to the second color conversion information, color conversion information obtained by combining the first color conversion information and the second color conversion information is generated as color conversion information to be applied to the first application target and the second application target.

13. An image processing device comprising:

2. The correction means is When the color difference between the first application object and the second application object is not within a predetermined color difference range, color conversion information obtained by combining the first color conversion information and the second color conversion information is generated as color conversion information to be applied to the first application object and the second application object.

2. The image processing device according to claim 1,

3. The correction means is If the correction value of the same grid corrected by the first color conversion information and the second color conversion information is within a predetermined color difference, color conversion information obtained by combining the first color conversion information and the second color conversion information is generated as color conversion information to be applied to the first application object and the second application object.

2. The image processing device according to claim 1,

4. 2. The image processing device according to claim 1, wherein, when the color conversion information to be applied to the first application object is not corrected to the first color conversion information by the correction means, and the color conversion information to be applied to the second application object is not corrected to the second color conversion information by the correction means, the conversion means performs color conversion using the same color conversion information for the first application object and the second application object.

5. 3. The image processing apparatus according to claim 2, wherein the predetermined color difference is a hue angle at which a difference between the color information of the first application target and the color information of the second application target is recognized as the same color.

6. 6. The image processing apparatus according to claim 5, wherein the difference in hue angle is from 30 degrees to 60 degrees on an a*b* plane in a CIE-L*a*b* color space.

7. 3. The image processing apparatus according to claim 2, wherein the predetermined color difference is 2.

0.

8. The image processing apparatus according to claim 1 , wherein the first application object and the second application object are graphic areas.

9. The image processing apparatus according to claim 1 , wherein the first application object and the second application object are pages.

10. An image processing method performed by an image processing device, comprising: a correction step in which a correction unit of the image processing device corrects color conversion information used for color conversion; a conversion step in which a conversion means of the image processing device performs color conversion using the color conversion information corrected in the correction step; Equipped with In the correction step, Based on the first color conversion information corrected in the correction process and the second color conversion information corrected in the correction process, and / or based on a first application target corresponding to the first color conversion information and a second application target corresponding to the second color conversion information, color conversion information obtained by combining the first color conversion information and the second color conversion information is generated as color conversion information to be applied to the first application target and the second application target.

13. An image processing method comprising:

11. A computer program for causing a computer to function as each of the means of the image processing apparatus according to any one of claims 1 to 9.

Citation Information

Patent Citations

  • Color picture converter

    JP1995203234A

  • Profile adjustment method, profile adjustment device, profile adjustment program, color conversion method, color conversion device, and color conversion program

    JP2020027948A