This preview shows pages 1–2. Sign up to view the full content.
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. Pseudocode 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,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 dened as follows: Q ( I ( i,j )) = 1 I ( i,j ) . 5 else Things to turn in: (a) Mle (b) Output of uniform quantization (c) Output of FloydSteinberg Dithering Algorithm (d) Comments on the dierences between results. 2...
View
Full
Document
 Fall '08
 MANJUNATH
 Image processing

Click to edit the document details