Enhanced Digital Halftoning via Weighted Sigma-Delta Modulation

TL;DR

This work links digital halftoning with 1-bit Sigma–Delta quantization in two dimensions by introducing weighted, directionally combined Sigma–Delta schemes. It establishes stability and error bounds for both first- and second-order schemes under a bandlimited image model, and shows that appropriately chosen weights can substantially reduce supremum-norm quantization error while preserving stability. Extensive numerical experiments on bandlimited signals and real-world images demonstrate that second-order weighted schemes achieve competitive FSIM scores, with stability often achieved via minimal rescaling. Overall, the paper provides a rigorous framework and practical algorithms that improve error diffusion-based halftoning, while clarifying the trade-offs between supremum-norm guarantees and perceptual image quality.

Abstract

In this paper, we study error diffusion techniques for digital halftoning from the perspective of 1-bit Sigma-Delta quantization. We introduce a method to generate Sigma-Delta schemes for two-dimensional signals as a weighted combination of its one-dimensional counterparts and show that various error diffusion schemes proposed in the literature can be represented in this framework via Sigma-Delta schemes of first order. Under the model of two-dimensional bandlimited signals, which is motivated by a mathematical model of human visual perception, we derive quantitative error bounds for such weighted Sigma-Delta schemes. We see these bounds as a step towards a mathematical understanding of the good empirical performance of error diffusion, even though they are formulated in the supremum norm, which is known to not fully capture the visual similarity of images. Motivated by the correspondence between existing error diffusion algorithms and first-order Sigma-Delta schemes, we study the performance of the analogous weighted combinations of second-order Sigma-Delta schemes and show that they exhibit a superior performance in terms of guaranteed error decay for two-dimensional bandlimited signals. In extensive numerical simulations for real world images, we demonstrate that with some modifications to enhance stability this superior performance also translates to the problem of digital halftoning. More concretely, we find that certain second-order weighted Sigma-Delta schemes exhibit competitive performance for digital halftoning of real world images in terms of the Feature Similarity Index (FSIM), a state-of-the-art measure for image quality assessment.

Figures (11)

• Figure 1: Illustration of digital halftoning: (a) the original gray-scale image, (b) the same image represented by black and white pixels using the Floyd–Steinberg algorithm.
• Figure 2: The elements of $v$ used (in red) at current quantization step $(m,n)$ (in blue) to define $v_{m,n}$ for Floyd–Steinberg $\Sigma \Delta$ halftoning scheme. Dark green points denote already half-toned elements and the next step is marked by the green disk with blue bounds.
• Figure 3: Weighted elements of $v$ (in red) used at current quantization step $\bm n$ to define $v_{\bm n}$ (in blue) for the weighted $\Sigma \Delta$ quantization scheme with $\mathbf{W}\in \mathbb{R}^{4\times 2}$. Dark green points denote already quantized elements and the next step is marked by the green disk with blue bounds.
• Figure 4: Choice of optimal weights for $\mathbf{W} \in \mathbb{R}^{4 \times 2}$.
• Figure 5: Visualization of a weighted $\Sigma \Delta$ scheme of second order with weight matrix $\mathbf{W}\in \mathbb{R}^{3\times 2}$ and a ($2$-sparse) filter $h\in \mathbb{R}^4$. The red dots indicate elements of $v$ used in the current quantization step to define the $v_{\bm n}$ indicated by a blue dot. Dark green dots denote already quantized elements, light green dots those not yet quantized. The subsequent element to be quantized is indicated by a blue circle.

Theorems & Definitions (19)

• Definition 2.1
• Definition 2.2
• Definition 3.1
• Proposition 3.1
• Proposition 3.2
• Definition 4.1
• Example 4.1
• Theorem 4.1
• Definition 4.2
• Example 4.2