What does Colour-Vision Deficiency and Discriminability conclude, in numbers, about “The Machado Matrices: Simulating Three Kinds of Dichromacy in Linear sRGB”?
Answer: The 216 colours form 23220 pairs. The protan simulation yields 46 confusion pairs, a share of 0.0020; the most extreme is the dark green #006633 against the bright red #FF0033, which differ by 70.61 in normal view and by only 1.51 after simulation. The deutan simulation yields 120 pairs, a share of 0.0052; the most extreme is the turquoise #00CC99 against the pink #FF6699, a normal difference of 77.30 reduced to 2.02. The tritan simulation yields no confusion pairs under these thresholds.
Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (21 programs), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.0020, 0.0052, 00, 0033, 006633, 1.51
| 216 colours, 23220 pairs | |||||
| view | confusions | share | worst pair | normal | sim |
| protan | 46 | 0.0020 | #006633 #FF0033 | 70.61 | 1.51 |
| deutan | 120 | 0.0052 | #00CC99 #FF6699 | 77.30 | 2.02 |
| tritan | 0 | 0.0000 | none |
Show the full program
# Chapter 3. p32: confusion pairs among the 216 web-safe colours.
# Model: every pair of the 6 x 6 x 6 web-safe cube; a confusion pair is
# one with CIEDE2000 >= 20 in normal view but < 3 after the Machado 2009
# severity-1.0 simulation. Thresholds 20 and 3 are illustrative.
import math
def lin(c):
v = c / 255.0
if v <= 0.04045:
return v / 12.92
return ((v + 0.055) / 1.055) ** 2.4
def rgb(h):
h = h.lstrip("#")
return tuple(lin(int(h[i:i + 2], 16)) for i in (0, 2, 4))
def lum(c):
return math.fsum((0.2126 * c[0], 0.7152 * c[1], 0.0722 * c[2]))
def contrast(a, b):
hi, lo = sorted((lum(a), lum(b)), reverse=True)
return (hi + 0.05) / (lo + 0.05)
# Machado, Oliveira and Fernandes 2009, Table 1, severity 1.0 (rows).
MACHADO = {
"protan": ((0.152286, 1.052583, -0.204868),
(0.114503, 0.786281, 0.099216),
(-0.003882, -0.048116, 1.051998)),
"deutan": ((0.367322, 0.860646, -0.227968),
(0.280085, 0.672501, 0.047413),
(-0.011820, 0.042940, 0.968881)),
"tritan": ((1.255528, -0.076749, -0.178779),
(-0.078411, 0.930809, 0.147602),
(0.004733, 0.691367, 0.303900)),
}
def sim(c, kind):
# applied to linear sRGB, then clipped to the display range
if kind == "normal":
return tuple(c)
out = []
for row in MACHADO[kind]:
v = math.fsum(m * x for m, x in zip(row, c))
out.append(min(1.0, max(0.0, v)))
return tuple(out)
SRGB_XYZ = ((0.4124, 0.3576, 0.1805),
(0.2126, 0.7152, 0.0722),
(0.0193, 0.1192, 0.9505))
def xyz(c):
return tuple(math.fsum(m * x for m, x in zip(row, c))
for row in SRGB_XYZ)
WHITE = xyz((1.0, 1.0, 1.0))
def _f(t):
d = 6.0 / 29.0
if t > d ** 3:
return t ** (1.0 / 3.0)
return t / (3.0 * d * d) + 4.0 / 29.0
def lab(c):
fx, fy, fz = (_f(v / w) for v, w in zip(xyz(c), WHITE))
return (116.0 * fy - 16.0, 500.0 * (fx - fy), 200.0 * (fy - fz))
def de00(p, q):
# CIEDE2000 with kL = kC = kH = 1 (Sharma, Wu and Dalal 2005)
l1, a1, b1 = p
l2, a2, b2 = q
cm = (math.hypot(a1, b1) + math.hypot(a2, b2)) / 2.0
g = 0.5 * (1.0 - math.sqrt(cm ** 7 / (cm ** 7 + 25.0 ** 7)))
a1p, a2p = (1.0 + g) * a1, (1.0 + g) * a2
c1p, c2p = math.hypot(a1p, b1), math.hypot(a2p, b2)
h1p = math.degrees(math.atan2(b1, a1p)) % 360.0 if c1p else 0.0
h2p = math.degrees(math.atan2(b2, a2p)) % 360.0 if c2p else 0.0
dl, dc = l2 - l1, c2p - c1p
if c1p * c2p == 0.0:
dhp = 0.0
else:
dhp = h2p - h1p
if dhp > 180.0:
dhp -= 360.0
elif dhp < -180.0:
dhp += 360.0
dh = 2.0 * math.sqrt(c1p * c2p) * math.sin(math.radians(dhp / 2.0))
lm, cmp_ = (l1 + l2) / 2.0, (c1p + c2p) / 2.0
if c1p * c2p == 0.0:
hm = h1p + h2p
elif abs(h1p - h2p) <= 180.0:
hm = (h1p + h2p) / 2.0
elif h1p + h2p < 360.0:
hm = (h1p + h2p + 360.0) / 2.0
else:
hm = (h1p + h2p - 360.0) / 2.0
r = math.radians
t = math.fsum((1.0, -0.17 * math.cos(r(hm - 30.0)),
0.24 * math.cos(r(2.0 * hm)),
0.32 * math.cos(r(3.0 * hm + 6.0)),
-0.20 * math.cos(r(4.0 * hm - 63.0))))
dtheta = 30.0 * math.exp(-((hm - 275.0) / 25.0) ** 2)
rc = 2.0 * math.sqrt(cmp_ ** 7 / (cmp_ ** 7 + 25.0 ** 7))
sl = 1.0 + 0.015 * (lm - 50.0) ** 2 / math.sqrt(20.0 + (lm - 50.0) ** 2)
sc = 1.0 + 0.045 * cmp_
sh = 1.0 + 0.015 * cmp_ * t
rt = -math.sin(2.0 * r(dtheta)) * rc
x, y, z = dl / sl, dc / sc, dh / sh
return math.sqrt(math.fsum((x * x, y * y, z * z, rt * y * z)))
def de76(p, q):
return math.sqrt(math.fsum((u - v) ** 2 for u, v in zip(p, q)))
def hsv_code(h, s, v):
# HSV (degrees, 0-1, 0-1) to 8-bit sRGB codes
c = v * s
hp = (h % 360.0) / 60.0
x = c * (1.0 - abs(hp % 2.0 - 1.0))
r, g, b = ((c, x, 0.0), (x, c, 0.0), (0.0, c, x),
(0.0, x, c), (x, 0.0, c), (c, 0.0, x))[int(hp) % 6]
m = v - c
return tuple(int(round((u + m) * 255.0)) for u in (r, g, b))
def hexs(codes):
return "#{:02X}{:02X}{:02X}".format(*codes)
def hue(c):
r, g, b = (u / 255.0 for u in c)
mx, mn = max(r, g, b), min(r, g, b)
if mx == mn:
return -1.0
d = mx - mn
if mx == r:
h = ((g - b) / d) % 6.0
elif mx == g:
h = (b - r) / d + 2.0
else:
h = (r - g) / d + 4.0
return 60.0 * h
LEVELS = (0, 51, 102, 153, 204, 255)
CODES = [(r, g, b) for r in LEVELS for g in LEVELS for b in LEVELS]
LIN = [tuple(lin(u) for u in c) for c in CODES]
if __name__ == "__main__":
views = ("normal", "protan", "deutan", "tritan")
labs = {k: [lab(sim(c, k)) for c in LIN] for k in views}
n = len(CODES)
print("216 colours, {} pairs".format(n * (n - 1) // 2))
print("view confusions share worst pair normal sim")
for k in views[1:]:
hits = []
for i in range(n):
for j in range(i + 1, n):
d0 = de00(labs["normal"][i], labs["normal"][j])
if d0 < 20.0:
continue
d1 = de00(labs[k][i], labs[k][j])
if d1 < 3.0:
hits.append((d1 - d0, i, j, d0, d1))
hits.sort()
if not hits:
print("{:<7s} {:10d} {:.4f} none".format(k, 0, 0.0))
continue
_, i, j, d0, d1 = hits[0]
print("{:<7s} {:10d} {:.4f} {} {} {:6.2f} {:4.2f}".format(
k, len(hits), len(hits) / (n * (n - 1) / 2),
hexs(CODES[i]), hexs(CODES[j]), d0, d1))Single source and citation
Fan, Y. (2026). Simulating Colour-Vision Deficiency and Colour Discriminability: Buttons and Charts as Seen by Red-Green Colour-Deficient Users (Version 1.0.0), Chapter 3: The Machado Matrices: Simulating Three Kinds of Dichromacy in Linear sRGB. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-324 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026324,
author = {Fan, Yafu},
title = {Simulating Colour-Vision Deficiency and Colour Discriminability: Buttons and Charts as Seen by Red-Green Colour-Deficient Users},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Eight Per Cent and Four and a Half to One: Why Red and Green Buttons That Pass Contrast Still Collide
- Chapter 2 · Linear Light and Relative Luminance: What WCAG Contrast Computes and What It Leaves Out
- Chapter 4 · CIELAB and CIEDE2000: Turning "a Visible Difference" into a Number
- Chapter 5 · Safe Colours for Right and Wrong Buttons: a Hue Search and a Luminance-Only Scheme
- Chapter 6 · Chart Palettes: Discriminability Matrices and How Many Series Colour Can Carry
- Chapter 7 · Classical Sources East and West: the Paired Colours of the Kaogong ji and Dalton's 1798 Account
- Chapter 8 · Closing the Loop: a Colour-Vision Check in the Front-End Style Library, the Colour-Vision-Safe Palette Checker and a Pre-Registered Test