TSWJ The Scientific World Journal 1537-744X 2356-6140 Hindawi Publishing Corporation 671964 10.1155/2014/671964 671964 Research Article A Color Gamut Description Algorithm for Liquid Crystal Displays in CIELAB Space Sun Bangyong 1, 2 Liu Han 2 Li Wenli 1 Zhou Shisheng 1 Meng X. Zhou Z. Zhu X. 1 School of Printing and Packing Xi'an University of Technology Xi’an 710048 China xauat.edu.cn 2 School of Automation and Information Engineering Xi'an University of Technology Xi’an 710048 China xauat.edu.cn 2014 2442014 2014 18 12 2013 22 01 2014 24 4 2014 2014 Copyright © 2014 Bangyong Sun et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Because the accuracy of gamut boundary description is significant for gamut mapping process, a gamut boundary calculating method for LCD monitors is proposed in this paper. Within most of the previous gamut boundary calculation algorithms, the gamut boundary is calculated in CIELAB space directly, and part of inside-gamut points are mistaken for the boundary points. While, in the new proposed algorithm, the points on the surface of RGB cube are selected as the boundary points, and then converted and described in CIELAB color space. Thus, in our algorithm, the true gamut boundary points are found and a more accurate gamut boundary is described. In experiment, a Toshiba LCD monitor’s 3D CIELAB gamut for evaluation is firstly described which has regular-shaped outer surface, and then two 2D gamut boundaries ( CIE- a * b * boundary and CIE- C * L * boundary) are calculated which are often used in gamut mapping process. When our algorithm is compared with several famous gamut calculating algorithms, the gamut volumes are very close, which indicates that our algorithm’s accuracy is precise and acceptable.

1. Introduction

Different color devices generally have different color gamuts because of their specific coloring parameters, such as the coloring principle (additive and subtractive), colorant (pigment or dyers), substrates, and light source (D50, D65, or others). Thus, a color image often looks different when it is output by different color devices. For example, a brightly displayed photo on a monitor commonly loses some color information when printed on the paper. For the purpose of matching color image’s visual effect between different devices, gamut mapping is often performed in digital imaging processing systems. Gamut mapping can be defined as the color rendering process which rearranges the colors from source device gamut to destination device gamut . Because source and destination gamuts mismatch each other in some regions, there exist some colors which are inside the source gamut but outside of the destination gamut, and they must be clipped or compressed into the destination gamut.

Now there are dozens of gamut mapping algorithms (or GMAs) developed by different agencies. For example, the LCLIP algorithm clips out-of-gamut colors onto the gamut boundary and leaves the chroma of in-gamut colors unchanged. The CUSP algorithm compresses colors towards a focus point, where the lightness and chroma are changed simultaneously. While for some universal GMAs, such as CARISMA or GCUSP, the mapping process is very complex but accurate. Because there are too many GMAs developed for the various color images, four specific GMAs are assigned within ICC workflow for convenience, which are absolute colorimetric, relative colorimetric, perceptual, and saturation .

Actually, these GMAs are sufficient to cope with all types of color images. However, the color inconsistency still occurs frequently when color images are transmitted from monitors to printers. As a matter of fact, one major reason which results in the gamut mapping errors comes from the gamut boundary calculation process, so it is significant to obtain the accurate gamut boundary before gamut mapping.

Gamut mapping is commonly performed in 2D coordinate, such as CIE- C * L * or CIE- a * b * coordinates . The 2D gamut boundary is a cross-section from 3D CIELAB gamut, the errors within both the 3D gamut calculation process and the 2D gamut boundary calculation process will reduce the gamut mapping precision greatly.

Because there are some problems within the present gamut calculation algorithms (analyzed in Section 2), a 2D gamut boundary calculating algorithm is developed for gamut mapping process in this paper. In experiment an LCD monitor’s gamut boundary is calculated and compared with other algorithms, and the experiment result shows that our algorithm is precise enough. In addition, it should be noted that the proposed algorithm is not only suitable for RGB monitors, but also for CMY (CMYK) printers or other color devices.

