DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

INDIAN INSTITUTE OF TECHNOLOGY (INDIAN SCHOOL OF MINES), DHANBAD

Winter Mid Semester Examination, Session 2022-23

Examination: VI BTech (CSE) Time: 2 Hours

Subject: Digital Image Processing (CSO304) Weightage: 32%, Max. Marks: 60
Instructions:
(i) Answer ALL questions.
(ii) Attempt all sub-parts of a same question at same place and in order.
(iii) If you use any algorithm (covered in the class) to solve any problem, just mention it, do not elaborate.
Q. No. Question Mark
1. (a) The forward transformation is given as .

* + * + * +
√ √ [2.5]
* + * + * + * +

The original image can be recovered as .

* + * + * +
√ √ [2.5]

* + * + * + * +

It can be observed that there is no information loss. This is the reason for the popularity of unitary
transforms.

(b) Image Equalization

Cumulative Sum Round off to the
K
nearest Gray level

⁄ 3.0625

⁄
[4]
⁄ 4.5937

⁄ 6.3437

⁄
 Frequency Table
K

[1]

Histogram Specification:
Equalization to the Target Histogram
Cumulative Sum
K Round off

⁄
[2]
⁄

Final Mapping
Gray Mapping of the Mapping of the
Map
level equalization equalization of the target

[2]

Frequency Table
K
[1]
2. (a)
:

Resultant of 𝑎𝑑𝑎𝑝𝑡𝑖𝑣𝑒 𝑚𝑒𝑑𝑖𝑎𝑛 filtering over 𝐼 :

[1.5]
𝑓 𝑥, 𝑦

Resultant of 𝑎𝑑𝑎𝑝𝑡𝑖𝑣𝑒 𝑚𝑒𝑑𝑖𝑎𝑛 filtering over 𝐼 :

[1.5]
𝑓 𝑥, 𝑦

Resultant of 𝑎𝑑𝑎𝑝𝑡𝑖𝑣𝑒 𝑚𝑒𝑑𝑖𝑎𝑛 filtering over 𝐼 :

𝑓 𝑥, 𝑦 [1.5]

Resultant of 𝑎𝑑𝑎𝑝𝑡𝑖𝑣𝑒 𝑚𝑒𝑑𝑖𝑎𝑛 filtering over 𝐼 :

[1.5]
𝑓 𝑥, 𝑦

(b) The steps to design the binary thinning algorithm to transforms a square kernel (radius size is or larger)
to a straight line of size equal to or larger is as follows:
[i] Define a set of templates as follows:
[5]

[ii] Remove all pixels in the input pattern in the following four sub-steps (passes):
 Remove all pixels that match template (a) and are removable;
  Remove all pixels that match template (b) and are removable; [3]
 Remove all pixels that match template (c) and are removable;
 Remove all pixels that match template (d) and are removable.

[iii] Go on repeating Step [ii] until no further changes occur in the image pattern, that is, no further [1]
pixels are removed.
3. (a) : Q= -1.5

Resultant of 𝑐𝑜𝑛𝑡𝑟𝑎ℎ𝑎𝑟𝑚𝑜𝑛𝑖𝑐 𝑚𝑒𝑎𝑛 filtering over 𝐼 :

9 86 [2]
𝑓 𝑥, 𝑦 ≈
878

Resultant of 𝑐𝑜𝑛𝑡𝑟𝑎ℎ𝑎𝑟𝑚𝑜𝑛𝑖𝑐 𝑚𝑒𝑎𝑛 filtering over 𝐼 :

66 [2]
𝑓 𝑥, 𝑦 ≈
6

Resultant of 𝑐𝑜𝑛𝑡𝑟𝑎ℎ𝑎𝑟𝑚𝑜𝑛𝑖𝑐 𝑚𝑒𝑎𝑛 filtering over 𝐼 :

[2]
𝑓 𝑥, 𝑦 ≈
866

Resultant of 𝑐𝑜𝑛𝑡𝑟𝑎ℎ𝑎𝑟𝑚𝑜𝑛𝑖𝑐 𝑚𝑒𝑎𝑛 filtering over 𝐼 :

9 [2]
𝑓 𝑥, 𝑦 ≈
5 6

[1]

(b) When ,

∑ [1.5]

( ) ( )
 When ,

∑
[1.5]
( ) ( )

When ,

∑
[1.5]

When ,

∑
[1.5]
( )

Therefore, the IDFT of the Sequence is { , , , }

4. (a) With reference to the example shown in below top figure, the boundary that results from using the
structuring element SE1 generally forms an 8-connectedpath (leftmost figure), whereas the boundary [2]
resulting from the structuring element SE2 forms a 4-connected path (rightmost figure).

[3]

(b) As the order of the filter goes on increasing, a small amount of ringing effects does not creep in because
the Butterworth low pass filter tends to be an ideal filter.

(i) This will have nearly no effect on the DFT as the image is being convolved with just a mean [3]
function.

(ii) Multiplication in spatial domain is convolution in Fourier domain. The image DFT will be
convolved with a delta function peaked at , and hence the Fourier transform will [4]
undergo a frequency shift of , , i.e. , , . Another way to do this is
to look at a twisted version of the Fourier shift theorem which says that
 , ( ) , .

(c) The ringing effects due to the sharp cut-offs in the ideal low pass filter (ILPF) and to get rid of ringing
effects, elimination of sharp cut-offs is necessary. This exactly happens in Butterworth low pass filters
(BLPF). The transfer function of the Butterworth low pass filter of order n and the cut off frequency at a
distance D0 from the origin is defined as
[2]
,
,

where, , is the distance from the point , to the origin of the frequency rectangle for an [1]
image. , is the Fourier transform to the filtering mask. Unlike the ILPF, the BLPF does not have
sharp discontinuities and hence there are no ringing effects present when a BLPF is used.