Recently, a fast error diffusion halftoning algorithm using look-up tables (LUT) was proposed to speed up the multiplication of error filter coefficients. In this letter, we propose another LUT-based error diffusion halftoning algorithm which is more flexible in terms of the size of the LUT that can be used and thus allows for a more optimal tradeoff between halftone quality, processing speed, hardware complexity and parallelizability. Furthermore, the aggregate error in the proposed algorithm can be computed with different bitdepths for the different errors. As an example, we present a variant of the Floyd-Steinberg error diffusion algorithm which consists of two 256K bytes LUTs and the calculation of the modified input requires 1 addition and 2 table look-up operations per pixel processed.
By: Chai Wah Wu; Mikel Stanich; Hong Li; Yue Qiao; Larry Ernst
Published in: RC23708 in 2005
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .