Beige, Aqua, Fuchsia, etc.: Some Definitions for NonBasic Surface Colour Names(also see the accompanying data files in PolyhedronFiles.zip), 2017, not yet submitted.
FourTransition 01 Functions for Reflectance Spectra, 2017, not yet submitted.
sRGB Centroids for the ISCCNBS Colour System(also see the accompanying data files in DataFilesForsRGBtoISCCNBS.zip), 2016, under review.
Pastels: A Colour Guide for Artists and Manufacturers,Journal of the International Colour Association, Vol. 17, pp. 1832, August 2017
The Coefficient of Variation as a Measure of Spectrophotometric Repeatability,2015, accepted for publication in Color Research and Application.
Enforcing KubelkaMunk Constraints for Opaque Paints,2015, under review.
A Colour Survey of Artist's Pastels,Journal of the International Colour Association, Vol. 15, pp. 4259, May 2016.
MinimalEnergy Control Sequences for Linear MultiPrimary Displays,Journal of Imaging Science and Technology, Vol. 59, No. 5, pp. 0505021 to 05050210, September/October 2015.
Consistent Shadow Values For Painters,Journal of the International Colour Association, Vol. 14, pp. 3746, April 2015.
Geometric Invariants Under Illuminant Transformations,Color Research & Application, Vol. 39, No. 2, pp. 179187, April 2014.
Shadow Colours For Painters,Journal of the International Colour Association, Vol. 11, pp. 1827, July 2013.
A Zonohedral Approach to Optimal Colours,Color Research & Application, Vol. 38, No. 2, pp. 110119, April 2013.
Shadow Series in the Munsell System,Color Research & Application, Vol. 38, No. 1, pp. 5864, Feb 2013.
An OpenSource Inversion Algorithm for the Munsell Renotation,Color Research & Application, Vol. 37, No. 6, pp. 455464, Dec 2012.
NonMetamerism of Boundary Colors in MultiPrimary Displays,Journal of the Society for Information Display, Vol. 20, Issue 4, pp. 214220, Apr 2012.
Extensible MultiPrimary Control Sequences,Journal of the Society for Information Display, Vol. 20, Issue 1, pp. 1221, Jan 2012.
An OpenSource Algorithm for Metamer Mismatch Bodies(also see the accompanying routine DrawMetamerMismatchBody.m), 2017.
Zonohedral Gamuts For Colour Constancy,2016.
Red Like You've Never Seen It Before,the Hue Angles column for ISCC Newsletter #471, August 2015.
A Measuring Protocol for Printed Matter, Using the XRite i1iO Scanning Table,July 2015.
Perceptual Reflectance Weighting for Estimating KubelkaMunk Coefficients,2013.
Comments on the University of Joensuu's Matte Munsell Measurements,2013.
How To Print A Munsell Book,2013.
Conversions Between the Munsell and sRGB Colour Systems,2013.
Book review of Jan Koenderink's Color for the Sciences,2012.
A QuasiCenter for Planar Convex Sets,2016.
A GJKBased Algorithm for Constrained Least Squares,2015, looking for a suitable math journal for publication. (If anybody knows of one, please let me know.)
Finsler Laplacians and MinimalEnergy Maps,International Journal of Mathematics, Vol. 11, No. 01, pp. 113, February 2000.
Volume Forms in Finsler Spaces,Houston Journal of Mathematics, Vol. 25, No. 4, pp. 625640, 1999.
Continuity of Attractors and Invariant Measures of Iterated Function Systems,Canadian Mathematics Bulletin, Vol. 37, pp. 315329, 1993.
Shadow Series in the Munsell System. This article is
the technical basis for
Shadow Colours For Painters.
Abstract: Using an inversion of the Munsell renotation, this paper calculates that a colour's shadow series is approximately a straight line in the Munsell system. The line starts at the colour's Munsell specification and ends about one value step below N0, on the neutral axis. The colour's hue in shadow shifts slightly towards the yellow part of the spectrum. The calculations suggest that ideal black belongs at about N(1) in the Munsell system, rather than at N0, if equality of perceptual steps is to be maintained. Similarly, ideal white should be slightly lighter than N10. The picture (Fig. 4 of the article) shows 182 shadow series, along with approximating least squares lines, plotted in terms of their values and chromas, but disregarding hue, in the Munsell system. 

