This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: sum up to 1. Pseudocode for the algorithm: for i = 1 to height for j = 1 to width I2(i,j) = Q(I(i,j)); error = I(x,y)I2(x,y); I(i,j+1) += 7 * error/16; I(i+1,j1) += 3 * error/16; I(i+1,j) += 5 * error/16; I(i+1,j+1) += error/16; end for end for Here Q ( . ) represents inform quantization operator. In this homework, assuming that I ( i,j ) is uniformly distributed over [0 , 1], Q ( I ( i,j )) can be deﬁned as follows: 1 Q ( I ( i,j )) = ‰ 1 I ( i,j ) ≥ . 5 else Things to turn in: (a) Mﬁle (b) Output of uniform quantization (c) Output of “FloydSteinberg Dithering Algorithm” (d) Comments on the diﬀerences between results. 2...
View
Full Document
 Fall '08
 MANJUNATH
 Image processing, Leftwing politics, Articles with example pseudocode, Error diffusion, Dither, FloydSteinberg Dithering Algorithm

Click to edit the document details