Convex Programming Colour Constancy with a Diagonal Offset Model

Finlayson, G. D., Hordley, S. and Xu, R. (2005) Convex Programming Colour Constancy with a Diagonal Offset Model. In: IEEE International Conference on Image Processing, 2005-09-11 - 2005-09-14.

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

Abstract

Gamut mapping colour constancy algorithms attempt to map image RGBs captured under an unknown light to corresponding RGBs under a reference light so as to render images colour constant. While the approach often works well, for a significant number of real images the algorithm delivers a solution. We show that the solution problem arises because of a failure of the diagonal model of illumination change on which the algorithm is based. We address the problem by proposing a new diagonal-offset model which has 6 rather than 3 parameters and which is able therefore to deal with a wider range of imaging conditions. Based on this model we formulate a convex programming solution to colour constancy and we show (by testing on real images) that the new algorithm is robust to the failures of the diagonal model and is capable of delivering very good colour constancy.

Item Type: Conference or Workshop Item (Paper)
Faculty \ School: Faculty of Science > School of Computing Sciences
Related URLs:
Depositing User: Vishal Gautam
Date Deposited: 14 Jun 2011 11:34
Last Modified: 31 Oct 2019 17:30
URI: https://ueaeprints.uea.ac.uk/id/eprint/23154
DOI: 10.1109/ICIP.2005.1530550

Actions (login required)

View Item View Item