A well-known color constancy method is based on the Grey-World assumption i.e. the average reflectance of surfaces in the world is achromatic. In this article we propose a new hypothesis for color constancy, namely the Grey-Edge hypothesis assuming that the average edge difference in a scene is achromatic. Based on this hypothesis, we propose an algorithm for color constancy. Recently, the Grey-World hypothesis and the max-RGB method were shown to be two instantiations of a Minkowski norm based color constancy method. Similarly we also propose a more general version of the Grey-Edge hypothesis which assumes that the Minkowsky norm of derivatives of the reflectance of surfaces is achromatic. The algorithms are tested on a large data set of images under different illuminants, and the results show that the new method outperforms the Grey-World assumption and the max-RGB method. Results are comparable to more elaborate algorithms, however at lower computational costs.
[1]
David A. Forsyth,et al.
A novel algorithm for color constancy
,
1990,
International Journal of Computer Vision.
[2]
Graham D. Finlayson,et al.
Shades of Gray and Colour Constancy
,
2004,
CIC.
[3]
Brian V. Funt,et al.
A comparison of computational color constancy Algorithms. II. Experiments with image data
,
2002,
IEEE Trans. Image Process..
[4]
Ingeborg Tastl,et al.
Gamut Constrained Illuminant Estimation
,
2006,
International Journal of Computer Vision.
[5]
Brian V. Funt,et al.
A comparison of computational color constancy algorithms. I: Methodology and experiments with synthesized data
,
2002,
IEEE Trans. Image Process..
[6]
Brian V. Funt,et al.
A data set for color research
,
2002
.
[7]
G. Buchsbaum.
A spatial processor model for object colour perception
,
1980
.