关于「能否度量「好看」:字号阶梯、审美度量与复杂度」,《计算美学与界面认知工程》给出的定量结论是什么?

结论:模块化字号比例是设计惯例:韦伯定律只要求比例超过一个阈值,不能选出最优比例;比例的选择是层级清晰度与级数之间的取舍,整数取整还会让小比例的步长不均匀。伯克霍夫的 \(M = O/C\) 对一般比例(不过分细长)的长方形给出同一分数 1.25,正方形更高(1.50),所以推不出黄金比的特殊地位。柯尔莫哥洛夫复杂度不可计算,压缩长度只是上界代理。视觉复杂度与原型性在几十毫秒内影响审美评分(林德高等 2006、图赫等 2012、赖内克等 2013),但这些研究测量的是短时评分,不是行为结局。

数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的模型和假说;书中所有页面、品牌与数据都是虚构或模拟的。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 1.25, 1.50

A. Birkhoff polygons V E R HV F C M=O/C
square1 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 down1 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
blank768 15 0.02
strict grid768 35 0.05
grid + text768 51 0.07
jittered grid + text768 125 0.16
noise768 749 0.98
(raw96 x 64 / 8 bytes; the zlib wrapper is 6 bytes, and empty input -> 8 bytes)
查看完整验算程序
# 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)")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《计算美学、视觉显著性图谱与人机界面认知工程》第 6 章「能否度量「好看」:字号阶梯、审美度量与复杂度」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23836258

DOI: 10.5281/zenodo.23836258 · 阅读本章所在专著 · 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}
}

本书其他章节结论