What does Visual Saliency and Interface Cognition conclude, in numbers, about “Can "Looking Good" Be Measured? Type Scales, Aesthetic Measure and Complexity”?
Answer: Modular type scales are design conventions: Weber's law requires only that the ratio exceed a threshold and cannot choose the best ratio; the choice is a trade-off between clarity of hierarchy and number of levels, and rounding to whole pixels makes small ratios uneven. Birkhoff's \(M = O/C\) gives every rectangle of ordinary (not too elongated) proportions the same score of 1.25 and the square more (1.50), so no special status for the golden ratio follows. Kolmogorov complexity is uncomputable, and compressed length is only an upper-bound proxy. Visual complexity and prototypicality affect aesthetic ratings within tens of milliseconds (Lindgaard and colleagues 2006, Tuch and colleagues 2012, Reinecke and colleagues 2013), but these studies measure brief ratings, not behavioural outcomes.
Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's models and hypotheses; all pages, brands and data in the book are fictional or simulated.
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: 1.25, 1.50
| A. Birkhoff polygons V E R HV F C M=O/C | |
| square | 1 1 2.0 2 0 4 1.50 |
| rectangle, ordinary ratio (incl. 1.618) | 1 1 1.0 2 0 4 1.25 |
| equilateral triangle, base down | 1 1 1.5 0 0 3 1.17 |
| (every rectangle that is not too elongated scores 1.25: no special 1.618) | |
| B. zlib upper bound on description length, 96 x 64 binary layouts | |
| layout raw bytes zlib bytes ratio | |
| blank | 768 15 0.02 |
| strict grid | 768 35 0.05 |
| grid + text | 768 51 0.07 |
| jittered grid + text | 768 125 0.16 |
| noise | 768 749 0.98 |
| (raw | 96 x 64 / 8 bytes; the zlib wrapper is 6 bytes, and empty input -> 8 bytes) |
Show the full program
# Birkhoff (1933) M = O/C for polygons, O = V + E + R + HV - F, C = number of distinct
# lines carrying the edges (V vertical symmetry, E equilibrium, R rotational symmetry,
# HV relation to a horizontal-vertical network, F unsatisfactory form). Then a
# computable stand-in for "complexity": Kolmogorov complexity K(x) is uncomputable, but
# any lossless compressor gives an upper bound K(x) <= |zlib(x)| + O(1). Applied to
# 96 x 64 binary layouts: blank, a strict grid, grid + text lines, the same with random
# jitter, and noise (30 % ink; Shannon bound H(0.3) = 0.881 bit per pixel).
import random, zlib
POLY = [("square", 1, 1, 2, 2, 0, 4),
("rectangle, ordinary ratio (incl. 1.618)", 1, 1, 1, 2, 0, 4),
("equilateral triangle, base down", 1, 1, 1.5, 0, 0, 3)] # R = q/2, q = 3
def bits(img):
flat = [v for r in img for v in r]
return bytes(sum(flat[i + j] << j for j in range(8)) for i in range(0, len(flat), 8))
def layout(kind, rng, w=96, h=64):
img = [[0] * w for _ in range(h)]
if kind == "blank":
return img
if kind == "noise":
return [[rng.random() < 0.3 for _ in range(w)] for _ in range(h)]
for row in range(2):
for col in range(3):
x0, y0 = 4 + 31 * col, 4 + 30 * row
dx = rng.randint(-3, 3) if kind == "jittered grid + text" else 0
dy = rng.randint(-3, 3) if kind == "jittered grid + text" else 0
for y in range(y0 + dy, y0 + dy + 14):
for x in range(x0 + dx, x0 + dx + 26):
img[y][x] = 1
if kind != "strict grid":
for k in range(3):
n = rng.randint(14, 26) if kind == "jittered grid + text" else 22
for x in range(x0 + dx, x0 + dx + n):
img[y0 + dy + 17 + 3 * k][x] = x % 3 != 2
return img
if __name__ == "__main__":
print("A. Birkhoff polygons V E R HV F C M=O/C")
for name, V, E, R, HV, F, C in POLY:
m = (V + E + R + HV - F) / C
print(f" {name:40s} {V} {E:2d} {R:4.1f} {HV} {F:2d} {C:2d} {m:5.2f}")
print(" (every rectangle that is not too elongated scores 1.25: no special 1.618)")
rng = random.Random(1933)
print("B. zlib upper bound on description length, 96 x 64 binary layouts")
print(" layout raw bytes zlib bytes ratio")
for kind in ("blank", "strict grid", "grid + text", "jittered grid + text", "noise"):
z = len(zlib.compress(bits(layout(kind, rng)), 9))
print(f" {kind:26s} {768:9d} {z:11d} {z / 768:6.2f}")
print(f" (raw = 96 x 64 / 8 bytes; the zlib wrapper is 6 bytes, and empty input"
f" -> {len(zlib.compress(b'', 9))} bytes)")Single source and citation
Fan, Y. (2026). Computational Aesthetics, Visual Saliency Maps and Cognitive Ergonomics in User Interface Design (Version 1.0.0), Chapter 6: Can "Looking Good" Be Measured? Type Scales, Aesthetic Measure and Complexity. 5D Library. https://doi.org/10.5281/zenodo.23836258
DOI: 10.5281/zenodo.23836258 · Read the monograph · 5DL-B-046 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026046,
author = {Fan, Yafu},
title = {Computational Aesthetics, Visual Saliency Maps and Cognitive Ergonomics in User Interface Design},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23836258},
url = {https://doi.org/10.5281/zenodo.23836258}
}Other chapter answers in this book
- Chapter 1 · Two Popular Rules: the Golden Ratio and Three Clicks
- Chapter 2 · Deciding and Pointing: the Hick–Hyman Law and Fitts's Law
- Chapter 3 · What Pops Out First: Visual Search and Saliency Maps
- Chapter 4 · How Gaze Moves: Centre Bias, Saccades and Inhibition of Return
- Chapter 5 · Seeing Clearly: Spatial-Frequency Channels, Contrast Sensitivity and WCAG
- Chapter 7 · Reading the Classics: Examining Curves and Aspects, and Timber as the Root
- Chapter 8 · Practice and a Pre-Registered Test