# Floyd–Steinberg dithering

(Redirected from Floyd-Steinberg dithering)
 Example of a 24-bit RGB image dithered to 3-bit RGB using Floyd–Steinberg dithering
An image of the Statue of David, dithered with Floyd–Steinberg algorithm

Floyd–Steinberg dithering is an image dithering algorithm first published in 1976 by Robert W. Floyd and Louis Steinberg. It is commonly used by image manipulation software, for example when an image is converted into GIF format that is restricted to a maximum of 256 colors.

The algorithm achieves dithering by pushing (adding) the residual quantization error of a pixel onto its neighboring pixels, to be dealt with later. It spreads the debt out according to the distribution (shown as a map of the neighboring pixels):

$\begin{bmatrix} & & & & \\ & & * & \frac{\displaystyle 7}{\displaystyle 16} & ... \\ ... & \frac{\displaystyle 3}{\displaystyle 16} & \frac{\displaystyle 5}{\displaystyle 16} & \frac{\displaystyle 1}{\displaystyle 16} & ... \\ \end{bmatrix}$

The pixel indicated with a star (*) indicates the pixel currently being scanned, and the blank pixels are the previously-scanned pixels. The algorithm scans the image from left to right, top to bottom, quantizing pixel values one by one. Each time the quantization error is transferred to the neighboring pixels, while not affecting the pixels that already have been quantized. Hence, if a number of pixels have been rounded downwards, it becomes more likely that the next pixel is rounded upwards, such that on average, the quantization error is close to zero.

The diffusion coefficients have the property that if the original pixel values are exactly halfway in between the nearest available colors, the dithered result is a checkerboard pattern. For example 50% grey data could be dithered as a black-and-white checkerboard pattern. For optimal dithering, the counting of quantization errors should be in sufficient accuracy to prevent rounding errors from affecting the result.

In some implementations, the horizontal direction of scan alternates between lines; this is called "serpentine scanning" or boustrophedon transform dithering.

In pseudocode:

for each y from top to bottom
for each x from left to right
oldpixel  := pixel[x][y]
newpixel  := find_closest_palette_color(oldpixel)
pixel[x][y]  := newpixel
quant_error  := oldpixel - newpixel
pixel[x+1][y  ] := pixel[x+1][y  ] + 7/16 * quant_error
pixel[x-1][y+1] := pixel[x-1][y+1] + 3/16 * quant_error
pixel[x  ][y+1] := pixel[x  ][y+1] + 5/16 * quant_error
pixel[x+1][y+1] := pixel[x+1][y+1] + 1/16 * quant_error


For example, to convert 16 bit to 8 bit find_closest_palette_color() may perform just a simple rounding

find_closest_palette_color(oldpixel) = oldpixel / 256 * 256