|| Shri Ha ri ||

BCSE 0101: Digital Image Processing

Assignment – I

Name:___________________________________ Roll no.:______________

Section: ___________ Mobile no.: _______________________

MM: 100 Submission Due Date: March 14, 2022

Note:

Take a printout of this assignment and write your answers in the space provided.
Scan and upload the filled answer sheet and submit the hardcopy to the faculty.

I. Complete the following statements. [1 x 10 = 10]

1. The discretization of image data in spatial coordinates is known as

_________________________.

2. The number of bits required to store a 1024 x 512 image with 512 gray shades is
__________________________.

3. The smallest discernible change in the gray level of an image is called its
______________________________________.

4. When the number of pixels in an image is reduced keeping the number of gray
levels in the image constant, we observe __________________________ effect.

5. When the no. of gray-levels in the image is low, the foreground details of the
image merge with the background details of the image, causing ridge like
structures. This degradation phenomenon is known as
_______________________________________.

Page 1 of 7
 6. Mark the m-adjacent path from p to q in the following image.
1 0 0 0
1 1 0 0
p 1 1 1 1 q
1 0 1 1

7. Two image subsets S1 & S2 are adjacent if

________________________________________________________________________
_______________________________________________________________________.

8. The distance between pixels p & q in the above image:

a. Euclidean distance: _____________

b. City block distance: _____________

c. Chess board distance: _____________

9. Dark characteristics in an image are better enhanced using

____________________ transformation(s).

10. Consider the following images. (a) is the original image. On (b) and (c) average
filters of different sizes have been applied. On _________ filter of size 3 x 3 has
been applied while on _________ filter of size 9 x 9 has been applied.

II. Consider two image subsets S1 & S2 as shown in the following figure. For V= {0}
determine whether the regions are: i) 4- Adjacent ii) 8-Adjacent iii) m-Adjacent .
Give reasons for your answer. [2 x 3 = 6]

Page 2 of 7
 S1 S2
1 1 1 1 0 1 0 0

1 1 0 1 0 0 1 1

1 1 0 1 0 0 1 1
1 0 0 0 1 1 1 1

i) 4- Adjacent – Yes / No
___________________________________________________________________________
___________________________________________________________________________
ii) 8-Adjacent – Yes / No
___________________________________________________________________________
___________________________________________________________________________
iii) m-Adjacent– Yes / No
___________________________________________________________________________
___________________________________________________________________________

III. Given the following 3 x 3 image, find its bit planes.

Note: There are only 8 Intensity values in the image. [3 x 8 = 24]
1 2 3
4 5 0
7 6 2

Bit Plane 0 Bit Plane 1 Bit Plane 2

Space for Calculations

Page 3 of 7
IV. Consider the following image. What will be the new value of the pixel (2, 2) if
smoothing is done using a 3x3: [1 x 5 = 5]

0 1 0 2 7
2 1 6 1 0
5 6 7 6 3
1 1 6 1 5
5 4 2 2 5

a) Mean filter ________________

b) Weighted average filter ________________

(Assign weights as 3, 2 and 1)

c) Median filter ________________

d) Min filter ________________

e) Max filter ________________

V. Compute the convolution of the Laplacian kernels L_4 and L_8 with the image given
below. Use border values to extend the image. [2 x 10 = 20]

0 0 0 0 0
0 0 0 0 0
10 10 10 10 10
10 10 10 10 10
10 10 10 10 10

L_4 L_8
Page 4 of 7
VI. Perform histogram equalization on the following 8x8 image. The gray level
distribution of the image is given below. [15]

Gray levels (rk) 0 1 2 3 4 5 6 7

Number of pixels (pk) 8 10 10 2 12 16 4 2

No. of
i/p Gray No. of
p(rk) = (L-1) Σ o/p Gray pixels in
Level pixels Σ
nk / MN (Sk) Level o/p
(rk) (nk)
image
0 8

1 10

2 10

3 2

4 12

5 16

6 4

7 2

VII. For a 8 x 8 image as shown below, generate the linear contrast stretched image with
minimum gray level 0 and maximum gray level 7. [10]

Note:

3 3 3 3 3 3 3 3
3 4 4 4 4 4 4 3
3 4 2 2 2 2 4 3
3 4 2 5 5 2 4 3
3 4 2 5 5 2 4 3
3 4 2 2 2 2 4 3
3 4 4 4 4 4 4 3
3 3 3 3 3 3 3 3

Page 5 of 7
 Space for Calculation

rk sk

Output Image

Page 6 of 7
VIII. Assume a 6-bit gray scale image I and consider the spatial filter H given by

a) Determine the maximum and minimum possible values that a pixel, to which
this spatial filter is applied, can have. Do not apply any type of normalization.
[5]

b) Propose a gray-level transformation function to ensure that any output of this

filter will be a standard 6-bit gray scale image. [5]

Page 7 of 7