Volume 14, Issue 2 (1-1996)
1996, 14(2): 13-20 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
S. H. Amirshahi. Using Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match. Computational Methods in Engineering 1996; 14 (2) :13-20
URL: http://jcme.iut.ac.ir/article-1-80-en.html
URL: http://jcme.iut.ac.ir/article-1-80-en.html
Abstract: (4576 Views)
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.
Keywords: -
