The N-closest or N-best dithering algorithm is a straightforward solution to the N-candidate problem. As the name suggests, the set of candidates is given by the closest palette colours to the input pixel. To determine their weights, we simply take the inverse of the distance to the input pixel. This is essentially the inverse distance weighting (IDW) method for multivariate interpolation, also known as Shepard’s method. The following pseudocode sketches out a possible implementation:
Что думаешь? Оцени!
，推荐阅读safew官方下载获取更多信息
2月27日，阿里旗下通义千问高调宣布进军AI硬件，首款AI眼镜将在MWC亮相，还表示年内将推出AI指环与AI耳机。
FT Videos & Podcasts