Abstract

Uses 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 constraint sets and eventually produces a solution that satisfies all prior known constraints. Among the questions addressed are: (1) what is the smallest adjustment required of a given spectrum to produce color matching in a color sensitive visual system? and (2) what contributions of basis colors will produce a match to a particular set of measurements?. >

Full Text
Paper version not known

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