The proposed algorithm suggests a new method for determination of K/S value of primaries based on linear least Squares Technique. By applying the matrix pseudoinverse, a modification is introduced to eliminate the limitation on the numbers of applied dyes in one – constant Kubelka-Munk theory. The selection of dyes for tristimulus matching are also done on the basis of the initial spectrophotometric results. The applicability of suggested methods are tested through a computer colour matching attempt with more/less than three primaries.
H. Khalili S. H. Amirshahi, . (1998). An Algorithm for Color Matching of Textiles With Elimination of Limitation on Primaries. Journal of Computational Methods in Engineering, 17(1), 187-196.
MLA
H. Khalili S. H. Amirshahi, . "An Algorithm for Color Matching of Textiles With Elimination of Limitation on Primaries", Journal of Computational Methods in Engineering, 17, 1, 1998, 187-196.
HARVARD
H. Khalili S. H. Amirshahi . (1998). 'An Algorithm for Color Matching of Textiles With Elimination of Limitation on Primaries', Journal of Computational Methods in Engineering, 17(1), pp. 187-196.
CHICAGO
H. Khalili S. H. Amirshahi, "An Algorithm for Color Matching of Textiles With Elimination of Limitation on Primaries," Journal of Computational Methods in Engineering, 17 1 (1998): 187-196,
VANCOUVER
H. Khalili S. H. Amirshahi . An Algorithm for Color Matching of Textiles With Elimination of Limitation on Primaries. J Comput Methods Eng. 1998;17(1): 187-196.
