How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy

Authors:
Tetsuo Asano;Takeshi Tokuyama
Affiliations:
-;-
Venue:
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Year:
2001

Citing 6
Cited 0

Digital halftoning

Digital halftoning
Digital halftones by dot diffusion

ACM Transactions on Graphics (TOG)
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Discrepancy theory

Handbook of combinatorics (vol. 2)
Optimal roundings of sequences and matrices

Nordic Journal of Computing
On the Complexities of the Optimal Rounding Problems of Sequences and Matrices

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by a digital halftoning application to convert a continuous-tone image into a binary image, we discusses how to round a [0, 1]-valued matrix into a {0, 1} binary matrix achieving low discrepancy with respect to the family of all 2×2 square submatrices (or regions). A trivial upper bound of the discrepancy is 2 and the known lower bound is 1. In this paper we shall show howto achieve a newupp er bound 5/3 using a newpro of technique based on modified graph matching.