A Zonohedral Approach to
Optimal Colours. This article provides an intuitive description of colour space.
Abstract: This paper demonstrates that the CIE XYZ colour solid is a zonoid. An approximating zonohedral colour solid is constructed explicitly from a set of generating vectors, which are integrals of colourmatching functions over narrow intervals of the visible spectrum. The zonohedral approach yields an intuitive, constructive proof of the Optimal Colour Theorem: the reflectance function of an optimal colour takes on only the values 0 or 1, with at most two transition wavelengths. In addition, zonohedral techniques can simplify computations: for example, optimal colours can be found without calculating transition wavelengths. Finally, zonohedra provide a simple, unified approach to colour space, and eliminate much of the confusion arising from chromaticity diagrams. The picture (Fig. 9 of the article) shows the Illuminant C colour solid. 

The previous article led to a joint paper with Michael H. Brill,
Extensible
MultiPrimary Control Sequences
Abstract: In a display with more than three primaries (called a multiprimary display), a color can be expressed as multiple combinations (called control sequences) of primaries. This paper presents an algorithm for assigning control sequences, that preserves current assignments when further primaries are added. We call these control sequences extensible. It is shown that the gamut of any number of primaries is a zonohedron, which can be dissected into parallelepipeds. Control sequences are assigned within each parallelepiped. The current parallelepipeds remain when more primaries are added, so the current assignments are preserved. Multiprimary displays can also cause unwanted metamerism, and make continuous color scales appear discontinuous. The algorithm avoids these problems. When viewed through natural filters, such as yellowed ocular lenses, multiprimary displays can sometimes make two different colors appear identical. If the primaries satisfy the BinetCauchy criterion, which is always the case when all primaries are monochromatic, then these spurious matches are avoided. The picture (Fig. 4 of the article) shows a dissection of a zonohedral gamut, resulting from four primaries, into parallelepipeds. 

Further development along the same lines:
Geometric Invariants Under Illuminant Transformations.
Abstract: An object colour's CIE XYZ coordinates can change when it is viewed under different illuminants. The set of XYZ coordinates for all object colours, which is called the objectcolour solid, likewise varies under different illuminants. This paper shows that, despite these changes, some properties are invariant under illuminant transformations. In particular, as long as the illuminant is nowhere zero in the visible spectrum, optimal colours take the same Schrödinger form, and no two optimal colours are metameric. Furthermore, all objectcolour solids have the same shape at the origin: they all fit perfectly into the convex cone (which we will call the spectrum cone) generated by the spectrum locus. The spectrum cone, itself, does not vary when the illuminant changes. The objectcolour solid for one illuminant can be transformed into the solid for another illuminant, by an easily visualized sequence of expansions and contractions of irregular rings, called zones. The picture (Fig. 4 of the article) shows an example of a zone around the objectcolour solid for a simplified illuminant. 

An investigation of the accuracy of some published Munsell books and measurements:
Comments on the University of Joensuu's Matte Munsell Measurements.
Abstract: The University of Joensuu's measurements of the 1976 Munsell Book are one of the few publicly available sets of spectral reflectance measurements of Munsell samples. This article evaluates colour differences between the printed Munsell matte samples and the 1943 renotation standard. The median difference was found to be 3.6 or 6.9 CIEDE2000 units, depending on which spectrophotometer was used for the measurements. Furthermore, the Munsell values of the printed samples showed strong biases relative to the renotation, as did some of the hues and chromas. By comparison, the median differences for two Munsell books produced after 2000 are between 1.5 and 2.0, and all the individual Munsell components are biasfree. Their deviations from the standard suggest that Joensuu's measurements are not a sound basis for further analysis of the Munsell system. The picture (Fig. 1 of the article) shows the colour differences (with respect to CIEDE2000) between the Joensuu measurements of the 1976 Munsell Book of ColorGlossy Finish and the 1943 Munsell renotation standard 

