Optimum solution of the CIECAM02 yellow–blue and purple problems |
| |
| Authors: | Jun Jiang Zhifeng Wang M. Ronnier Luo Manuel Melgosa Michael H. Brill Changjun Li |
| |
| Affiliation: | 1. School of Electronics and Information Engineering, University of Science and Technology Liaoning, Anshan, People's Republic of China;2. School of Art and Design, University of Leeds, Leeds, United Kingdom;3. Department of Optics, University of Granada, Granada, Spain;4. Datacolor, Lawrenceville, NJ |
| |
| Abstract: | Brill [Color Res Appl 2006;31:142‐145] and Brill and Süsstrunk [Color Res Appl 2008;33:424‐426] found that CIECAM02 has the yellow–blue and purple problems and gave partial solutions to them. In this article we model the optimum solution to the yellow–blue and purple problems simultaneously as a constrained non‐linear optimization problem. An optimum solution resulting in a new CAT02 matrix is numerically obtained. This new matrix satisfies the nesting rule and performs better than the Hunt‐Pointer‐Estévez (HPE) matrix in predicting both corresponding colours and colour appearance data sets. Specifically, it was found that the new and HPE matrices performed significantly different on nine (out of 21) corresponding colour data sets and on all corresponding colours data sets as a whole. © 2014 Wiley Periodicals, Inc. Col Res Appl, 40, 491–503, 2015 |
| |
| Keywords: | colour appearance models chromatic adaptation CIECAM02 CAT02 HPE corresponding colour data sets |
|
|
