Halftoning Algorithm With Data Encoding
Original Publication Date: 1988-Nov-01
Included in the Prior Art Database: 2005-Feb-15
This article describes a new halftoning technique for a bi-level halftone image. The algorithm can produce a halftone image as well as its compressed data simultaneously. In the algorithm an original image is partitioned into a set of sub-areas, and each sub-area is translated into coded information representing a halftone image. The size of the sub-area is determined by the complexity of the sub-area of the original image. (Image Omitted) The outline of the algorithm is as follows. The algorithm can be considered as a variant of error diffusion. The difference between the new algorithm and the original one is the size of the unit of error calculation. The original algorithm always executes the error calculation pixel by pixel. The size of the sub-area which the new algorithm treats as a unit of calculation is variable.