抖动算法分为随机抖动算法和有序抖动算法。随机抖动算法随机产生一组模板方阵数列，随机数的产生期间在图像的最小灰度和最大灰度之间。有序抖动算法是人为地设置一些模板值进行匹配操作，主要有分散性抖动算法(Disperse Dither)和聚集型离散算法(cluster Dith神两种。分散型以Bayer有序抖动算法为代表。后来Ulichenay在以上两种算法的基础上，提出了局部聚集整体分散的抖动算法。(Dithering algorithm is divided into random dithering algorithm and ordered dithering algorithm. The random dithering algorithm randomly generates a set of template square matrix sequences, where the generation of random numbers is between the minimum gray level and the maximum gray level of the image. The ordered dithering algorithm is to manually set up some template values for matching operations. The main algorithms are decentralized dithering algorithm (Disperse Dither) and clustered discrete algorithm (cluster, Dith, and two). The decentralized algorithm is represented by the Bayer ordered dither algorithm. Later, Ulichenay proposed a local aggregation and scatter jitter algorithm based on the above two algorithms.)