TY - GEN

T1 - How to color a checkerboard with a given distribution - Matrix rounding achieving low 2 × 2-discrepancy

AU - Asano, Tetsuo

AU - Tokuyama, Takeshi

PY - 2001/12/1

Y1 - 2001/12/1

N2 - 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 lowdi screpancy 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 new upper bound 5/3 using a newpro of technique based on modified graph matching.

AB - 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 lowdi screpancy 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 new upper bound 5/3 using a newpro of technique based on modified graph matching.

UR - http://www.scopus.com/inward/record.url?scp=70350648025&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350648025&partnerID=8YFLogxK

U2 - 10.1007/3-540-45678-3_54

DO - 10.1007/3-540-45678-3_54

M3 - Conference contribution

AN - SCOPUS:70350648025

SN - 3540429859

SN - 9783540429852

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 636

EP - 648

BT - Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings

T2 - 12th International Symposium on Algorithms and Computation, ISAAC 2001

Y2 - 19 December 2001 through 21 December 2001

ER -