Computing Science, School of

Receive updates for this collection

Reducing Worst-Case Illumination Estimates for Better Automatic White Balance

Peer reviewed: 
Yes, item is peer reviewed.
Date created: 
2012-11
Abstract: 

Automatic white balancing works quite well on average, but seriously fails some of the time. These failures lead to completely unacceptable images. Can the number, or severity, of these failures be reduced, perhaps at the expense of slightly poorer white balancing on average, with the overall goal being to increase the overall acceptability of a collection of images? Since the main source of error in automatic white balancing arises from misidentifying the overall scene illuminant, a new illuminationestimation algorithm is presented that minimizes the high percentile error of its estimates. The algorithm combines illumination estimates from standard existing algorithms and chromaticity gamut characteristics of the image as features in a feature space. Illuminant chromaticities are quantized into chromaticity bins. Given a test image of a real scene, its feature vector is computed, and for each chromaticity bin, the probability of the illuminant chromaticity falling into a chromaticity bin given the feature vector is estimated. The probability estimation is based on Loftsgaarden-Quesenberry multivariate density function estimation over the feature vectors derived from a set of synthetic training images. Once the probability distribution estimate for a given chromaticity channel is known, the smallest interval that is likely to contain the right answer with a desired probability (i.e., the smallest chromaticity interval whose sum of probabilities is greater or equal to the desired probability) is chosen. The point in the middle of that interval is then reported as the chromaticity of the illuminant. Testing on a dataset of real images shows that the error at the 90th and 98th percentile ranges can be reduced by roughly half, with minimal impact on the mean error.

Document type: 
Conference presentation
File(s): 

Rank-Based Illumination Estimation

Peer reviewed: 
Yes, item is peer reviewed.
Date created: 
2013-11
Abstract: 

A new two-stage illumination estimation method based on the concept of rank is presented. The method first estimates the illuminant locally in subwindows using a ranking of digital counts in each color channel and then combines local subwindow estimates again based on a ranking of the local estimates. The proposed method unifies the MaxRGB and Grayworld methods. Despite its simplicity, the performance of the method is found to be competitive with other state-of-the art methods for estimating the chromaticity of the overall scene illumination.

Document type: 
Conference presentation
File(s): 

Simplifying Irradiance Independent Color Calibration

Peer reviewed: 
Yes, item is peer reviewed.
Date created: 
2014-01-08
Abstract: 

An important component of camera calibration is to derive a mapping of a camera’s output RGB to a deviceindependent color space such as the CIE XYZ or sRGB6. Commonly, the calibration process is performed by photographing a color chart in a scene under controlled lighting and finding a linear transformation M that maps the chart’s colors from linear camera RGB to XYZ. When the XYZ values corresponding to the color chart’s patches are measured under a reference illumination, it is often assumed that the illumination across the chart is uniform when it is photographed. This simplifying assumption, however, often is violated even in such relatively controlled environments as a light booth, and it can lead to inaccuracies in the calibration. The problem of color calibration under non-uniform lighting was investigated by Funt and Bastani2,3. Their method, however, uses a numerical optimizer, which can be complex to implement on some devices and has a relatively high computational cost. Here, we present an irradiance-independent camera color calibration scheme based on least-squares regression on the unitsphere that can be implemented easily, computed quickly, and performs comparably to the previously suggested technique

Document type: 
Conference presentation
File(s): 

The Dichromatic Object Colour Solid

Peer reviewed: 
Yes, item is peer reviewed.
Date created: 
2013-07
Abstract: 

The set of all possible cone excitation triplets from reflecting surfaces tmder a given illuminant forms a volume in cone excitation space known as the object-co/our solid (OCS). An important task in Color Science is to specify the precise geometry of the OCS as defined by its boundary. Schrodinger claimed that the optimal reflectances that map to the boundary of the OCS take on values of 0 or 1 only, with no more than two wavelength transitions. Although this popularly accepted assertion is, by and large, correct and holds under some restricted conditions (e.g., it holds for the CIE colour matching ftmctions), as far as the number of transitions is concented, it has been shown not to hold in general. As a result, the Schrodinger optimal reflectances provide only an approximation to the true OCS. For the case of dichromatic vision, we compare the true and approximate OCS by computing the set of true optimal reflectances, and find that they differ significantly.

Document type: 
Conference presentation
File(s): 

Hue Correlate Stability using a Gaussian versus Rectangular Object-Colour Atlas

Peer reviewed: 
Yes, item is peer reviewed.
Date created: 
2013-07
Abstract: 

The perceptual correlate to hue and the stability of its representation in the coordinates of Logvinenko's illumination-invariant object-colour atlas (Logvinenko, 2009) are investigated. Logvinenko's object-colour atlas represents the colours of objects in terms of special rectangular reflectance functions defined by 3-parameters, a (chromatic purity), o (spectral bandwidth) and A. (central wavelength) describing the rectangular reflectance to which it is metameric. These parameters were shown to be approximate perceptual correlates in terms of chroma, whiteness/blackness, and hue, respectively. When the illumination changes, the mapping of object colours to the rectangular atlas coordinates is subject to a phenomenon referred to as colour stimulus shift. The perceptual correlates shift as well. The problem of coJour stinmlus shift is exacerbated by the fact that the atlas is based on rectangular functions. This paper explores the benefits of using the Gaussian parameterization of the object-colour atlas (Logvinenko, 20 12) in terms of its robustness to colour stimulus shift and in terms of how well it maps to the perceptual correlate ofhue.

