SOLUTIONS OF SEVERAL COLOR-MATCHING PROBLEMS USING PROJECTION THEORY

We use the method of projections onto convex sets (POCS) to solve several problems related to color matching. As is well known, POCS is an iterative algorithm that projects onto a sequence of contraint sets and eventually produces a solution that satisfies all the prior known constraints. Among the questions that we address are the following: (1) What is the smallest adjustment required of a given spectrum to produce color matching in a color-sensitive visual system? (2) What contributions of basis colors will produce a match to a particular set of measurements? (3) What is a parsimonious mixture of colors that, when added to a given spectrum, will produce a prior-determined color match?