Dithering algorithms for variable dot size printers.

Victor Ostromoukhov Patrick Emmel Nicolas Rudaz Isaac Amidror Roger D. Hersch

Published in: ICIP (1) (1996)

Keyphrases

learning algorithm
orders of magnitude
computational cost
theoretical analysis
times faster
elimination algorithm
optimization problems
computationally efficient
computationally expensive
recently developed
upper bound
image reconstruction
memory requirements
graph theory
space complexity