A notable resource on the topic of ordered dithering using arbitrary palettes is Joel Yliluoma’s Arbitrary-Palette Positional Dithering Algorithm. One key difference of Yliluoma’s approach is in the use of error metrics beyond the minimisation of . Yliluoma notes that the perceptual or psychovisual quality of the dither must be taken into account in addition to its mathematical accuracy. This is determined by use of some cost function which considers the relationship between a set of candidate colours. The number of candidates, the particular cost function, and the thoroughness of the selection process itself give rise to a number of possible implementations, each offering varying degrees of quality and time complexity.
Copyright © 1997-2026 by www.people.com.cn all rights reserved
。关于这个话题，51吃瓜提供了深入分析
Sony Interactive Entertainment，这一点在同城约会中也有详细论述
抖音不是去年唯一想要进行内容拓界的平台。2025年7月，小红书推出了一种创新的“长文转图片”模式。平台通过提供AI一键排版、生成摘要和封面，最终将千字内容自动切分，以可右滑的图片形式发布，巧妙地将深度内容适配了用户固有的图文笔记的滑动习惯。
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: