Abstract
We investigate the problem to round a given [0]
Of a broader interest might be our rounding scheme, which is a modification of randomized rounding. Instead of independently rounding the variables (expected error 0.82944 per box in the worst case), we impose a number of suitable dependencies.
Experimental results show that roundings obtained by our approach look much less grainy than by independent randomized rounding, and only slightly more grainy than by error diffusion. On the other hand, the latter algorithm (like all known deterministic algorithms) tends to produce unwanted structures, a problem that randomized algorithms like ours are unlikely to encounter.
Chapter PDF
Similar content being viewed by others
References
N. Alon, B. Doerr, T. ELuczak, and T. Schoen. On the discrepancy of combinatorial rectangles. Tentatively accepted for publication in Random Structures & Algorithms, 2001.
T. Asano, N. Katoh, K. Obokata, and T. Tokuyama. Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002.
B.E. Bayer. An optimum method for two-level rendition of continous-tone pictures. In Conference Record, IEEE International Conference on Communications, volume 1, pages (26–11)–(26–15). IEEE, 1973.
D. Bertsimas, C. Teo, and R. Vohra. On dependent randomized rounding algorithms. Oper. Res. Lett., 24:105–114, 1999.
B. Doerr. Lattice approximation and linear discrepancy of totally unimodular matrices. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 119–125, 2001.
B. Doerr. Structured randomized rounding and coloring. In R. Freivalds, editor, Fundamentals of Computation Theory, volume 2138 of Lecture Notes in Computer Science, pages 461–471, Berlin-Heidelberg, 2001. Springer Verlag.
R.W. Floyd and L. Steinberg. An adaptive algorithm for spatial grey scale. In SID 75 Digest, pages 36–37. Society for Information Display, 1975.
D.E. Knuth. Digital halftones by dot diffusion. ACM Trans. Graphics, 6:245–273, 1987.
D.E. Knuth. Two-way rounding. SIAM J. Discrete Math., 8:281–290, 1995.
B. Lippel and M. Kurland. The effect of dither on luminance quantization of pictures. In IEEE Trans. Commun. Tech. COM-19, pages 879–888, 1971.
P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J. Comput. Syst. Sci., 37:130–143, 1988.
P. Raghavan and C.D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4):365–374, 1987.
A. Srinivasan. Improved approximation guarantees for packing and covering integer programs. SIAM J. Comput., 29:648–670, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doerr, B., Schnieder, H. (2002). Non-independent Randomized Rounding and an Application to Digital Halftoning. In: Möhring, R., Raman, R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45749-6_37
Download citation
DOI: https://doi.org/10.1007/3-540-45749-6_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44180-9
Online ISBN: 978-3-540-45749-7
eBook Packages: Springer Book Archive