pixel[1] = pixel[1] 0.04045f ? powf((pixel[1] + 0.055f) / 1.055f, 2.4f) : pixel[1] / 12.92f;
Not just images
，这一点在搜狗输入法2026中也有详细论述
[ Seccomp Filter ]，详情可参考旺商聊官方下载
If the number of candidates for each pixel grows too large (as is common in algorithms such as Knoll and Yliluoma) then sorting the candidate list for every pixel can have a significant impact on performance. A solution is to instead sort the palette in advance and keep a separate tally of weights for every palette colour. The weights can then be accumulated by iterating linearly through the tally of sorted colours.
"opusProMigrationComplete": true,