z-logo
Premium
Recursive quadratic programming algorithm for color matching
Author(s) -
Cogno J. A.
Publication year - 1988
Publication title -
color research and application
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.393
H-Index - 62
eISSN - 1520-6378
pISSN - 0361-2317
DOI - 10.1002/col.5080130211
Subject(s) - trichromacy , matching (statistics) , quadratic equation , color difference , quadratic programming , algorithm , field (mathematics) , mathematics , computer science , artificial intelligence , mathematical optimization , color vision , geometry , statistics , enhanced data rates for gsm evolution , pure mathematics
A recursive quadratic programming (RQP) algorithm for color matching is described. RQP does not work on the assumption that the difference of spectral reflectance between sample and match can be approximated by a first‐order expansion. Color matching is instead obtained only by agreement of a trichromatic specification. A numerical example showing a possible field of application of RQP is presented.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here