Convex and non-convex illuminant constraints for dichromatic colour constancy

Finlayson, G. D. and Schaefer, G. (2001) Convex and non-convex illuminant constraints for dichromatic colour constancy. In: Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2001-12-08 - 2001-12-14.

Full text not available from this repository. (Request a copy)

Abstract

The dichromatic reflectance model introduced by S. Shafer (1985) predicts that the colour signals of most materials fall on a plane spanned by a vector due to the material and a vector that represents the scene illuminant. Since the illuminant is in the span of all dichromatic planes, colour constancy can be achieved by finding the intersection of two or more planes. Unfortunately, this approach has proven to be hard to get to work in practice. First, segmentation needs to be carried out and second, the actual intersection computation is quite unstable: small changes in the orientation of a dichromatic plane can significantly alter the location of the intersection point. We propose to ameliorate the instability problem by regularising the intersection. Specifically, we introduce a constraint on the colour of the illuminant. We show how the intersection problem in the context of convex and non-convex illuminant constraints, based on the distribution of common light sources, can be solved. This algorithm coupled with the simplest of segmentations results in good estimation results for a large set of real images. Estimation performance is significantly better than for the unconstrained algorithm.

Item Type: Conference or Workshop Item (Paper)
Faculty \ School: Faculty of Science > School of Computing Sciences
Related URLs:
Depositing User: Vishal Gautam
Date Deposited: 18 Aug 2011 11:19
Last Modified: 25 Jul 2018 01:00
URI: https://ueaeprints.uea.ac.uk/id/eprint/22655
DOI: 10.1109/CVPR.2001.990528

Actions (login required)

View Item View Item