Back to articles
Volume: 15 | Article ID: art00043
Fast Computation of Multi–Primary Color Gamuts
  DOI :  10.2352/CIC.2007.15.1.art00043  Published OnlineJanuary 2007

As the number of primaries used in an imaging system increases, so does the cost of computing the resulting color gamut. While for three or even four primaries it is possible to use exhaustive techniques to generate a relatively small number of samples that provide sufficient gamut boundary information, taking the same approach with devices using a larger number of primaries (e.g. 6+) leads to a combinatorial explosion. To address this issue while providing accurate information about the color gamut of a multi– primary device, the present paper describes the PSS primary space sampling algorithm that reduces gamut computation time from centuries to seconds.

Subject Areas :
Views 14
Downloads 0
 articleview.views 14
 articleview.downloads 0
  Cite this article 

Ján Morovič, "Fast Computation of Multi–Primary Color Gamutsin Proc. IS&T 15th Color and Imaging Conf.,  2007,  pp 228 - 232,

 Copy citation
  Copyright statement 
Copyright © Society for Imaging Science and Technology 2007
Color and Imaging Conference
color imaging conf
Society of Imaging Science and Technology
7003 Kilworth Lane, Springfield, VA 22151, USA