PubMed Health⌕ Search

Biomedical subjects

Graham D Finlayson

Publications and source records attributed to Graham D Finlayson.

6 recordsLinked to original sources

Analytic solution for separating spectra into illumination and surface reflectance components.

The measured light spectrum is the result of an illuminant interacting with a surface. The illuminant spectral power distribution multiplies the surface spectral reflectance function to form a color signal--the light spectrum that gives rise to our perception. Disambiguation of the two factors, illuminant and surface, is difficult without prior knowledge. Previously [IEEE Trans. Pattern Anal. Mach. Intell.12, 966 (1990); J. Opt. Soc. Am. A21, 1825 (2004)], one approach to this problem applied a finite-dimensional basis function model to recover the separate illuminant and surface reflectance components that make up the color signal, using principal component bases for lights and for reflectances. We introduce the idea of making use of finite-dimensional models of logarithms of spectra for this problem. Recognizing that multiplications turn into additions in such a formulation, we can replace the original iterative method with a direct, analytic algorithm with no iteration, resulting in a speedup of several orders of magnitude. Moreover, in the new, logarithm-based approach, it is straightforward to further design new basis functions, for both illuminant and reflectance simultaneously, such that the initial basis function coefficients derived from the input color signal are optimally mapped onto separate coefficients that produce spectra that more closely approximate the illuminant and the surface reflectance for any given dimensionality. This is accomplished by using an extra bias correction step that maps the analytically determined basis function coefficients onto the optimal coefficient set, separately for lights and surfaces, for the training set. The analytic equation plus the bias correction is then used for unknown input color signals.

Journal Article↗

On the removal of shadows from images.

This paper is concerned with the derivation of a progression of shadow-free image representations. First, we show that adopting certain assumptions about lights and cameras leads to a 1D, gray-scale image representation which is illuminant invariant at each image pixel. We show that as a consequence, images represented in this form are shadow-free. We then extend this 1D representation to an equivalent 2D, chromaticity representation. We show that in this 2D representation, it is possible to relight all the image pixels in the same way, effectively deriving a 2D image representation which is additionally shadow-free. Finally, we show how to recover a 3D, full color shadow-free image representation by first (with the help of the 2D representation) identifying shadow edges. We then remove shadow edges from the edge-map of the original image by edge in-painting and we propose a method to reintegrate this thresholded edge map, thus deriving the sought-after 3D shadow-free image.

Algorithms↗

Reevaluation of color constancy algorithm performance.

The relative performance of color constancy algorithms is evaluated. We highlight some problems with previous algorithm evaluation and define more appropriate testing procedures. We discuss how best to measure algorithm accuracy on a single image as well as suitable methods for summarizing errors over a set of images. We also discuss how the relative performance of two or more algorithms should best be compared, and we define an experimental framework for testing algorithms. We reevaluate the performance of six color constancy algorithms using the procedures that we set out and show that this leads to a significant change in the conclusions that we draw about relative algorithm performance as compared with those from previous work.

Journal Article↗

Metamer-set-based approach to estimating surface reflectance from camera RGB.

We present an approach to estimating the reflectance of a surface given its camera response. In this approach we first solve the general form of this problem: we calculate the set of all possible surface reflectances, called the metamer set, and then choose a member from this set. Three possibilities in choosing a single reflectance are described here. First, we assume that all reflectances are equally likely and minimize worst-case error. Second, we adopt the assumption that reflectances follow a normal probability distribution and maximize this probability. Finally, we assume that reflectances are smooth and maximize this property. The results of our experiments show that there is significant benefit from the proposed approach in terms of the accuracy of the estimation compared with that of standard estimation methods. Moreover, the present approach introduces a notion of robustness of estimates in the form of error bars.

Journal Article↗

Metamer sets.

If two different surfaces look the same when viewed under a particular light source, then they are called metamers. We show mathematically how one can solve for the whole set of physically realizable natural surface reflectances that relate to the same tristimulus, the metamer set. Our analysis is based on very general linear models of reflectances, coupled with constraints that reflectances should adhere to (e.g., positivity and boundedness). We show that we can recover metamer sets for linear models of an arbitrary high dimension. To illustrate our new algorithm, we provide an example of calculating the metamer set and its manifestation as a mismatch region. Given a single XYZ observed under illuminant D65, we can examine the set of XYZs that would be possible under illuminant A.

Journal Article↗

Multispectral processing without spectra.

It is often the case that multiplications of whole spectra, component by component, must be carried out,for example when light reflects from or is transmitted through materials. This leads to particularly taxing calculations, especially in spectrally based ray tracing or radiosity in graphics, making a full-spectrum method prohibitively expensive. Nevertheless, using full spectra is attractive because of the many important phenomena that can be modeled only by using all the physics at hand. We apply to the task of spectral multiplication a method previously used in modeling RGB-based light propagation. We show that we can often multiply spectra without carrying out spectral multiplication. In previous work [J. Opt. Soc. Am. A 11, 1553 (1994)] we developed a method called spectral sharpening, which took camera RGBs to a special sharp basis that was designed to render illuminant change simple to model. Specifically, in the new basis, one can effectively model illuminant change by using a diagonal matrix rather than the 3 x 3 linear transform that results from a three-component finite-dimensional model [G. Healey and D. Slater, J. Opt. Soc. Am. A 11, 3003 (1994)]. We apply this idea of sharpening to the set of principal components vectors derived from a representative set of spectra that might reasonably be encountered in a given application. With respect to the sharp spectral basis, we show that spectral multiplications can be modeled as the multiplication of the basis coefficients. These new product coefficients applied to the sharp basis serve to accurately reconstruct the spectral product. Although the method is quite general, we show how to use spectral modeling by taking advantage of metameric surfaces, ones that match under one light but not another, for tasks such as volume rendering. The use of metamers allows a user to pick out or merge different volume structures in real time simply by changing the lighting.

Journal Article↗