An algorithm is suggested for implementation of unlimited primaries in two-constants Kubelka-Munk color matching attempt. Allen's 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.
S. H. Amirshahi, (1996). Using Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match. Journal of Advanced Materials in Engineering (Esteghlal), 14(2), 13-20.
MLA
S. H. Amirshahi. "Using Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match". Journal of Advanced Materials in Engineering (Esteghlal), 14, 2, 1996, 13-20.
HARVARD
S. H. Amirshahi, (1996). 'Using Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match', Journal of Advanced Materials in Engineering (Esteghlal), 14(2), pp. 13-20.
VANCOUVER
S. H. Amirshahi, Using Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match. Journal of Advanced Materials in Engineering (Esteghlal), 1996; 14(2): 13-20.
', './data/jame/coversheet/cover_en.jpg'))