2. Different Types of Gamuts Employed in Gamut Mapping Process

In color reproduction systems, color gamut refers to the subset of colors which can be accurately represented in a given circumstance, such as within a given color image or by a certain color device. While the gamut boundary means the outer surface of the 3D gamut, or the outer contour line of the 2D gamut. Color gamut is often described in CIELAB space; this is mainly because CIELAB color spaces are independent of devices, and it is more perceptually uniform than CIEXYZ space.

Generally, there are three types of color gamuts described in CIELAB space, such as 3D CIELAB gamut, 2D CIE- a * b * gamut, and 2D CIE- C * L * gamut . The first gamut is often used for viewing the overall gamut of color devices or images but rarely used in gamut mapping process directly. The two other gamuts are described in 2D coordinates which are often applied in gamut mapping process, while the main task of this paper is to calculate the 2D gamut’s boundary for gamut mapping algorithms.

The CIE- a * b * gamut is a cross-section of 3D gamut along the constant lightness plane, and its boundary is the 3D gamut’s outer intersection line with the same lightness. The CIE- C * L * gamut is a cross-section of 3D gamut along the constant hue-angle plane, and the boundary is the intersection line at the specified hue angle. Because hue information is generally more important than lightness, the third gamut boundary is most widely used during gamut mapping.

It is significant to obtain accurate description of the 3D gamut, because the 2D gamuts are calculated from it. Several analytical models are used to predict the 3D gamut with relatively few sample colors, such as the Kubelka-Munk function , and Neugebauer equations . Moreover, Herzog considered the device’s 3D gamut as a distorted hexahedron  and used a deformation degree function to simulate the actual device gamut. Huang and Zhao used Zernike polynomials to determine the boundary , and Wang and Xu used a two-step workflow to describe CRT monitor gamut boundaries . On the whole, all these prediction algorithms are based on a specific analytical model and can get accurate gamut with few sample data. However, these methods cannot be applied to all types of color devices, because the analytical expression is highly restricted by the device status such as coloring principle, substrate, inks, and ambient light sources.

If a sufficient number of sample colors are supplied, the 3D gamut can be described with the empirical algorithms. These algorithms do not focus on analyzing the devices’ coloring principle or the relationship between device color space and the corresponding CIELAB values; they straightly simulate the 3D gamut with the measured CIELAB values. Thus these methods can be used for all types of color devices, even for color images gamut calculation. Within these empirical algorithms, Balasubramanian and Dalal used a modified convex hull method to compute gamut, in a way of adjusting the concave gamut surfaces into convex . Cholewo and Love used alpha-shape to describe the gamut surface for an inkjet printer , and the gamut was controlled by an alpha parameter which was interactively selected with a visualization system. Because it is difficult to determine the optimal parameter values, Morovic proposed the segment maxima gamut boundary description (SMGBD) algorithm to compute media and device gamut . However, sometimes there are no boundary points falling into certain segments, it must be created by interpolation method, which pulls errors into the gamut calculations.

In general, the analytical algorithms can be used neither for all types of color devices, nor for the color images, while, for the empirical algorithms, the calculated boundary points are not very precise, because some inside-gamut boundary points may be mistaken for boundary points. In the paper, a new gamut description algorithm is proposed for calculating liquid crystal display (LCD) monitors'  3D and 2D gamut. Similar to Herzog’s algorithm, the 3D CIELAB gamut is deemed as a deformed hexahedron, and the relationship between device and CIELAB gamut is analyzed and established, but it should be noted that the calculation process is far less complicated. For the experimented LCD monitor, the gamut boundary points are firstly found out in RGB space, and these obtained points are the true boundary points which are on the surface of RGB cube. And then the RGB boundary points are converted into CIELAB values, while the 3D or 2D gamuts are described based on these boundary points.

3. Three-Dimensional<italic> CIELAB</italic> Gamut Description

