This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: right pixels with the following weights (7 / 16 , 3 / 16 , 5 / 16 , 1 / 16). Here, note that the weights sum up to 1. Pseudo-code for the algorithm: 1 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,j-1) += 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: 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 “Floyd-Steinberg Dithering Algorithm” (d) Comments on the diﬀerences between results. 2...
View Full Document
- Fall '08
- Image processing, Woods, uniform quantization, 1-bit, Floyd-Steinberg Dithering Algorithm