Digital halftoning
Digital halftoning with space filling curves
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
A simple and efficient error-diffusion algorithm
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Design and quality assessment of forward and inverse error diffusion halftoning algorithms
Design and quality assessment of forward and inverse error diffusion halftoning algorithms
| Hi-index | 0.00 |
In this contribution we introduce a little-known property of error diffusion halftoning algorithms which we call error diffusion displacement. By accounting for the inherent sub-pixel displacement caused by the error propagation, we correct an important flaw in most metrics used to assess the quality of resulting halftones. We find these metrics to usually highly underestimate the quality of error diffusion in comparison to more modern algorithms such as direct binary search. Using empirical observation, we give a method for creating computationally efficient, image-independent, model-based metrics for this quality assessment. Finally, we use the properties of error diffusion displacement to justify Floyd and Steinberg's well-known choice of algorithm coefficients.