Premium
Set theoretic estimation for problems in subtractive color
Author(s) -
Sharma Gaurav
Publication year - 2000
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/1520-6378(200010)25:5<333::aid-col4>3.0.co;2-8
Subject(s) - subtractive color , color space , mathematics , formalism (music) , regular polygon , computer science , set (abstract data type) , artificial intelligence , algorithm , mathematical optimization , image (mathematics) , optics , geometry , art , visual arts , programming language , musical , physics
The use of linear algebra and set theoretic estimation for problems in color science and imaging is reviewed. Through a product‐space formalism, the powerful projections onto convex sets (POCS) algorithm is extended to subtractive color systems satisfying convex constraints in the density domain. Several convex sets are defined, which are useful in color science and imaging, and projections onto these sets are presented. The usefulness of the new methods is demonstrated by applying them to three practical problems: (1) model‐based scanner calibration, (2) design of color scanning filters that are color mixture curves, and (3) colorant formulation. © 2000 John Wiley & Sons, Inc. Col Res Appl, 25, 333–348, 2000