Matrix rounding under the Lp-Discrepancy measure and its application to digital halftoning

SIAM Journal on Computing

Volumn 32, Issue 6, 2003, Pages 1423-1435

  Asano, Tetsuo ^a   Katoh, Naoki ^b   Obokata, Koji ^a   Tokuyama, Takeshi ^c  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b KYOTO UNIVERSITY   (Japan)

^c TOHOKU UNIVERSITY   (Japan)

Author keywords

Approximation algorithm; Digital halftoning; Discrepancy; Linear programming; Matrix rounding; Network flow; Totally unimodular

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; COMPUTER SIMULATION; DIGITAL TO ANALOG CONVERSION; GRAPH THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MONTE CARLO METHODS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

APPROXIMATION ALGORITHMS; DIGITAL HALFTONING; DISCREPANCY MEASURES; MATRIX ROUNDING; NETWORK FLOWS; TOTALLY UNIMODULAR;

MATRIX ALGEBRA;

EID: 0942288259     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702417511     Document Type: Article

References (19)

1. R. AHUJA, T. MAGNANTI, AND J. ORLIN, Network Flows, Theory Algorithms and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. T. ASANO, T. MATSUI, AND T. TOKUYAMA, Optimal roundings of sequences and matrices, Nordic J. Comput., 7 (2000), pp. 241-256.
3. T. ASANO AND T. TOKUYAMA, How to color a checkerboard with a given distribution - Matrix rounding achieving low 2 × 2-discrepancy, in Algorithms and Computation, Lecture Notes in Comput. Sci. 2223, Springer, Berlin, 2001, pp. 636-648.
4. B. E. BAYER, An optimum method for two-level rendition of continuous-tone pictures, IEEE Int. Conf. Commun., 1 (1973), pp. 11-15.
5. Z. BARANYAI, On the factorization of the complete uniform hypergraphs, in Infinite and Finite Sets, Colloq. Math. Soc. J'anos Bolyai 10, A. Hanaj, R. Rado, and V. T. Sós, eds., North-Holland, Amsterdam, 1975, pp. 91-108.
6. J. BECK AND V. T. SÓS, Discrepancy theory, in Handbook of Combinatorics, Vol. II, R. Graham, M. Grötschel, and L. Lovász, eds., Elsevier, Amsterdam, 1995.
7. B. DOERR, Lattice approximation and linear discrepancy of totally unimodular matrices-Extended abstract, in Proceedings of the 12th SIAM-ACM Symposium on Discrete Algorithms, Washington, D.C., 2001, pp. 119-325.
8. J. EDMONDS AND R. M. KARP, Theoretical improvements in algorithmic efficiency for network flow problems, J. Assoc. Comput. Mach., 19 (1972), pp. 248-264.
9. R. W. FLOYD AND L. STEINBERG, An adaptive algorithm for spatial gray scale, Journal of the Society for Information Display, 17 (1976), pp. 75-77.
10. A. GHOULIA-HOURI, Characterisation des matrices totalement unimodulaires, C.R. Acad. Sci. Paris, 254 (1962), pp. 1192-1194.
11. D. S. HOCHBAUM AND J. G. SHANTHIKUMAR, Nonlinear separable optimization is not much harder than linear optimization, J. Assoc. Comput. Mach., 37 (1990), pp. 843-862.
12. A. V. KARZANOV AND S. T. McCORMICK, Polynomial methods for separable convex optimization in unimodular linear spaces with applications, SIAM J. Comput., 26 (1997), pp. 1245-1275.
13. D. E. KNUTH, Digital halftones by dot diffusion, ACM Trans. Graphics, 6 (1987), pp. 245-273.
14. The LEDA Homepage, http://www.algorithmic- solutions.com/as.html/products/products.html.
15. J. O. LIMB, Design of dither waveforms for quantized visual signals, Bell System Tech. J., 48 (1969), pp. 2555-2582.
16. Q. LIN, Halftone Image Quality Analysis Based on a Human Vision Model, Proc. SPIE 1913, SPIE, Bellingham, WA, 1993, pp. 378-389.
17. B. LIPPEL AND M. KURLAND, The effect of dither on luminance quantization of pictures, IEEE Trans. Commun. Tech., COM-19 (1971), pp. 879-888.
18. M. MINOUX, Solving integer minimum cost flows with separable cost objective polynomially, Math. Programming Stud., 26 (1986), pp. 237-239.
19. K. SADAKANE, N. TAKKI-CHEBIHI, AND T. TOKUYAMA, Combinatorics and algorithms on low-discrepancy roundings of a real sequence, in Procedings of the 28th International Colloquium on Automata, Languages and Programming, Heraklion, Crete, Greece, 2001, Lecture Notes in Comput. Sci. 2076, Springer, Berlin, 2001, pp. 166-177.