Digital Color Halftoning
The farthest point strategy for progressive image sampling
IEEE Transactions on Image Processing
Entropy-constrained halftoning using multipath tree coding
IEEE Transactions on Image Processing
Look-up-table based halftoning algorithm
IEEE Transactions on Image Processing
Impact of HVS models on model-based halftoning
IEEE Transactions on Image Processing
New spatial measure for dispersed-dot halftoning assuring good point distribution in any density
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
In an earlier paper, we briefly presented a new halftoning algorithm called farthest-point halftoning. In the present paper, this method is analyzed in detail, and a novel dispersion measure is defined to improve the simplicity and flexibility of the result. This new stochastic screen algorithm is loosely based on Kang's dispersed-dot ordered dither halftone array construction technique used as part of his microcluster halftoning method. Our new halftoning algorithm uses pixelwise measures of dispersion based on one proposed by Kang which is here modified to be more effective. In addition, our method exploits the concept of farthest-point sampling (FPS), introduced as a progressive irregular sampling method by Eldar et al. but uses a more efficient implementation of FPS in the construction of the dot profiles. The technique we propose is compared to other state-of-the-art dither-based halftoning methods in both qualitative and quantitative manners.