Gradient — where it appears
Named by 11 essays across 4 fields — each of them below, with the objects they name alongside it.
A gradient is a path
Two colours fix the ends of a blend and nothing else. The middle is decided by the space the interpolation happens in, and four spaces in daily use put the halfway point of one ordinary gradient as much as thirty-seven units of colour difference apart.
The trade only runs one way
Standing at the basis that adapts best, one per cent of adaptation buys forty-four per cent of the way to the discrimination floor. Standing at the basis that discriminates best, the same one per cent buys under two. The scatter that shows two objectives pulling apart looks symmetric and is not, and the asymmetry is what a committee choosing between them would most want to know.
The mixture line bows
Grassmann's second law says an additive mixture is exactly linear in tristimulus values, and tested here it is exact to floating point. Nothing downstream of the three numbers preserves it. The physical half-and-half mixture of two colours sits a median of 5.5 colour differences from the midpoint of their two readings and up to thirty; on a green and a blue display primary it is twenty-one, which is a quarter of the distance between them.
Which mixture bows most depends on the ruler
The physical half-and-half mixture of two lights misses the midpoint of their two readings in any unit a person is shown, and the share it misses by is about the same in ΔE₀₀ and in the appearance model's own space — 12.8 and 14.6 per cent at the median. Which mixtures miss most is not. The rank correlation between the two units is 0.57, a display's blue and yellow is the worst pair in one and the mildest in the other, and the smaller number usually quoted for the appearance model is its power correction rather than a straighter line.
A distance raised to a power has no length
CAM16-UCS's colour difference is its Euclidean distance raised to the power 0.63 and multiplied by 1.41. That is still a metric — the triangle inequality holds on every one of four thousand random triples — and it has no length. A grey ramp from black to white measures 25 units in one step, 137 in a hundred and 755 in ten thousand, growing as the number of steps to the power 0.37, and halving the size of a step triples the number of steps that fit.
A resize with a negative weight in it
A blend taken on stored values is always darker than the blend of the light, because the encoding is concave and a convex combination of a concave function's values lies below the function of the combination. A bicubic or Lanczos resize is not a convex combination. Beside an edge its negative weights make the stored-value result lighter than the light's own — by up to 6.1 colour differences with bicubic and 12.2 with Lanczos on skin against its shadow — and on edges between full-scale values the clip hides the overshoot and the old guarantee appears to hold.
The straight line is not the shortest gradient
A colour difference formula says what a small step costs at every colour, and that is enough to ask which path between two colours is shortest. It is not the straight line: between red and green the shortest path bows thirteen CIELAB units away, saves four per cent — and stays inside sRGB on every step where the straight line leaves it. The formula's own answer for the two endpoints, meanwhile, is neither length.
Two uniform spaces disagree about between
ΔE₀₀'s own local behaviour says which colours lie between two colours, and so does CAM16-UCS's. They do not agree. On cyan to magenta the two shortest paths run fifteen CIELAB units apart — more than either runs from the straight line — and on that gradient ΔE₀₀ would rather have the straight line than CAM16-UCS's answer. Getting the comparison at all takes noticing that one of the two has no local metric: its published difference is a Euclidean distance raised to the power 0.63, and a power below one has an infinite derivative at zero.
A gamut charges a gradient nothing
On red to green the shortest path happened to stay inside sRGB where the straight line did not, and that was called a coincidence of mechanism. Made into a measurement it is not a coincidence: constraining a path to stay inside the gamut costs less of the metric's own length than the relaxation's own noise, on every gradient tested — including the ones whose free shortest path is outside at fifteen of its twenty-one steps. The gamut's boundary and the metric's cheap region point the same way, and the price of the constraint is nothing.
A third space breaks the tie only once
ΔE₀₀ and CAM16-UCS disagree about which colours lie between two colours. Oklab was the obvious tie-breaker, and it breaks the tie on one gradient of five: on red to blue its path runs within six CIELAB units of CAM16-UCS's and twenty-nine from ΔE₀₀'s. On red to green and cyan to magenta it keeps to CIELAB's straight line while both others bow, and on blue to yellow it bows further than either. Each of the three spaces is the odd one out somewhere. Asking also exposed a CAM16-UCS path that had never converged.
A press makes the cheap route a search
Holding a gradient inside a display's gamut cost nothing measurable, and the essay that found it credited the gamut's convexity. A press's gamut is not convex: 216 of 630 straight lines between colours on its own hue ring leave it. Holding gradients inside the press still costs little at best, a median of a tenth of a per cent. But the best route depends on where the relaxation starts, the free path is the best start on one gradient of ten, and on half of them some start is trapped at more than twice the free length. On the display no start is trapped.
Named alongside it
The objects these essays reach for when they reach for this one.
CIEDE2000CIELABColour differenceInterpolationPerceptual uniformityGamutDisplay gamutMetric axiomsAdditive mixtureAnisotropyCIECAM16Colour appearance