Predicting the Performance of a Spatial Gamut Mapping Algorithm
Journal article, Peer reviewed
MetadataShow full item record
Original versionBakke, A. M., Farup, I., & Hardeberg, J. Y. (2009). Predicting the Performance of a Spatial Gamut Mapping Algorithm. In R. Eschbach, G. G. Marcu, S. Tominaga & A. Rizzi (Eds.), Color imaging XIV displaying, processing, hardcopy, and applications: 20-22 January 2009, San Jose, California, United States (pp. 9). Bellingham, Wash.: SPIE. http://dx.doi.org/10.1117/12.805852
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 informa- tion 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.
This is the copy of journal's version originally published in Proc. SPIE 7241. Reprinted with permission of SPIE: http://spie.org/x10.xml?WT.svl=tn7