A dynamic communication algorithm for digital halftoning

Authors:
Philip F. Hingston;R. Lyndon While
Affiliations:
Edith Cowan University, Western Australia 6050;The University of Western Australia, Western Australia 6009
Venue:
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Year:
2002

Citing 6
Cited 0

Digital halftones by dot diffusion

ACM Transactions on Graphics (TOG)
Digital halftoning with space filling curves

Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Three plus five makes eight: a simplified approach to halftoning

Scientific visualization of physical phenomena
A Markovian framework for digital halftoning

ACM Transactions on Graphics (TOG)
Space diffusion: an improved parallel halftoning technique using space-filling curves

SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.