Abstract
Digital halftoning is a problem of computing a binary image approximating an input gray (or color) image. We consider two problems on digital halftoning: mathematical evaluation of a halftoning image and design of optimization-based halftoning algorithms. We propose an efficient automatic evaluation system of halftoning images by using quality evaluation functions based on discrepancy measures. Our experimental results on the evaluation system infer that the discrepancy corresponding to a regional error is a good evaluation measurement, and thus we design algorithms to reduce this discrepancy measure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Asano, “Digital Halftoning: Challenges of Algorithm Engineers”, IEICE TRANS. Fundamentals, vol. E02-D, NO. 5 May 2002.
T. Asano, N. Katoh, K. Obokata, T. Tokuyama, “Matrix Rounding under the L p-DiscrepancyMeasure and Its Application to Digital Halftoning,” Proc. 13th ACMSIAM Symp. on Discrete Algorithms, 2002, pp.896–904.
T. Asano, T. Matsui, and T. Tokuyama: “Optimal Roundings of Sequences and Matrices,” Nordic Journal of Computing, 7–3 (2000), pp. 241–256.
J. Beck and V.T. Sös, Discrepancy Theory, in Handbook of Combinatorics Volume II, (ed. R. Graham, M. Grötschel, and L Lovász 1995, Elsevier.
J. Bentley, “Programming Pearls,” CACM 27 (1984), 865–871. 303
Donald E. Knuth, “Digital Halftones by Dot Diffusion”, ACM Transactions on Graphics 6 (1987) pp. 245–273.
R.W. Floyd and L. Steinberg: “An adaptive algorithm for spatial gray scale,” SID 75 Digest, Society for Information Display (1975), pp. 36–37.
N. Takki-Chebihi, “Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization,” Master thesis, GSIS Tohoku University. In preparation for a journal pubilication.
P. Raghavan and C. Thompson, “Randomized Rounding,” Combinatorica 7 (1987), pp. 365–374.
K. Sadakane, N. Takki-Chebihi, T. Tokuyama, “Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequences”, Proc. 28th ICALP, LNCS 2076 (2001), pp. 166–177.
V. Rödl and P. Winkler: “Concerning a Matrix Approximation Problem”, Crux Mathmaticorum (1990), pp. 76–79.
L. Velho and J. Gomes: “Digital Halftoning with Space Filling Curves”, Proc. SIGGRAPH’91 (1991), pp. 81–90.
I. Witten and N. Neal, “Using Peano Curves for Bilevel Display of Continuous-Tone Images”, IEEE Computer Graphics and Applications (1982), pp. 47–52.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sadakane, K., Chebihi, N.T., Tokuyama, T. (2003). Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization. In: Asano, T., Klette, R., Ronse, C. (eds) Geometry, Morphology, and Computational Imaging. Lecture Notes in Computer Science, vol 2616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36586-9_19
Download citation
DOI: https://doi.org/10.1007/3-540-36586-9_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00916-0
Online ISBN: 978-3-540-36586-0
eBook Packages: Springer Book Archive