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:
Цены на нефть взлетели до максимума за полгода17:55
。业内人士推荐heLLoword翻译官方下载作为进阶阅读
Последние новости
第十七条 仲裁机构终止的，依法办理注销登记。