|
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/4699
|
| Title: | Digital Halftoning: Algorithm Engineering Challenges |
| Authors: | ASANO, Tetsuo |
| Keywords: | approximation algorithm
combinatorial optimization
matrix rounding
network flow |
| Issue Date: | 2003-02-01 |
| Publisher: | 電子情報通信学会 |
| Magazine name: | IEICE TRANSACTIONS on Information and Systems |
| Volume: | E86-D |
| Number: | 2 |
| Start page: | 159 |
| End page: | 178 |
| Abstract: | Digital halftoning is a technique to convert a continuous-tone image into a binary image consisting of black and white dots. It is an important technique for printing machines and printers to output an image with few intensity levels or colors which looks similar to an input image. This paper surveys how algorithm engineering can contribute to digital halftoning or what combinatorial problems are related to digital halftoning. A common criterion on optimal digital halftoning leads to a negative result that obtaining an optimal halftoned image is NP-complete. So, there are two choices: approximation algorithm and polynomial-time algorithm with relaxed condition. Main algorithmic notions related are geometric discrepancy, matrix (or array) rounding problems, and network-flow algorithms. |
| Rights: | Copyright (C)2003 IEICE. T.Asano, IEICE TRANSACTIONS on Information and Systems, E86-D(2), 2003, 159-178. http://www.ieice.org/jpn/trans_online/ |
| URI: | https://hdl.handle.net/10119/4699 |
| Material Type: | publisher |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 2217.pdf | | 4801Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
