

13Ordered
Blue Noise Dithering
Blue noise dithering compares each pixel with a threshold mask whose values are spread as evenly as possible, with no repeating structure for the eye to pick out. The idea comes from Robert Ulichney’s work on digital halftoning, and the mask is built with his void-and-cluster method from 1993. It gives a fine, natural grain, with the speed and frame-to-frame stability of ordered dithering.
- Author
- Robert Ulichney
- Year
- 1993
- Complexity
- high
How Blue Noise dithering works
PixelSynth tiles a 64×64 threshold mask, 4,096 ranks, across the image. Each pixel turns white when its brightness exceeds the threshold at its position, exactly as with Bayer, and nothing is carried between pixels. What differs is the mask: its ranks are arranged so that at every gray level the lit pixels are spread evenly, with no clumps and no lattice.
“Blue” describes the noise spectrum: its energy sits at high frequencies, the fine detail the eye blends most easily, with almost none at the low frequencies where noise reads as blotches. At 64 pixels, the tile is large enough that its repetition is practically invisible.
| 2391 | 363 | 2166 | 263 | 1291 | 2327 | 2665 | 2138 |
| 2676 | 1398 | 4021 | 2954 | 1883 | 3846 | 3477 | 831 |
| 3161 | 2019 | 3442 | 1095 | 699 | 68 | 1657 | 2919 |
| 949 | 558 | 1692 | 2755 | 2517 | 3298 | 2049 | 1037 |
| 2355 | 3837 | 147 | 1478 | 3652 | 508 | 3081 | 4058 |
| 1894 | 3313 | 2898 | 2196 | 901 | 2401 | 1268 | 234 |
| 446 | 746 | 1145 | 3972 | 324 | 1853 | 3739 | 767 |
| 1453 | 2506 | 2008 | 3453 | 1619 | 3180 | 2584 | 3508 |
- A 64×64 matrix of 4096 ranks is tiled across the image; a pixel turns white when its brightness exceeds the threshold at its position.
- That gives 4097 distinct gray levels, each reproduced by a fixed dot pattern.
- Showing the top-left 8×8 corner of the full 64×64 matrix.
M = 64×64 matrix of ranks 0…4095
for each pixel (x, y):
t = (M[y mod 64][x mod 64] + 0.5) / 4096 * 255
pixel = gray < t ? black : white
# with a palette, t shifts the color before nearest_colorWhen to use it (and when not to)
- Best for: photos and gradients that should look natural, and animation.
- Works well with: every palette, from 1-bit to Game Boy, PICO-8 or NES.
- Watch out for: slightly less edge detail than error diffusion, since the mask doesn’t adapt to the image.
- In animation: Very stable. Each pixel’s threshold depends only on its position, so areas that don’t move stay identical from frame to frame, with no shimmer. The grain stays put, like a film grain.
Blue Noise vs other algorithms
The same terminal in 1-bit, center crop at actual size.

Blue Noise 
Bayer 8×8 
Floyd–Steinberg 
Random
| Algorithm | Method | Animation | Look |
|---|---|---|---|
| Blue Noise | 64×64 threshold matrix | Stable | Fine even grain, no grid |
| Bayer 8×8 | 8×8 threshold matrix | Stable | Visible cross-hatch |
| Floyd–Steinberg | Error to 4 neighbors (100% carried) | Flickers | Sharper, flickers in animation |
| Random | Random threshold | Stable | Clumpy white noise |
Try Blue Noise on your image
Open the editor with Blue Noise already selected, drop in a photo or an animated GIF, choose the processing scale for the dot size, pick a palette and export the result. Free, no account, no watermark, and your image never leaves your device.
Open Blue Noise in the editorBlue Noise FAQ
Blue Noise or Floyd–Steinberg?
Floyd–Steinberg keeps a little more detail in stills. Blue Noise is steadier: its dots don’t shimmer in animations, and it has no worm patterns.
What’s the difference between Blue Noise and Void-and-Cluster?
Both masks are built with the void-and-cluster method. Blue Noise uses a large 64×64 mask, so no repetition shows; Void-and-Cluster uses the classic 16×16 array, whose faint period gives a more organic, slightly structured texture.