A refinement to a 1987 KubelkaMunk algorithm:
Perceptual Reflectance Weighting for Estimating KubelkaMunk Coefficients.
Abstract: The KubelkaMunk model relates the colours of mixtures to the absorption and scattering coefficients (K and S) of the constituent colorants. A 1987 least squares algorithm by Walowit, McCarthy, and Berns estimates K and S for a set of constituent colorants, from the reflectance spectra of mixtures of those colorants. Their algorithm implicitly weights all the least squares residuals equally. As a result of analyzing residuals and perceptual factors, the current paper recommends a new weighting, called perceptual reflectance weighting. The residuals are shown to follow a probability distribution that depends on S, reflectance level, and reflectance measurement errors. These errors are modeled as an unbiased normal distribution, with the same variance at all reflectance levels. In addition, CIE L* describes how perceptual response depends on reflectance level. Perceptual reflectance weighting combines both these dependencies into one weight. The 1987 algorithm is easily modified, by multiplying each row (except the last) of its coefficients matrix by the appropriate weight, and by using the original estimates of S. An example, taken from practice, illustrates that the new weights can significantly change and improve the 1987 algorithm. The picture (Fig. 7 of the article) shows the 1987 algorithm (called the WMB algorithm, after its developers, E. Walowit, C. McCarthy, and R. Berns) and the suggested refinement (called the weighted WMB algorithm), applied to a sample data set. This set was simulated to be consistent with the KubelkaMunk mixture model, and the only error it contains is reflectance measurement error. The weighted WMB algorithm produces more stable results than the 1987 WMB algorithm. 

Further development for multiprimary displays:
MinimalEnergy
Control Sequences for Linear MultiPrimary Displays.
Abstract: A control sequence gives the intensities of the primaries for a pixel in a display. A multiprimary display has four or more primaries, so that multiple control sequences can sometimes produce the same colour. Different primaries likely consume different amounts of energy. A minimalenergy control sequence for a target colour produces that colour with as little energy as possible. This paper shows that such minimalenergy sequences take a simple geometric form. The display gamut, in CIE XYZ space, can be dissected into parallelepipeds. The originating vertex of each parallelepiped is the sum of a set of primaries at full intensity. Each edge of a parallelepiped is the translation of one primary. A colour with XYZ coordinates in a certain parallelepiped is a unique linear combination of the primaries in the originating vertex, and the three edge primaries. This paper proves that there exists a dissection such that these linear combinations are minimalenergy control sequences. In the generic case, this dissection is unique. An algorithm for a minimalenergy dissection is presented, along with an example. The picture (Fig. 2 of the article) shows an example of an exploded parallelepiped dissection of a fourprimary gamut (Figure 2 of the article). 

A method to enforce physical constraints (such as requiring paint concentrations in a mixture to be between
0 and 1) when using the KubelkaMunk model:
Enforcing Constraints
in KubelkaMunk Calcuations.
Abstract: The KubelkaMunk model relates the colours of mixtures to the absorption and scattering coefficients (K and S) of the constituent colorants, and to their concentrations (C) in the mixtures. All K's and S's are nonnegative, and C's are physically constrained to be between 0 and 1. Standard estimation procedures cast the KubelkaMunk relationships as an overdetermined linear system, and apply ordinary least squares (OLS). OLS, however, sometimes produces coefficients or concentrations that are less than 0 or greater than 1. This paper proposes using the GilbertJohnsonKeerthi (GJK) algorithm instead of OLS. Not only are GJK solutions always between 0 and 1, but they also satisfy other conditions; for example, concentrations sum to 1. While OLS projects a target vector onto a vector subspace, in fact the set of physically realizable paint combinations is a convex polytope, which is a subset of that subspace. The GJK algorithm finds the point on that polytope that is closest to the target vector. Since it belongs to the polytope, the closest point is physically realizable and satisfies the KubelkaMunk constraints. One step (Fig. 4 of the article) in the GJK algorithm, which calculates the closest point between a point and a convex polytope, described by a set of generating points. 

