A Dynamic Communication Algorithm for Digital Halftoning

Hingston, P.F. and While, R.L.

    We present a novel algorithm for digital halftoning. The algorithm combines a technique based on error diffusion with the use of a cost function to determine termination. Its chief advantages include the use of randomness to avoid visual artifacts in the binary image and its amenability to parallel execution. The algorithm is a member of the class of 'dynamic communication algorithms' which make novel use of dynamically-routed messages to structure the execution of a program.
Cite as: Hingston, P.F. and While, R.L. (2002). A Dynamic Communication Algorithm for Digital Halftoning. In Proc. Twenty-Fifth Australasian Computer Science Conference (ACSC2002), Melbourne, Australia. CRPIT, 4. Oudshoorn, M. J., Ed. ACS. 111-118.
pdf (from crpit.com) pdf (local if available) BibTeX EndNote GS