The present invention relates generally to the field of color-image processing and more particularly to a system and method of adapting from one color gamut to another without gamut mapping every node in the color gamut.
Any color imaging device has its limit in reproducing color such that it cannot reproduce all color that exists. The range of color that a device produces is known as the color gamut of the device. Different devices have different color gamuts. In order to preserve similar color appearance when color is transferred from one device into another, such as from monitor to printer, gamut mapping is typically used. Many gamut-mapping methods and algorithms have been developed, and such methods improve the quality of color transformation in cross-media color reproductions.
In device color characterization, a multiple-dimensional lookup table is typically generated. For example, a three dimensional sRGB to CMYK lookup table can be generated for the transformation from monitor sRGB to printer CMYK. In an International Color Consortium (ICC) color management system, an ICC profile is generated for the color transformation for each setting mode of a color device. A three dimensional lookup table for the transformation from profile connection space (“PCS”), which is CIE LAB or XYZ in a specified illuminant and viewing condition, to CMYK for each rendering intent is included in an ICC profile for a printer CMYK ICC profile.
Gamut-mapping algorithms are typically used to gamut map colors point-by-point, that is, they gamut map every node of a lookup table or every pixel of an image. Because of the heavy computation involved in gamut mapping, the gamut mapping is generally not fast enough for real-time device color characterization. Such point-by-point gamut mapping will cause a “bottle-neck” for color management module implementation. Furthermore, in some instances point-by-point processing in gamut mapping can ignore the preservation of relative relationship of neighbor color, which is significant for preserving color appearance.
For these and other reasons, a need exists for the present invention.
Exemplary embodiments of the present invention include a system and method for rendering colors between color devices. One embodiment of the method includes establishing a source color gamut for a source device and the source color gamut has a white point, a black point, and primary points. The method also includes establishing a destination color gamut for a destination device, and the destination color gamut has a white point, a black point, and primary points. White and black point adaptation is performed to adapt the white and black points of the source color gamut to the white and black points of the destination color gamut, respectively. Neutral points from the source color gamut are processed to the destination color gamut. Aimed primary points are determined from the adapted white and black points and from the source and destination primary points, the destination gamut, and color preference. An aimed gamut surface is mapped by geometrically reshaping a combination of the source primary points and its white and black points to a combination of aimed primary points and its white and black points. Interior points of the source gamut surface are processed.
In the following Detailed Description, reference is made to the accompanying drawings, which form a part hereof, and in which is shown by way of illustration specific embodiments in which the invention can be practiced. It is to be understood that other embodiments can be utilized and structural or logical changes can be made without departing from the scope of the present invention. The following Detailed Description, therefore, is not to be taken in a limiting sense, and the scope of the present invention is defined by the appended claims.
Each of source and destination color devices 6 and 8 has a color gamut that defines the range of color that the device produces. In one example, the color gamuts of source and destination color devices 6 and 8 are different from each other. Consequently, in order to preserve similar color appearance when color is transferred from one device into another, for example from a monitor to a printer, the color gamut of each device is considered. The process of color matching, in which differences in color gamuts between the source device and the destination device are taken into consideration, is gamut mapping.
Transforming colors from one device into another via gamut mapping is typically performed in a device-independent color space, such CIELAB, CIECAM02 JAB, or CIECAM97s JAB.
Traditional gamut mapping maps colors point by point using a three dimensional lookup table. For example, to generate a 17×17×17 three-dimensional lookup table for the transformation from sRGB to CMYK, each of 17×17×17 (or 4913) nodes goes through a gamut mapping in order to map each node from the sRGB gamut to the CMYK gamut. This process involves extensive computation that, in some applications, demands significant processing resources.
As is evident in
If the sRGB magenta hue within the source color gamut 12 (represented by Ms in
Hue rotation during primary mapping better preserves the relative color relationship among the gamut surface colors and high saturated colors. It is performed prior to the gamut mapping. In addition to hue adjustment, lightness adjustment is also used to better preserve the relative color relationship among color gamuts, such as between source color gamut 12 and destination color gamut 14.
While this kind of mapping is typically appropriate for text and computer graphics, it typically induces too much distortion for images. An aimed point, such as Ca in
While the lightness adjustment can be performed during the gamut mapping, it can also be accomplished in a separated primary adjustment step prior to the gamut mapping, or be done by the joined operation of the primary adjustment and gamut mapping.
One embodiment of the present invention provides a “spring-primary” gamut mapping apparatus and method. Spring-primary gamut mapping combines the primary adjustment and gamut mapping in a single step and well adapts the three-dimensional source gamut into a three-dimensional destination gamut in a three-dimensional manner such that it is easy to visually maintain the color-to-color relative relationship. Furthermore, gamut mapping is performed for only a small percentage of nodes in a lookup table, thus it takes significantly less time to generate a lookup table than methods that involve gamut mapping all the nodes of a lookup table. This basic concept for primary mapping and gamut adaptation is referred to as a spring-primary mapping process, and will be described in more detail below.
To visualize the gamut mapping in one embodiment of the invention, a three-dimensional gamut in a device RGB color space is transferred to a three-dimensional gamut in an L-S-H (lightness-saturation-hue) color space.
For a three-dimensional 17×17×17 sRGB lookup table, the indexes of each of the 4913 nodes are denoted as (r, g, b), where r, g, and b are integers from 0 to 16. In this way, the indexes of the eight corner nodes are:
K (black): (0, 0, 0);
B (blue): (0, 0, 16);
G (green): (0, 16, 0);
C (cyan): (0, 16, 16);
R (red): (16, 0, 0);
M (magenta): (16, 0, 16);
Y (yellow): (16, 16, 0); and
W (white); (16, 16, 16).
When the indexes of an sRGB color (r, g, b) are changed gradually from the black point (r=g=b=0) to the white point (r=g=b=16) with r=g=b, the color changes gradually from black to gray to white. If the color mapping of the white and black points of sRGB to the white and black of a destination device, such as a printer, in a device-independent color space are known, and the tone mapping curve is known, gamut mapping for each of these seventeen points is avoided.
When the indexes of an sRGB color (r, g, b) are changed from white (16, 16, 16) to red (16, 0, 0), that is, r=16, and g and b are changed gradually from g=b=16 to g=b=0, the color changes gradually in the red ramp from white (W) to the red primary (R). Again, since the transition relationship (or relative relationship) of these sRGB colors is known, gamut mapping for all seventeen points is avoided and only the two end points (the white point and the red primary) are performed. The remaining points can be computed and mapped using a more efficient method.
A similar approach can be applied to other group of colors, such as the color ramps of W-to-G, W-to-B, W-to-Y, W-to-M, W-to-Y, K-to-R, K-to-G, K-to-B, K-to-C, K-to-M, and K-to-Y.
In one embodiment of the invention, a lookup table for the transformation from a source color space to a destination color space, which is based on the relative color relationship of neighbor nodes, is generated by gamut mapping for only a small portion of points. This method provides a more efficient approach to map color points from the source gamut to the destination gamut than gamut mapping each of the points from one color device gamut to another.
In the illustrated color space 50, the distance between two primary color nodes Y and R in source gamut slice 52, that is, the length of YR, is typically different than the distance between two primary color nodes y and r in destination gamut slice 54, that is, the length of yr. In this way, if point R in source gamut slice 52 is mapped to point r in destination gamut slice 54 (pull R to r), point Y can not be mapped to point y without changing the length of YR or of yr.
The spring-primary mapping process for primary mapping and gamut adaptation will be described in more detail below with exemplary embodiments. For the exemplary embodiments described below, gamut mapping will be denoted in the LAB color space, although one skilled in the art will understand that gamut mapping is also performed in other lightness-chrominance color space, such as CIELAB, CIELUV, CIECAM97s Jab, or CIECAM02 Jab color space.
In one embodiment, the first step in the spring-primary mapping process is to perform white point and black point adaptation. For perceptual preference mapping, the source white point (W) is mapped to the destination white point (w), and the source black point (K) is mapped to the destination black point (k). A white point adaptation method (such as Von Kries transformation or other advanced color appearance modeling) is applied for the white point adaptation. A black point adjustment method is applied to map the source black point to the destination black point. The white point and black point adaptation are performed for all colors.
White point and black point adaptation can be performed in CIE XYZ space, a color corrected RGB color space, or in other color space. In addition, a tone mapping or contrast mapping method can be applied for tone adjustment. Other preference adjustments can also be applied. During the white point and black point adjustment, all colors are adjusted accordingly.
In one embodiment, the next step in the spring-primary mapping process, after the white point and black point adaptation is performed, is to process neutral points, that is, the points along the line between the white point and black points (the vertical line in
In the above linear interpolation equations, (Lis, Ais, Bis) and (Lia, Aia, Bia) are the LAB values of a source neutral color and its corresponding aimed output mapped color;
(Lws, Aws, Bws) and (Lwa, Awa, Bwa) are LAB values of the source white point and the destination white point (they are actually the same with a complete white point adaptation); and
(Lks, Aks, Bks) and (Lka, Aka, Bka) are LAB values of the source black point and the destination black point (they are the same after the black point adjustment).
If the chrominance of the neutral axis is zero (i.e. A=B=0 for color in the neutral axis), Aia and Bia are not computed by above equations. Instead, A and B are simple assigned with zero.
In an alternative embodiment, a distance based interpolation, described by the distance equations below, is used instead:
where Diw is the distance or color difference between a neutral point and the white point in the source color space, and Dik is the distance or color difference between a neutral point and the black point in the source color space.
For a 17×17×17 three-dimensional RGB lookup table, the indexes of the neutral nodes from W (the white point) to K (the black point) are: (16, 16, 16), (15, 15, 15), (14, 14, 14), (13, 13, 13), (12, 12, 12), (11, 11, 11), (10, 10, 10), (9, 9, 9), (8, 8, 8), (7, 7, 7), (6, 6, 6), (5, 5, 5), (4, 4, 4), (3, 3, 3), (2, 2, 2), (1, 1, 1), and (0, 0, 0).
In one embodiment, the next step in the spring-primary mapping process, after processing neutral points, is determining aimed primaries of the gamut surface. Aimed primaries are determined before primary mapping. The lightness and hue angle of each aimed primary are determined by following weighting equations:
Laimed=wL·Lsource+(1−wL)·Ldestination
haimed=wh·hsource+(1−wh)·hdestination
where Laimed, Lsource, and Ldestination are the aimed lightness, the source lightness, and the destination lightness of a primary, respectively; where haimed, hsource, and hdestination are the aimed hue angle, the source hue angle, and the destination hue angle of the same primary, respectively; where wL and wh are a weighting parameter for lightness and hue angle, respectively. In one embodiment, the wL and wh values are between 0 and 1.
The weighting parameters for lightness and hue angle wL and wh can be adjusted in order to optimize the destination primaries. In one embodiment, user interface 60, illustrated in
The aimed lightness (Laimed) and the aim hue angle (haimed) or the weights wL and wh can be determined by algorithms automatically. For example, they can be determined based on rendering intents (e.g. different aims are determined between photographic mapping and graphic mapping). The user adjustments can be provided for fine-tuning.
After lightness (Laimed) and hue angle (haimed) of an aimed primary are determined, the chroma of the aimed primary is computed by finding the maximum chroma value of a color with lightness=Laimed and hue angle=haimed in the destination gamut, i.e. the aimed primary is the point in the destination gamut surface that has lightness=Laimed and hue angle=haimed. This can be done by gamut mapping in the constant hue angle=haimed and constant lightness=Laimed as illustrated in
The chrominance A and B of LAB color gamut can be converted from LCh by:
A=C·cos(h)
B=C·sin(h)
where C is chroma and h is hue angle.
This process is then repeated for each primary, such that all six aimed primaries are determined using gamut mapping.
If the weighting parameter for both lightness and hue angle for a primary are 0, the aimed primary is the destination primary, and no gamut mapping is required to search the aimed primary point P.
In one embodiment, the next step in the spring-primary mapping process, after the aimed primaries are determined, is performing geometrical gamut reshaping in order to map the source gamut to the aimed gamut. Where the weighting parameter for lightness and hue angle corresponds to 0, then the aimed gamut is also the destination gamut.
In this way, with this geometrical gamut reshaping process P1 is pulled to p1, and P2 is pulled to p2, such that all points along the tetrahedron W-P2-P1-K are adjusted accordingly based on a geometrical mapping process to maintain the overall geometrical relationship. Thus, the source gamut is reshaped to the aimed gamut. The overall effect is that each source primary is mapped to its corresponding aimed primary and the source gamut is closely reshaped to the aimed gamut. By this step, all points on each line of the source gamut are mapped (or moved) to the corresponding line of the aimed gamut, and all points on the source gamut surface (points on the triangles WP1P2 and KP1P1) are mapped (or moved) to the aimed gamut surface (the triangles Wp1p2 and Kp1p2) according to the geometrical reshaping process.
Because the sub-gamut represented by four points (W, K and two primaries) only approximately represent the sub-gamut of a device gamut, some point on the aimed gamut surface (triangles Wp1p2 and Kp1p2) can be slightly out of the destination gamut surface, and some points intended to be in the destination gamut surface might not be exactly on the destination gamut surface. Gamut mapping or other fine tuning methods are applied to adjust the source gamut surface points to the destination gamut.
Although the interior points of the sub-gamut can also be reshaped from the source gamut to the aimed gamut accordingly in this step, they are processed in a later step.
This primary mapping and reshaping is done for each of six primary sections, that is, for each of the tetrahedrons formed by the combination of the white and black points with two neighboring primaries. In this way, there is the tetrahedron W-R-Y-K, the tetrahedron W-Y-G-K, the tetrahedron W-G-C-K, the tetrahedron W-C-B-K, the tetrahedron W-B-M-K, and the tetrahedron W-M-R-K. Once this process is complete for each primary section, the entire source gamut is closely reshaped to the aimed gamut.
In this way, the elastic strings or springs illustrated in
Because only eight points are used in this process (black point, white point, and six primary points) to determine how to reshape the gamut, the adjusted gamut is not exactly fitted in the destination gamut. To closely fit the source gamut to the destination gamut, more gamut surface points can be used so that we could use more springs to reshape the gamut. However, the more points are used, the higher the complexity in geometrical mapping. Using only these eight points to determine how to reshape the gamut in some cases gives a good approximation and significantly decreases processing time and demands.
Furthermore, instead of adding more control points to map the source gamut to the destination gamut, a post gamut mapping step is used in one embodiment to fine-tune gamut surface colors so that the source gamut fits into the destination gamut. Because the reshaped gamut is already closely fitted into the destination gamut, a simple and fast gamut mapping method can be used to fine-tune the color mapping. And only the points on or closed to the destination gamut surface are fine-tuned.
In one embodiment, the next step in the spring-primary mapping process, after the geometrical reshaping, is processing the interior points, that is, those nodes on the interior of the gamut surface. At this step, all nodes on the gamut surface of a three-dimensional lookup table have been mapped to the destination gamut. However, none of the interior nodes have been mapped by this step, except for the nodes on the neutral line (that is, nodes with r=g=b in an RGB lookup table). In order to process these interior nodes, six interior triangles are established. Referring to
Such an interior triangle 110 is illustrated in
For nodes on the non-adjusted triangle WQK, no color adjustment and gamut mapping is performed. In this way, the source LAB color of each node in this non-adjusted region is taken as the output LAB color. In this way, using this step of the spring-primary mapping process avoids gamut mapping for all of these nodes on the non-adjusted triangle WQK, thereby saving significant processing resources and time.
For nodes on the adjusted region of W-P-K-Q-W (the non-shaded area of interior triangle WKP in
In addition to processing nodes for each of the interior six triangles connected by W, K, and a primary, more such triangles can be processed. For example, a multitude of such interior triangles composed of W (white point), K (black point), and an edge point (that is, a point on a line connected by two neighbor primaries) can also be processed.
In one embodiment, the final step in the spring-primary mapping process, after processing the interior points of selected planes, is processing all remaining points. With the prior steps in the process, all gamut surface nodes and some interior nodes in a three-dimensional lookup table have been mapped to the destination gamut. The rest of the nodes in a lookup table are interpolated in three-dimensional manner. For each node, six points can be used for interpolation (six-weight interpolation). These six points are found from six directions relative to the point to be processed: up, down, left, right, front, and back. By searching each of the six directions, a point in each direction that has been mapped to the destination gamut and is closest to the point to be process is used for interpolation. The weight for each point is computed based on the distance of the point to the point to be processed (the closer the distance, the smaller the weight). The distance can be replaced by a color difference metric using a color difference formula (for example, ΔE94).
For each point that has been mapped from the source LAB to the destination LAB, an interpolation method (for example, tetrahedral interpolation) is applied to map the LAB into the destination device color space.
In this way, the spring-primary mapping process avoids gamut mapping each node from a source color gamut to a destination color gamut, thereby providing a faster method of transformation of colors from a source color space to a destination color space.
At step 202, white point and black point adaptation is performed. For perceptual preference mapping, the source white point (W) is mapped to the destination white point (w), and the source black point (K) is mapped to the destination black point (k) in this step. The tone appearance adjustment and or color preference adjustment can be performed.
At step 204, neutral points of the color gamuts are processed. In this step, all the points along the line between the white point and black points are processed from the source to the destination gamut. In one case, linear interpolation equations are applied to compute output color values, and in another case a distance based interpolation is used.
Next, at step 206 the aimed primaries of the gamut surface are processed. In one embodiment, aimed or destination primaries are determined before the primary mapping. In one case, the lightness and hue angle of each aimed primary are determined using weighting equations. In another case, the lightness and hue angle of each aimed primary are determined by rendering intent based modeling. After lightness and hue angle of each of the primaries are determined, the chroma of the aimed primary is computed in one case by gamut mapping in a constant hue angle and constant lightness. This process is used for each primary, such that all six aimed primaries are determined using gamut mapping.
Next, at step 208 gamut reshaping is performed in order to map the source gamut to the aimed or destination gamut. With this gamut reshaping process, each pair of source primaries, along with the white and black points, are constructed as a tetrahedron, the source primaries of which are pulled to the corresponding destination primaries, thereby adjusting the points along the lines and planes connecting the primaries as well. In this way, the source gamut is reshaped to the aimed gamut. The overall effect is that each source primary is mapped to its corresponding aimed primary and the source gamut is closely reshaped to the aimed gamut. In this step, all source gamut surface points are mapped to the aimed gamut surface, and finally to the destination gamut with minor adjustment.
Next, at step 210 selected interior points of the gamut are processed. In processing these interior nodes, interior triangles are established consisting of W (white point), K (black point), and P (one primary point), or in some embodiments, consisting of W (white point), K (black point), and one point on an edge point between two primaries. From each of these interior triangles, an interior separation point Q (that is, Q is within the aimed gamut and within the destination gamut) is established. From this interior separation point Q, a non-adjusted triangle region WQK is defined. No gamut mapping is performed on the interior points, which are those within the non-adjusted triangle region WOK, such that the source LAB color of each node in this non-adjusted region is taken as the output LAB color. For the remaining points on the WPK plane, geometrical reshaping a distance-based interpolation is applied to adjust colors.
Finally, at step 212 remaining interior points of the gamut are processed. These remaining nodes are interpolated in three-dimensional manner. For each node, six points can be used for interpolation, such that a six-weight interpolation is used. The weight for each point is computed based on the distance of the point to the point to be processed (the closer the distance, the smaller the weight).
Although specific embodiments have been illustrated and described herein, it will be appreciated by those of ordinary skill in the art that a variety of alternate and/or equivalent implementations can be substituted for the specific embodiments shown and described without departing from the scope of the present invention. This application is intended to cover any adaptations or variations of the specific embodiments discussed herein. Therefore, it is intended that this invention be limited only by the claims and the equivalents thereof.
This patent application is related to U.S. patent application Ser. No. XX/XXX,XXX filed on even date herewith entitled FAST PRIMARY MAPPING AND GAMUT ADAPTATION TO CONSTRUCT THREE DIMENSIONAL LOOK-UP TABLES having docket number 200500911-1, commonly assigned to the same assignee as the present invention, and hereby incorporated by reference herein.