Non-independent Randomized Rounding and an Application to Digital Halftoning [chapter]

Benjamin Doerr, Henning Schnieder
2002 Lecture Notes in Computer Science  
We investigate the problem to round a given [0, 1]-valued matrix to a 0, 1 matrix such that the rounding error with respect to 2 × 2 boxes is small. Such roundings yield good solutions for the digital halftoning problem as shown by Asano et al. (SODA 2002). We present a randomized algorithm computing roundings with expected error at most 0.6287 per box, improving the 0.75 non-constructive bound of Asano et al. Our algorithm is the first one solving this problem fast enough for practical
more » ... ion, namely in linear time. 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.
doi:10.1007/3-540-45749-6_37 fatcat:ffhfd6r5tvdnbdvxq6nyhw76ey