Document type: 
Conference presentation
File(s): 

The Extent of Metamer Mismatching

Peer reviewed: 
Yes, item is peer reviewed.
Date created: 
2013-07
Abstract: 

Metamer mismatching refers to the fact that two objects reflecting light causing identical colour signals (i.e., cone response or XYZ) under one illunimation may reflect light causing non-identical colour signals under a second illumination_ As a consequence of metamer mismatching, two objects appearing the same under one illuminant can be expected to appear different under the second illunimant. To investigate the potential extent of metamer mismatching, we calculated the metamer mismatching effect for 20 Munsell papers and 8 pairs of illunimants (Logvinenko & Tokunaga, 20 11) using the recent method (Logvinenko, Funt, & Godau, 2012) of computing the exact metan2er mismatch volume boundary. The results show that metamer mismatching is very significant for some lights. In fact, metamer mismatching was found to be so significant that it can lead to the prediction of some paradoxical phenomena, such as the possibility of 20 objects having the same colour under a neutral ("white") light dispersing into a whole hue circle of colours under a red light, and vice versa.

Document type: 
Conference presentation
File(s): 

A Robust Hue Descriptor

Peer reviewed: 
Yes, item is peer reviewed.
Date created: 
2013-11
Abstract: 

A hue descriptor based on Logvinenko’s illuminantinvariant object colour atlas [1] is tested in terms of how well it maps hues to the hue names found in Moroney’s Colour Thesaurus [2] [3] and how well it maps hues of Munsell papers to their corresponding Munsell hue designator. Called the KSM hue descriptor, it correlates hue with the central wavelength of a Gaussian-shaped reflectance function. An important feature of this representation is that the set of hue descriptors inherits the illuminate invariant property of Logvinenko’s object colour atlas. Despite the illuminant invariance of the atlas and the hue descriptors, metamer mismatching means that colour stimulus shift [4] can occur, which will inevitably lead to some hue shifts. However, tests show that KSM hue is robust in the sense that it is much more stable under a change of illuminant than CIELAB hue.

Document type: 
Conference presentation
File(s): 

Spectral Compression: Weighted Principal Component Analysis versus Weighted Least Squares

Peer reviewed: 
Yes, item is peer reviewed.
Date created: 
2014-02
Abstract: 

Two weighted compression schemes, Weighted Least Squares (wLS) and Weighted Principal Component Analysis (wPCA), are compared by considering their performance in minimizing both spectral and colorimetric errors of reconstructed reflectance spectra. A comparison is also made among seven different weighting functions incorporated into ordinary PCA/LS to give selectively more importance to the wavelengths that correspond to higher sensitivity in the human visual system. Weighted compression is performed on reflectance spectra of 3219 colored samples (including Munsell and NCS data) and spectral and colorimetric errors are calculated in terms of CIEDE2000 and root mean square errors. The results obtained indicate that wLS outperforms wPCA in weighted compression with more than three basis vectors. Weighting functions based on the diagonal of Cohen’s R matrix lead to the best reproduction of color information under both A and D65 illuminants particularly when using a low number of basis vectors.

Document type: 
Conference presentation
File(s): 

Subspace-Clustering-Based Multispectral Image Compression

Peer reviewed: 
Yes, item is peer reviewed.
Date created: 
2014-11
Abstract: 

This paper describes a subspace clustering strategy for the spectral compression of multispectral images. Unlike standard PCA, this approach finds clusters in different subspaces of different dimension. Consequently, instead of representing all spectra in a single low-dimensional subspace of a fixed dimension, spectral data are assigned to multiple subspaces having a range of dimensions from one to eight. For a given compression ratio, this tradeoff reduces the maximum reconstruction error dramatically. In the case of compressing multispectral images, this initial compression step is followed by lossless JPEG2000 compression in order to remove the spatial redundancy in the data as well.

Document type: 
Conference presentation
File(s): 

Gaussian Illuminants and Reflectances for Colour Signal Prediction

Peer reviewed: 
Yes, item is peer reviewed.
Date created: 
2014-11
Abstract: 

An alternative to the von Kries scaling underlying the chromatic adaptation transforms found in colour appearance models such as CIECAM02 is suggested for predicting what the colour signal (e.g., XYZ) reflected from a surface under a first illuminant is likely to become when lit instead by a second illuminant. The proposed method, G2M, employs metameric Gaussian-like functions to model the illuminant and reflectance spectra. The method’s prediction is based on relighting the Gaussian-like reflectance spectrum with the second Gaussian-like illuminant. Tests show that the proposed G2M method significantly outperforms CIECAT02.

Document type: 
Conference presentation
File(s):