Abstract

If we are given the spectrophotometric curves of a color and three colorants to be used in matching it, the computation of the concentrations of the three colorants required for a tristimulus match is a complicated nonlinear problem. However, with the help of an approximating assumption, a linear solution may be obtained by a matrix inversion technique. Although this is an approximate solution, it is better the less meta-meric the match. With this rough solution as a starting point, iteration may be used to approach an exact match to any desired degree of accuracy. The inverted matrix used for the iterative computation is identical to that used for the rough solution.

© 1966 Optical Society of America

Basic equations used in computer color matching, II. Tristimulus match, two-constant theory

Eugene Allen
J. Opt. Soc. Am. 64(7) 991-993 (1974)

Comparison of Uncertainty Ellipses Calculated from Two Spectrophotometric Colorimetry Methods by an Automatic-Computer Program

Isadore Nimeroff
J. Opt. Soc. Am. 56(2) 230-237 (1966)

Improving the performance of computer color matching procedures

A. Karbasi, S. Moradian, and S. Asiaban
J. Opt. Soc. Am. A 25(9) 2251-2262 (2008)

Color Prediction Using the Two-Constant Turbid-Media Theory*

Hugh R. Davidson and Henry Hemmendinger
J. Opt. Soc. Am. 56(8) 1102-1109 (1966)

Formulation of Transparent Colors with a Digital Computer

F. W. Billmeyer, J. K. Beasley, and J. A. Sheldon
J. Opt. Soc. Am. 50(1) 70-72 (1960)