0

# Error Diffusion Dithering - Jarvis Judice Ninke

Unsolved
###### Computer Vision

Difficulty: 6 | Problem written by mesakarghm
##### Problem reported in interviews at

Jarvis-Judice-Ninke is an approach for image dithering using error diffusion. In error diffusion, the quantization error of the current pixel is added to the pixel on the right and below according to the procedure below:

a: For each point in image, find the closest color available  (for grayscale images, this is just a thresholding operation fixed at 127 for this problem)

b: Calculate the difference between the value in the image and the color you have.

c: Now divide up these error values and distribute them over the neighboring pixels which you have not visited yet.

d: When you get to these later pixels, just add the errors distributed from the earlier ones, clip the values to the allowed range if needed, then continue as above.

The set below shows the index of the neighboring pixels along with their diffusal coefficient according to the Jarvis Judice Ninke Method.

(
(1, 0, 7 / 48),
(2, 0, 5 / 48),
(-2, 1, 3 / 48),
(-1, 1, 5 / 48),
(0, 1, 7 / 48),
(1, 1, 5 / 48),
(2, 1, 3 / 48),
(-2, 2, 1 / 48),
(-1, 2, 3 / 48),
(0, 2, 5 / 48),
(1, 2, 3 / 48),
(2, 2, 1 / 48),
)

Write a program to implement the Jarvis Judice Ninke dithering in a given 2D matrix (grayscale image). Use the diffusion filter given in the problem set for dividing up the error.

##### Sample Input:
<class 'numpy.ndarray'>
image: [[ 1 7 119 13 12] [ 11 21 61 81 91] [ 5 66 6 5 5] [ 5 66 166 145 155] [ 5 66 136 145 155]]

##### Expected Output:
<class 'numpy.ndarray'>
[[ 0 0 0 0 0] [ 0 0 0 0 0] [ 0 0 0 0 0] [ 0 0 255 255 255] [ 0 0 255 255 255]]

MLPro Premium also allows you to access all our high quality MCQs which are not available on the free tier.

Not able to solve a problem? MLPro premium brings you access to solutions for all problems available on MLPro

Have an issue, the MLPro support team is available 24X7 to Premium users.