As a byproduct of many spectrophotometric measurements,
The Coefficient of
Variation as a Measure of Spectrophotometric Repeatability presents a finergrained method than
the MCDM for evaluating measurement variability.
Abstract: The mean colour difference from the mean (MCDM) is a standard measure of spectrophotometric repeatability. This paper proposes a supplementary measure: the coefficient of variation (CoV), which is the ratio of the standard deviation of the measured reflectances to their mean. The CoV is calculated from the same repeated sample measurements as the MCDM. Unlike the MCDM, the CoV depends only on physical quantities, and not on perceptual quantities; furthermore, a CoV is defined for each wavelength. This paper analyzes data from six different spectrophotometersample combinations. An important empirical result is that the CoV is nearly constant across wavelengths, except when the reflectance at a particular wavelength is less than about five percent, in which case measurement variability is dramatically greater. Since the MCDM tends to lose this fact through averaging, the CoV is recommended as an adjunct to the MCDM for spectrophotometer analysis and development. The CoV analysis also provides evidence that samples' surface geometry is a major factor in measurement variability. 

Producing pastel guides for artists involved measuring a large number of artist's pastels.
Since pastels cover a wide colour gamut, and can be very saturated,
A Colour Survey
of Artist's Pastels analyzed the available colour in terms of the Pointer gamut.
Abstract: Spectrophotometric measurements were made of 3154 artist's chalk pastels, comprising the complete lines of eight brands (Rembrandt, Unison, Sennelier, Schmincke, Girault, Blue Earth, Mount Vision, and Great American). Text files and spreadsheets of reflectance spectra, CIE coordinates, and Munsell specifications, are made publicly available; another file lists which pastels are closest to the Munsell renotation colours. The pastels' gamut was compared to the Pointer gamut of real surface colours, which was converted to Munsell space. The Pointer gamut in Munsell space is also made publicly available. About 65 pastels, mostly light yellows and bluepurples, fall outside the Pointer gamut, suggesting that it can be extended. 

Another application of zonohedra,
Zonohedral Gamuts
For Colour Constancy
suggests some improvements to gamutbased illuminant estimation (GBIE)
algorithms, which are used for colour constancy.
Abstract: Forsyth's 1990 gamutbased illuminant estimation (GBIE) is an important colour constancy algorithm. When a sensing device (assumed to contain three individual sensors) makes an image of physical objects under a single illuminant, GBIE uses the RGB outputs of the image to estimate the illuminant. The set of all RGB outputs in the image is called the image gamut. The set of all RGB outputs that could result when a particular illuminant shines on an object of arbitrary local colour is called the illuminant gamut for that illuminant. Forsyth's algorithm uses the fact that a particular illuminant can be a possible light source for an image only if that illuminant's gamut contains that image's gamut. Implementations to date have used training sets of reflectance spectra to approximate illuminant gamuts. A main result of the current paper is a method for calculating illuminant gamuts exactly, rather than approximating them: geometric constructions prove that illuminant gamuts are zonohedra, and that they are generated by the device's spectrum locus vectors, which are the RGB outputs for monochromatic reflectance spectra. On a more negative note, the same geometric constructions also show that some common GBIE practices are theoretically unsound. In particular, many implementations assume that a linear image of an illuminant gamut is again an illuminant gamut; also, containment tests are sometimes performed in chromaticity space rather than RGB space. The underlying geometry contraindicates both these practices. Finally, a new GBIE algorithm is suggested, that calculates zonohedral gamuts explicitly, avoids contraindicated practices, and takes advantage of the geometry of colour constancy. 

