UP TABLE (LUT) METHOD FOR IMAGE HALFTONING

Recently we have applied Look Up Table (LUT) Method for inverse halftoning. We also proposed tree-structure LUT inverse ha1ftoning:in order to reduce memory requirements of the LUT method. In this paper we introduce LUT based halftoning method. Pixels from a causal neighborhood and the contone value of the current pixel will be included in the e LUT halftoning will require no arithmetic operations other than memory access. For any halftoning method, a sample set of images and halftones of these images will be used. We will then introduce tree-structure LUT (TLUT) halftoning. Even though this method is more complex than LUT halftoning it produces better halftones and it requires much less storage than LUT halftoning. We will demonstrate how error diffusion characteristics can be achieved with this meth rwards, our algorithm will be trained by Direct Binary Search (DBS) imof tree-structure LUT halftoning is on algorithm but much lower than e halftone quality of TLUT halftongets bigger. Thus, halftone sion and DBS will be achieved depending on the size of tree-structure in TLUT algorithm.