ABSTRACT
The most well recognized of these algorithms is the direct binary search (DBS) algorithm, first proposed by M. Analoui and J. P. Allebach to obtain the absolute best arrangement of binary dots to represent a continuous-tone original. The DBS algorithm processes each pixel of the binary image, one at time, by either swapping the current pixel with one of its eight nearest neighbors or toggling the bit from 1 to 0 or 0 to 1 according to the modeled visual cost between the binary image and the continuoustone original. The DBS algorithm, as presented, demands significant computational resources since needs to be recalculated for every trial swap or toggle, for each pixel of the image, in all iterations. The algorithm could actually start with an all-white image or a halftone of a different image; yet, the DBS algorithm will still produce a halftone of the target image.
