Using Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match
Author
Abstract
An algorithm is suggested for implementation of unlimited primaries in two-constants Kubelka-Munk color matching attempt. Allens method for tristimulus color matching which was limited to four colorants in two constant theory, dealt with inversable matrices. By application of the pseudo-inverse, it is not necessary to limit the number of primary colors to four as Allen suggested. The suggested method is programmed to a color matching attempt with five pre-colored fibers.
)