No abstract

A method is proposed for performing spectral gamut mapping, whereby spectral images can be altered to fit within an approximation of the spectral gamut of an output device. Principal component analysis (PCA) is performed on the spectral data, in order to reduce the dimensionality of the space in which the method is applied. The convex hull of the spectral device measurements in this space is computed, and the intersection between the gamut surface and a line from the center of the gamut towards the position of a given spectral reflectance curve is found. By moving the spectra that are outside the spectral gamut towards the center until the gamut is encountered, a spectral gamut mapping algorithm is defined. The spectral gamut is visualized by approximating the intersection of the gamut and a 2-dimensional plane. The resulting outline is shown along with the center of the gamut and the position of a spectral reflectance curve. The spectral gamut mapping algorithm is applied to spectral data from the Macbeth Color Checker and test images, and initial results show that the amount of clipping increases with the number of dimensions used.

In this paper we investigate and study the color spatial uniformity of projectors. A common assumption is to consider that only the luminance is varying along the spatial dimension. We show that the chromaticity plays a significant role in the spatial color shift, and should not be disregarded, depending on the application. We base our conclusions on the measurements obtained from three projectors. Two methods are used to analyze the data, a conventional approach, and a new one which considers 3D gamut differences. The results show that the color gamut difference between two spatial coordinates within the same display can be larger than the difference observed between two projectors.

Gamut mapping algorithms are currently being developed to take advantage of the spatial information in an image to improve the utilization of the destination gamut. These algorithms try to preserve the spatial information between neighboring pixels in the image, such as edges and gradients, without sacrificing global contrast. Experiments have shown that such algorithms can result in significantly improved reproduction of some images compared with non-spatial methods. However, due to the spatial processing of images, they introduce unwanted artifacts when used on certain types of images. In this paper we perform basic image analysis to predict whether a spatial algorithm is likely to perform better or worse than a good, non-spatial algorithm. Our approach starts by detecting the relative amount of areas in the image that are made up of uniformly colored pixels, as well as the amount of areas that contain details in out-of-gamut areas. A weighted difference is computed from these numbers, and we show that the result has a high correlation with the observed performance of the spatial algorithm in a previously conducted psychophysical experiment.

No abstract