TY - JOUR
T1 - A comparison of computational color constancy algorithms - Part II
T2 - Experiments with image data
AU - Barnard, Kobus
AU - Martin, Lindsay
AU - Coath, Adam
AU - Funt, Brian
N1 - Funding Information:
Manuscript received December 17, 2000; revised May 1, 2002. This work was supported by the National Research Council of Canada (NSERC) and Hewlett-Packard Laboratories. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Mark S. Drew.
PY - 2002/9
Y1 - 2002/9
N2 - We test a number of the leading computational color constancy algorithms using a comprehensive set of images. These were of 33 different scenes under 11 different sources representative of common illumination conditions. The algorithms studied include two gray world methods, a version of the Retinex method, several variants of Forsyth's gamut-mapping method, Cardei et al,'s neural net method, and Finlayson et al.'s Color by Correlation method. We discuss a number of issues in applying color constancy ideas to image data, and study in depth the effect of different preprocessing strategies. We compare the performance of the algorithms on image data with their performance on synthesized data. All data used for this study is available online at http://www.cs.sfu.ca/~color/data, and implementations for most of the algorithms are also available (http://www.cs.sfu.ca/∼color/code). Experiments with synthesized data (part one of this paper) suggested that the methods which emphasize the use of the input data statistics, specifically Color by Correlation and the neural net algorithm, are potentially the most effective at estimating the chromaticity of the scene illuminant. Unfortunately, we were unable to realize comparable performance on real images. Here exploiting pixel intensity proved to be more beneficial than exploiting the details of image chromaticity statistics, and the three-dimensional (3-D) gamut-mapping algorithms gave the best performance.
AB - We test a number of the leading computational color constancy algorithms using a comprehensive set of images. These were of 33 different scenes under 11 different sources representative of common illumination conditions. The algorithms studied include two gray world methods, a version of the Retinex method, several variants of Forsyth's gamut-mapping method, Cardei et al,'s neural net method, and Finlayson et al.'s Color by Correlation method. We discuss a number of issues in applying color constancy ideas to image data, and study in depth the effect of different preprocessing strategies. We compare the performance of the algorithms on image data with their performance on synthesized data. All data used for this study is available online at http://www.cs.sfu.ca/~color/data, and implementations for most of the algorithms are also available (http://www.cs.sfu.ca/∼color/code). Experiments with synthesized data (part one of this paper) suggested that the methods which emphasize the use of the input data statistics, specifically Color by Correlation and the neural net algorithm, are potentially the most effective at estimating the chromaticity of the scene illuminant. Unfortunately, we were unable to realize comparable performance on real images. Here exploiting pixel intensity proved to be more beneficial than exploiting the details of image chromaticity statistics, and the three-dimensional (3-D) gamut-mapping algorithms gave the best performance.
KW - Algorithm
KW - Color by correlation
KW - Color constancy
KW - Comparison
KW - Computational
KW - Gamut constraint
KW - Neural network
UR - http://www.scopus.com/inward/record.url?scp=0036709248&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0036709248&partnerID=8YFLogxK
U2 - 10.1109/TIP.2002.802529
DO - 10.1109/TIP.2002.802529
M3 - Article
C2 - 18249721
AN - SCOPUS:0036709248
SN - 1057-7149
VL - 11
SP - 985
EP - 996
JO - IEEE Transactions on Image Processing
JF - IEEE Transactions on Image Processing
IS - 9
ER -