Volume 14, Issue 2 (1-1996)                   jame 1996, 14(2): 13-20 | Back to browse issues page

XML Persian Abstract Print


Abstract:   (4621 Views)
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.
Keywords: -
Full-Text [PDF 494 kb]   (1362 Downloads)    
Type of Study: Research | Subject: General
Received: 2014/10/25 | Published: 1996/01/15

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.