During the gamut description for LCD monitors, the device color of RGB signals are controlled by users to form the sample data, and the corresponding CIELAB values are obtained by measuring the screen when the RGB colors are displayed. In general, the calculation of monitor gamut in CIELAB space can be divided into three steps, which are RGB sample data generating, CIELAB data measuring, and 3D or 2D gamut calculation.

3.1. Generating the Sample Data

In order to obtain the monitor’s CIELAB gamut boundary, the colors around the device gamut boundary should be selected to generate the sample data. Thus, for color monitors, the colorant gamut boundary is actually the outer surface of RGB cube, and the sample colors should be collected from it. With respect to the points on the top of RGB cube surfaces, there is at least one or two signals maintaining the maximal or minimal values.

If the R , G , and B values are ranging within 0~255 or normalized to 0~1, a certain amount of sample colors can be obtained by dividing the RGB cube surfaces’ two colorants into m and n sections as below: (1) O sample = { 2 n u + v u , v [ R , G , B ] , h h h [ u ] = { 0 , 1 m , 2 m , , 1 } , h h h [ v ] = { 0 , 1 n , 2 n , , 1 } } .

When the RGB sample signals are sent to the displaying driver, they will be displayed on the monitor, and the spectral transmittance is measured by using a spectrophotometer. Then the CIEXYZ Tristimulus can be calculated with the following: (2) X = K 380 780 S ( λ ) x - ( λ ) τ ( λ ) d λ , Y = K 380 780 S ( λ ) y - ( λ ) τ ( λ ) d λ , Z = K 380 780 S ( λ ) z - ( λ ) τ ( λ ) d λ , K = 100 380 780 S ( λ ) y - ( λ ) R ( λ ) d λ , where S ( λ ) is relative spectral power distribution of the illuminant, x - ( λ ) ,    y - ( λ ) , and   z - ( λ ) are the color-matching functions for CIE 2° standard observer (1931), and τ ( λ ) is the spectral transmittance of color patch, while the CIELAB values can be converted from the CIEXYZ values using the following: (3) L * = 116 f ( Y Y n ) - 16 , a * = 500 [ f ( X X n ) - f ( Y Y n ) ] , b * = 200 [ f ( Y Y n ) - f ( Z Z n ) ] , where X n ,   Y n , and Z n are the CIEXYZ tristimulus values of the reference white point, and the function f is defined as follows: (4) f ( t ) = { t 1 / 3 if    t > ( 29 6 ) 3 1 3 ( 29 6 ) 2 t + 4 29       otherwise .

3.2. Calculation of 3D<italic> CIELAB</italic> Gamut

When a certain amount of sample colors are obtained, there will be many scattered points distributed in RGB or CIELAB space. The outer surface of RGB cube is the device gamut boundary with regular shape, and it will be severely deformed when converted into CIELAB space. For example, if the monitor’s RGB cube is uniformly sampled by setting m = n = 9 , in other words every colorant evenly changes in the range of [ 0 32 64 96 128 160 192 224 255 ] , there will be 9 scattered points on each of the RGB cube edges.

The deformation between RGB cube and 3D CIELAB gamut can be analyzed by comparing the distribution of those 12 edges in these two color spaces. Figure 1(a) is the device RGB gamut boundary formed by its 12 edges, and its corresponding CIELAB gamut boundary points is shown in Figure 1(b). It is obvious that the colorimetric CIELAB gamut looks like a deformed hexahedron in , whereas the deformation degree varies in different locations or for different devices.

Gamut boundary formed by 12 edges of RGB cube.

RGB cube

Corresponding CIELAB gamut

To get the complete 3D gamut description, the six faces of the RGB cube should be converted into CIELAB space. Among the sampling points above, as only a part of them located on the outer surface of gamut, the RGB boundary points should be firstly extracted from the six RGB cube faces, and they are depicted in Figure 2. It can be seen that if all these 3D scattered points are smoothly connected, the complete and closed 3D gamut can be obtained.

Scattered samples in colorant and colorimetric space.

Scattered RGB boundary

Scattered CIELAB boundary

With those obtained boundary points in CIELAB space, Delaunay triangulation technique can be used to link them, and the final completed 3D gamut boundary is composed of a quantity of triangular facets. Since the gamut surface is partitioned into planar triangles, the volume can be calculated when an interior point is assigned. For example, when the center point O  (50, 0, 0) in CIELAB space is selected, and all the vertices within each surface triangle are connected with the center point, then the CIELAB gamut is divided into many tetrahedrons. The overall gamut volume is the sum of the tetrahedrons’ volumes, while each tetrahedron’s volume can be calculated as below: (5) V = 1 6 1 1 1 1 50 L 1 * L 2 * L 3 * 0 a 1 * a 2 * a 3 * 0 b 1 * b 2 * b 3 * , where    L 1 * a 1 * b 1    * , L 2 * a 2 * b 2 * , and L 3 * a 3 * b 3 * are three surface vertices of the tetrahedron.

4. Two-Dimensional Gamut Boundary for Gamut Mapping Algorithms

Because gamut mapping is commonly carried out in 2D gamut boundary, such as CIE- a * b * or CIE- C * L * gamut boundary, the 2D gamut boundary should be accurately determined. The 2D gamut is a cross- section of 3D CIELAB gamut; thus the 2D gamut boundaries can be determined by slicing the 3D gamut along constant-lightness plane or constant-hue-angle plane.

However, because the 3D boundary points do not distribute uniformly, when the scattered 2D boundary points are interpolated from the nearby 3D boundary points, there will be lots of errors caused. We propose a new method to calculate the 2D gamut boundary, in which the 2D boundary points are firstly found within the RGB cube, and then their CIELAB values are converted which are used to describe the gamut boundary in CIE- a * b * or CIE- C * L * coordinates.

4.1. <italic>CIE</italic>-<inline-formula> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M37"> <mml:msup> <mml:mrow> <mml:mi>a</mml:mi></mml:mrow> <mml:mrow> <mml:mi>*</mml:mi></mml:mrow> </mml:msup> <mml:msup> <mml:mrow> <mml:mi>b</mml:mi></mml:mrow> <mml:mrow> <mml:mi>*</mml:mi></mml:mrow> </mml:msup></mml:math> </inline-formula> Gamut Boundary Calculation

The RGB cube has eight vertices, twelve edges, and six faces. For color monitors, the lightness (CIE- L * values) of the vertices in the RGB cube varies greatly. Take the widely used ICC profile of sRGB, for example; the RGB cube’s eight vertices’ CIELAB values are listed in Table 1, and it can be seen that the vertices’ lightness values are arranged in a sequence of below: W > Y > C > G > M > R > B > K . Actually most of the RGB monitors accord with this discipline.

RGB and CIELAB values of the vertices for sRGB.ICC.

Color RGB L * a * b *
K (0, 0, 0) 0 0 0
B (0, 0, 255) 30 67 −128
R (255, 0, 0) 55 79 65
M (255, 0, 255) 60 91 −79
G (0, 255, 0) 88 −81 71
C (0, 255, 255) 91 −53 −34
Y (255, 255, 0) 98 −18 83
W (255, 255, 255) 100 −2 −19

In addition, as the lightness changes continuously on the faces of RGB cube, when a specific lightness value is given, a constant-lightness plane will intersect with some of the RGB faces, while the intersection line corresponds to the CIE- a * b * gamut boundary line. To calculate the constant-lightness gamut boundary, the scattered boundary points should be firstly found, and the process can be described in the following steps.

(1) Compare the given lightness l with twelve edges’ lightness, and find out the boundary points on the edges equal to the given lightness value. For example, if L C l L W , which means that the lightness value l is within the range of edge CW, then it can be concluded that an intersection point with lightness l must exist in the edge CW.

The intersection point can be found by comparing the edge’s sample colors. If two closet sample colors are expressed as x and y , as their RGB and CIELAB values are known, the intersection point p ’s R values can be interpolated as below (the same for G and B values): (6) R p = R x + L p * - L x * L y * - L x * ( R y - R x ) .

(2) For the constant-lightness lines on the RGB cube surface, there are generally three or four edges which contain the intersection points among all the twelve edges. As shown in Figure 3, when the edge intersection points are connected, the constant-lightness lines may form a triangle ( C I E - L * = 20 ) or quadrangle ( C I E - L * = 60 ) .

The scattered constant-lightness gamut boundary on RGB cube’s edges.

L * = 20

L * = 60

(3) Because the constant-lightness gamut boundary is a closed and smooth curve, several boundary points are calculated from the corresponding cube faces, for the purpose of obtaining the full description of the gamut boundary. The face intersection points can also be found by comparing the sample colors of the RGB cube face, which is similar to the process of calculating edge intersection points. Thus, when all the face boundary points are connected, the two constant-lightness gamut boundaries of Figure 3 are described with more details in Figure 4.

The scattered constant-lightness gamut boundary on RGB cube’s faces.

L * = 20

L * = 60

(4) After the scattered gamut boundary points in RGB space are calculated, the CIE- a * b * gamut boundary can be obtained by converting the boundary points from RGB space to CIELAB space. There are actually several color conversion models, such as 3D interpolation , polynomial regression [15, 16], and neural network [17, 18]. In the paper, the polynomial regression method is used because of the model’s precision and the quantity of sample colors, and the utilized polynomials are expressed as below: (7) P ( R , G , B ) = c 0 + c 1 R + c 2 G + c 3 B + c 4 R G + c 5 G B + c 6 R B + c 7 R 2 + c 8 G 2 + c 9 B 2 + c 10 R G B + c 11 R 2 G + c 12 R 2 B + c 13 G 2 R + c 14 G 2 B + c 15 B 2 R + c 16 B 2 G + c 17 R 3 + c 18 G 3 + c 19 B 3 , where c i ( i = 0,1 , , 19 ) are the coefficients which can be determined by the least square method [19, 20]. Take one constant-lightness boundary, for example; it is depicted in RGB and CIELAB spaces respectively, as shown in Figure 5.

The constant-lightness gamut on RGB cube and CIELAB space.

2D gamut on RGB cube ( L * = 80 )

The gamut on CIE- a * b * plane ( L * = 80 )

4.2. <italic>CIE</italic>-<inline-formula> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M75"> <mml:msup> <mml:mrow> <mml:mi>C</mml:mi></mml:mrow> <mml:mrow> <mml:mi>*</mml:mi></mml:mrow> </mml:msup> <mml:msup> <mml:mrow> <mml:mi>L</mml:mi></mml:mrow> <mml:mrow> <mml:mi>*</mml:mi></mml:mrow> </mml:msup></mml:math> </inline-formula> Gamut Boundary Calculation

The CIE- C * L * gamut boundary can be seen as a cross-section of the constant-hue-angle plane with 3D CIELAB gamut, and it is widely used in gamut mapping process. As most of the 3D gamut is calculated by the scattered sample data with interpolation method, it is hard to get the line boundary point directly using the continuous 3D gamut. Similar to the calculation of constant-lightness gamut, the constant-hue-angle boundary points are firstly calculated in RGB cube and then converted into CIELAB color space and described in the CIE- C * L * coordinate, where the CIE- C * is calculated from CIE- a * and CIE- b * values: (8) C * = b * 2 + b * 2 .

During description of the 2D CIE- C * L * gamut, the scattered boundary points are firstly calculated and then connected with Bezier curves or straight lines. Although the boundary looks smoother when Bezier curves are used, the computing efficiency is inferior to the straight lines, which is very important for the gamut mapping process. Thus, the CIE- C * L * gamut boundary is connected using straight lines in this paper.

5. Experiments

In experiment, the gamut boundaries of a Toshiba LCD monitor are calculated. Firstly, the RGB device color space is uniformly divided, and the red, green, and blue signals all range within [ 0 32 64 96 128 160 192 224 255 ] ; thus there are 9 3 = 729 sample colors totally. And then the sample RGB colors are displayed on the LCD monitor; the corresponding CIELAB values are measured by using the spectrophotometer X -Rite DTP94. At last, the monitor’s 3D CIELAB gamut and two other 2D gamut boundaries are described using the algorithm proposed in the paper.

As shown in Figure 6, the 3D gamut is described in CIELAB color space, and it looks like a deformed hexahedron as Herzog proposed. Compared with the initial RGB cube, the CIELAB gamut also has eight vertices and six continual curved faces, although most of sample colors’ relative positions have changed. From the described CIELAB gamut, the overall displaying capacity of the monitor can be evaluated, which will help to select the right gamut mapping algorithms.

The continual 3D gamut in CIELAB of Toshiba monitor.

3D gamut in RGB space

3D gamut in CIELAB space

Bakke et al. proposed a method for evaluating different gamut boundary calculating algorithms , and the two testing algorithms are compared by using a parameter of gamut volume mismatching rate, which is expressed in the following: (9) r i = V ( G i / G ref ) + V ( G ref / G i ) V ( G ref ) , where r i represents the gamut volume mismatching rate, V ( G ref ) is the volume of reference gamut, and V ( G i / G ref ) is the volume of colors which are inside of gamut G i but outside of gamut G ref . In experiment, the gamuts determined by our algorithm are selected as reference gamut, and three famous gamut description algorithms, SMGBD, convex hull, and alpha shape, are employed as a contrast. Consequently, the mismatching rates are 3.2%, 2.4%, and 3.7%, respectively, which indicate that our algorithm’s accuracy is very close to the three successful algorithms.

Additionally, two kinds of 2D gamut mapping boundaries, CIE- a * b * and CIE- C * L * boundaries, are calculated using the method described in Sections 4.1 and 4.2. For the testing monitor, several constant-lightness lines with the lightness from 10 to 95 are found in RGB cube and then described in CIELAB space, as shown in Figure 7. Similarly, two CIE- C * L * boundaries are listed in Figure 8, and the hue angles are 30, 210, and 330 respectively.

The 2D gamut boundary of different lightness.

Different constant-lightness gamut boundaries on RGB cube

Corresponding gamut boundaries in CIELAB space

The 2D gamut with different hue angle.

h = 30

h = 210

6. Conclusions

The gamut of monitor is generally bigger than printers; thus when a displayed image is printed, gamut mapping should be performed in advance. Gamut mapping is the technique of replacing nonprintable colors by printable ones, conserving the appearance of an image. There are two major reasons which influence the gamut mapping precision, selection of gamut mapping algorithms and the calculation of gamut boundaries. Because many successful GMAs are developed for various images and color devices, it is very significant to improve the accuracy of gamut boundaries. In the paper, a new gamut boundary algorithm for color devices is proposed, and an LCD monitor is tested with having the 3D and 2D gamut boundaries described. In experiment, the described 3D CIELAB gamut boundary has regular-shaped outer surface, and the 2D CIE- a * b * and CIE- C * L * boundaries both have smooth boundary lines. For the purpose of precision evaluation, our algorithm is compared with other famous gamut description algorithms, and the result shows that the gamut volume difference is very little, which indicates that this algorithm is acceptable. Besides, it should be noted that, although the color monitor’s gamut is described in experiment, the proposed gamut boundary calculating algorithm can also be applied to other color devices, such as cameras, scanners, or printers.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

This work is supported by Research Foundation of Department of Education of Shaanxi Province (no. 11JK0541), Doctor Foundation of Xi’an university of Technology (104-211302), “13115” Creative Foundation of Science and Technology, Shaanxi Province of China. This research was funded by a Grant (no. 104-211302) from the Research Doctor Foundation of Xi’an University of Technology.

Morovic J. To develop a universal gamut mapping algorithm [Ph.D. thesis] 1998 Derby, UK University of Derby Green P. Holm J. Li W. Recent developments in ICC color management Color Research and Application 2008 33 6 444 448 2-s2.0-63349101744 10.1002/col.20446 Huang T.-W. Ou-Yang M. Gamut boundary description for one dependent primary color Journal of the Optical Society of America A: Optics and Image Science, and Vision 2009 26 10 2163 2171 2-s2.0-70349668421 10.1364/JOSAA.26.002163 Morovič J. Luo M. R. Calculating medium and image gamut boundaries for gamut mapping Color Research and Application 2000 25 6 394 401 2-s2.0-0000557480 Engeldrum P. G. Computing color gamuts of ink-jet printing systems SID Proceedings 1985 27 1 25 30 2-s2.0-0022325209 Mahy M. Calculation of color gamuts based on the Neugebauer model Color Research and Application 1997 22 6 365 374 2-s2.0-0031379579 Herzog P. G. Analytical color gamut representations Journal of Imaging Science and Technology 1996 40 6 516 521 2-s2.0-0030281840 Huang Q. Zhao D. Gamut mapping based on gamut boundaries expressed with Zernike polynomials Optical Technique 29 2 168 171 Wang Y. Xu H. Colorimetric characterization of liquid crystal display using an improved two-stage model Chinese Optics Letters 2006 4 7 432 434 2-s2.0-33748449656 Balasubramanian R. Dalal E. A Method for quantifying the color gamut of an output device 3018 Color Imaging: Device-Independent Color, Color Hard Copy, and Graphic Arts 1997 110 116 Proceedings of SPIE 10.1117/12.271580 Cholewo T. J. Love S. Gamut boundary determination using alpha-shapes Proceedings of the 7th Color Imaging Conference November 1999 Scottsdale, Ariz, USA 200 204 2-s2.0-33646222037 Ibrahim P. Yucel A. Multiscale gradients-based color filter array interpolation IEEE Transactions on Image Processing 2013 22 1 157 165 10.1109/TIP.2012.2210726 Srivastava S. Delp E. J. Ha T. H. Allebach J. P. Color management using optimal three-dimensional look-up tables Journal of Imaging Science and Technology 2010 54 3 30 40 2-s2.0-77954521840 10.2352/J.ImagingSci.Technol.2010.54.3.030402 Henry Kang R. Color Technology for Electronic Imaging Devices 1997 Washington, DC, USA SPIE Press Li Z. Zhang H. Fu H. Red long-lasting phosphorescence based on color conversion process Optical Materials 2013 35 3 451 455 10.1016/j.optmat.2012.09.043 Bianco S. Gasparini F. Schettini R. Vanneschi L. Polynomial modeling and optimization for colorimetric characterization of scanners Journal of Electronic Imaging 2008 17 4 43 52 2-s2.0-70350662490 10.1117/1.2982004 043002 Ioannis I. Alexander G. Barry G. Deriving ocean color products using neural networks Remote Sensing of Environment 2013 134 78 99 10.1016/j.rse.2013.02.015 Li X. Scanner color management model based on improved back-propagation neural network Chinese Optics Letters 2008 6 3 231 234 2-s2.0-42449162688 10.3788/COL20080603.0231 Kim S. Kojima M. Solving polynomial least squares problems via semidefinite programming relaxations Journal of Global Optimization 2010 46 1 1 23 2-s2.0-72449163632 10.1007/s10898-009-9405-3 Vogt F. Gritti F. Guiochon G. Polynomial multivariate least-squares regression for modeling nonlinear data applied to in-depth characterization of chromatographic resolution Journal of Chemometrics 2011 25 11 575 585 2-s2.0-82255192408 10.1002/cem.1403 Bakke A. M. Farup I. Hardeberg J. Y. Evaluation of algorithms for the determination of color gamut boundaries Journal of Imaging Science and Technology 2010 54 5 50 62 2-s2.0-78649367254 10.2352/J.ImagingSci.Technol.2010.54.5.050502 050502