Abstract
AbstractA 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