sRGB Centroids for the
ISCCNBS Colour System
provides a way of displaying colours in the ISCCNBS system as sRGBs, for digital applications.
Abstract: The ISCCNBS colour system specifies 267 colour categories with nontechnical names such as ``light purplish pink.'' Computer monitors typically specify colours by redgreenblue (RGB) coordinates, standardized in the sRGB system. This paper presents a detailed technical description of conversions between the two systems. Many sRGB triples fall in a particular ISCCNBS category; the centroid of all such triples, calculated with respect to a Euclidean metric on sRGB space, is taken as the most representative sRGB for that category. The conversion uses the Munsell system as an intermediary. ISCCNBS categories, which apply to object colours, are not immediately compatible with sRGB coordinates, which apply to light sources. To achieve compatibility, it is assumed that an sRGB monitor is viewed under Illuminant C (the standardized illuminant for Munsell and ISCCNBS), at intensity levels that make the monitor's colours appear as object colours. The paper's practical results include a simple lookup table for the centroids, and some opensource code for further development. 

An OpenSource Algorithm
for Metamer Mismatch Bodies
carefully derives a simple algorithm, implemented in the opensource routine
DrawMetamerMismatchBody.m
Abstract: Suppose that two different imaging devices produce two colour images of the same physical object, or that one device images the same object under two different illuminants. A metamer mismatch occurs when two colours are identical in one image, but different in the other image. Each colour output in the first image could have been produced by a large set, called a metamer set, of reflectance spectra. In the second image, the metamer set might produce a wide variety of colour outputs, referred to in their entirety as a metamer mismatch body (MMB). This article presents a simple algorithm for constructing an MMB, by expressing its vertex in an arbitrary direction as a solution to a linear programming program. The algorithm finds not only vertices, but also the reflectance spectra that, when imaged by the second device, produce those vertices. Geometric and algebraic structures behind the algorithm are defined and analyzed in detail. While the linear programming approach to MMBs is not new, the current paper aims to make it accessible, rigorous, and easy to use; to this end, there is an accompanying opensource Octave/Matlab implementation, containing about 30 source lines of code. 

FourTransition 01
Functions for Reflectance Spectra
Abstract: It is known that a reflectance spectrum for an optimal colour takes on the value 0 or 1 at every wavelength, with at most two transitions between those values. This paper shows that any nonoptimal colour can be produced by a reflectance spectrum that takes on the value 0 or 1 at every wavelength, with at most four transitions. While the twotransition optimal spectrum is unique, the fourtransition nonoptimal spectrum is not unique. 

Beige, Aqua, Fuchsia, etc.:
Some Definitions for NonBasic Surface Colour Names
Abstract: Many common surface colour names such as beigelack technical definitions. This paper uses a data set of about 16,000 reflectance spectra of named physical samples, collected by the Color Association of the United States (CAUS), to infer definitions for 20 common nonbasic surface colour names (aqua, beige, coral, fuchsia, gold, lavender, lilac, magenta, mauve, navy, peach, rose, rust, sand, tan, taupe, teal, turquoise, violet, wine), as well as Berlin and Kay's basic names (excepting black). A convex polyhedron in the Munsell tree is constructed for each name. Any colour inside the polyhedron, and only such a colour, is described by that name, with the implicit understanding that the polyhedron's boundaries are inherently fuzzy; the polyhedron's centroid can be taken as the name's focal colour. Accompanying files make the polyhedra publicly available. The current analysis is unique in using a threedimensional definition, in its large number of surface colours, and in its inclusion of nonbasic surface colour names. After presenting the analysis results, comparisons are made to other investigations of naming. 