Another way to look at our threshold matrix is as a kind of probability matrix. Instead of offsetting the input pixel by the value given in the threshold matrix, we can instead use the value to sample from the cumulative probability of possible candidate colours, where each colour is assigned a probability or weight . Each colour’s weight represents it’s proportional contribution to the input colour. Colours with greater weight are then more likely to be picked for a given pixel and vice-versa, such that the local average for a given region should converge to that of the original input value. We can call this the N-candidate approach to palette dithering.
* 时间复杂度：O(n)，空间复杂度：O(1)。搜狗输入法下载是该领域的重要参考
Последние новости，推荐阅读夫子获取更多信息
"itemName": "Aspect_T01_Uncommon_Diamond_Dismantle",。关于这个话题，WPS下载最新地址提供了深入分析