|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
https://hdl.handle.net/10119/4912
|
| Title: | How to Color a Checkerboard with a Given Distribution : Matrix Rounding Achieving Low 2×2-Discrepancy |
| Authors: | Asano, Tetsuo
Tokuyama, Takeshi |
| Issue Date: | 2001 |
| Publisher: | Springer |
| Magazine name: | Lecture Notes in Computer Science |
| Volume: | 2223 |
| Start page: | 636 |
| End page: | 648 |
| DOI: | 10.1007/3-540-45678-3_54 |
| 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 how to achieve a new upper bound 5/3 using a new proof technique based on modified graph matching. |
| Rights: | This is the author-created version of Springer, Tetsuo Asano and Takeshi Tokuyama, Lecture Notes in Computer Science, 2223, 2001, 636-648. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/3-540-45678-3_54 |
| URI: | https://hdl.handle.net/10119/4912 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| C1338.pdf | | 347Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
