Abstract

The computational problem underlying color vision is to recover the invariant surface-spectral-reflectance properties of an object. Lightness algorithms, which recover an approximation to surface reflectance in independent wavelength channels, have been proposed as one method to compute color. This paper clarifies and formalizes the lightness problem by proposing a new formulation of the intensity equation on which lightness algorithms are based and by identifying and discussing two basic subproblems of lightness and color computation: spatial decomposition and spectral normalization of the intensity signal. Several lightness algorithms are reviewed, and a new extension (the multiple-scales algorithm) of one of them is proposed. The main computational result is that each of the lightness algorithms may be derived from a single mathematical formula, under different conditions, which, in turn, imply limitations for the implementation of lightness algorithms by man or machine. In particular, the algorithms share certain limitations on their implementation that follow from the physical constraints imposed on the statement of the problem and the boundary conditions applied in its solution.

© 1986 Optical Society of America

Analysis of the retinex theory of color vision

David H. Brainard and Brian A. Wandell
J. Opt. Soc. Am. A 3(10) 1651-1661 (1986)

Simultaneous color constancy

Lawrence Arend and Adam Reeves
J. Opt. Soc. Am. A 3(10) 1743-1751 (1986)

Color constancy: a method for recovering surface spectral reflectance

Laurence T. Maloney and Brian A. Wandell
J. Opt. Soc. Am. A 3(1) 29-33 (1986)

Lightness and brightness over spatial illumination gradients

Lawrence E. Arend and Robert Goldstein
J. Opt. Soc. Am. A 7(10) 1929-1936 (1990)

Method for computing the scene-illuminant chromaticity from specular highlights

Hsien-Che Lee
J. Opt. Soc. Am. A 3(10) 1694-1699 (1986)