SDM COLLEGE OF ENGINEERING AND

TECHNOLOGY, DHARWAD
Department of Computer Science and Engineering
Digital Image Processing Assignment Questions
Course Instructors : Sem : VI A and B Div
Mar-July 2021
Dr. S. B. Kulkarni

UNIT – I
1. Write the fundamental steps in Digital Image Processing.
Ans:-
• Image acquisition
• Image enhancement
• Image restoration
• Morphological processing
• Segmentation
• Obj recognition
• Representation & description

2. What are the components of an Image Processing system.

 3.
Ans:-

3. Write briefly about image sensing and acquisition process.

4. What is image sampling and quantization? Explain with an
example.
5. What are the Different functional forms of an Image ?
Ans:-
• Gray lvl img/ 2D-still img
• 3D-obj color/multiband
• Video sequence-monochrome
• 3D-moving object color/multiband

6. What are the various types of process in the image processing

represented in
computer vision ?
7. Explain neighbor of pixel and its type with suitable example.
8. Explain connectivity, boundary, region and path with suitable
example.
9. List and Explain any five applications of Image Processing ?
10.What is adjacency? List the types and explain each with an
example.

11.Analyze the following image with 4-connected and 8-

connected and M
connected Find the Path and analyze each pixel by taking
coordinate point
(1,1) as reference point.
001 011
010 010
100 110
Fig 1 Fig 2
Ans:-
Draw the connectivity line between the high intensity pixels(i.e;
1)
And fig 1 is neither 4 nor 8 connected and fig 2 is both 4 and 8
connected and also m connected.

12.What are the distance measuring algorithms? Explain with

example.
13. Find the minimum path for the given image I for the vector v
case1 : v = {0,
1}, and Case 2: v = {1,2} by considering unit distance between
the connected
pixels using 4, 8 and M connectivity.
Image I
 3 1 2 1 PointQ
2202
1211
Point P 1 0 1 2
Ans:-
i) (1,0) n4p; (0,1) ND(p);(1,0) n4p;(0,1) nDp
ii)(1,2) NDp;(2,1)n4p;(1,2)NDp;(2,1)n4p

14.Find the minimum path for the given image I for the vector v
= {1,2,3} by
considering unit distance between the connected pixels using 4,
8 and M
connectivity.
Image I
3 1 2 1 PointQ
2202
1211
Point P 1 0 1 2

15. Calculate the number of bits required to store a digital image

of size
1024X1024 and no. of gray levels are 128.
****************************************************
UNIT – II
1. List and Explain Basic Gray Level Transformations with a
graph
Ans:-
] Negatives:- s = L - 1 - r
• The negative of an image with intensity levels in the range
is obtained by using the negative transformation shown in
Fig. 3.3, which is given by the expression.
• Reversing the intensity levels of an image in this manner
produces the equivalent of a photographic negative.
• This type of processing is particularly suited for enhancing
white or gray detail embedded in dark regions of an image,
especially when the black areas are dominant in size.
Log Transformations : s = c log(1 + r)

• The general form of the log transformation in Fig. where c

is a constant, and it is assumed that the shape of the log
curve in Fig. 3.3 shows that this transformation maps a
narrow range of low intensity values in the input into a
wider range of output levels.
• The opposite is true of higher values of input levels. We use
a transformation of this type to expand the values of dark
pixels in an image while compressing the higher-level
values.
• The opposite is true of the inverse log transformation.

s = cr^Gamma
Power-Law (Gamma) Transformations:-
• Power-law transformations have the basic form where c
and are positive constants.
• Sometimes is written as to account for an offset. However,
offsets typically are an issue of display calibration and as a
result they are normally ignored.
• Plots of s versus r for various values of shown. As in the case
of the log transformation, power-law curves with fractional
values of map a narrow range of dark input values into a
wider range of output values, with the opposite being true
for higher values of input levels.
2. Represent Rotation and Scaling of a point on a 2-D plain and
derive an
equation in matrix form.
Ans:-
In rotation, we rotate the object at particular angle θ from
its origin. From the following figure, we can see that the
point P is located at angle φ from the horizontal X
coordinate with distance r from the origin.
Let us suppose you want to rotate it at the angle θ. After
rotating it to a new location, you will get a new point P’
Using standard trigonometric the original coordinate of
point PX,Y can be represented as –

X=rcosϕ......(1)
Y=rsinϕ......(2)

Same way we can represent the point P’ X′,Y′ as –

x′=rcos(ϕ+θ)=rcosϕcosθ−rsinϕsinθ.......(3)
y′=rsin(ϕ+θ)=rcosϕsinθ+rsinϕcosθ.......(4)

Substituting equation 1 & 2 in 3 & 4 respectively, we will

get
x′=xcosθ−ysinθ
y′=xsinθ+ycosθ
Representing the above equation in matrix form,
Scaling
To change the size of an object, scaling transformation is
used. In the scaling process, you either expand or
compress the dimensions of the object. Scaling can be
achieved by multiplying the original coordinates of the
object with the scaling factor to get the desired result.
Let us assume that the original coordinates are X,Y, the
scaling factors are (SX, SY), and the produced coordinates
are X′,Y′. This can be mathematically represented as
shown below −
X' = X . SX and Y' = Y .SY

The scaling factor SX, SY scales the object in X and Y

direction respectively. The above equations can also be
represented in matrix form as below –
3. Statement “ Concatenation is noncommutative” in case of
sequence of
operations – Justify.
Ans:-

4. What is histogram ? How to represent histogram of an image

? What are its
applications ?
Ans:- ] Histograms are the basis for numerous spatial domain
processing techniques. Histogram manipulation can be used for
image enhancement.
• The horizontal axis of each histogram plot corresponds to
intensity values, the vertical axis corresponds to values of
or if the values are normalized. Thus, histograms may be
viewed graphically simply as plots of versus.
• We note in the dark image that the components of the
histogram are concentrated on the low (dark) side of the
intensity scale.
 • Similarly, the components of the histogram of the light
image are biased toward the high side of the scale.
• An image with low contrast has a narrow histogram located
typically toward the middle of the intensity scale.
• For a monochrome image this implies a dull, washed-out
gray look.
• Finally, we see that the components of the histogram in the
high-contrast image cover a wide range of the intensity
scale and, further, that the distribution of pixels is not too
far from uniform, with very few vertical lines being much
higher than the others. Intuitively, it is reasonable to
conclude that an image whose pixels tend to occupy the
entire range of possible intensity levels and, in addition,
tend to be distributed uniformly, will have an appearance
of high contrast and will exhibit a large variety of gray tones.
• The net effect will be an image that shows a great deal of
gray-level detail and has high dynamic range. It will be
shown shortly that it is possible to develop a transformation
function that can automatically achieve this effect, based
only on information available in the histogram of the input
image.

5. What are the procedures to compute histogram equalization?

and write code
snippet for histogram equalization using matlab functions.
MatLab-Code:-
a=imread(‘xyz.png’);
b=histeq(a);
imshow(a);
imhist(a);
imshow(b);
imhist(b);

6. Briefly explain Piecewise-Linear Transformations.(ans:-

pg116)
Ans:-
A complementary approach to the methods discussed in the
previous three sections
is to use piecewise linear functions.

Contrast stretching
One of the simplest piecewise linear functions is a contrast-
stretching transformation. Contrast stretching is a process that
expands the range of intensity levels in an image so that it spans
the full intensity range of the recording medium or display
device.

Intensity-level slicing
Highlighting a specific range of intensities in an image often is
of interest.Applicationsinclude enhancing features such as
masses of water in satellite imagery and enhancing flaws in X-
ray images. The process, often called intensity-level-slicing.

Bit-plane slicing
An 8-bit image may be considered as being composed of eight
1-bit planes, with plane 1 containing the lowest-order bit of all
pixels in the image and plane 8 all the highest-order bits. The
lower-order planes contribute to more subtle intensity details in
the image. The image can be sliced by any bit planes and
corresponding image will be resulted.

7. Write the steps for histogram equalization and find the

histogram equalization
for the following image.
44444
34543
35553
34543
44444
Ans:-

Given I=
44444
34543
 35553
34543
44444

Total no.of pixels=MxN=25

Max pixel value is 5 in the given image
Since we need minimum 3 bits to represent 5 in binary we
have
: 23 =8 →(0-7) gray levels

Gray-level 0 1 2 3 4 5 6 7
No.of pixels 0 0 0 6 14 5 0 0
Running sum 0 0 0 6 20 25 25 25
Normalization 0 0 0 6/25 20/25 1 1 1
Multiply by 0x7=0 0 0 42/25 140/25 7 7 7
max gray level
Max-gray-level 0 0 0 2 6 7 7 7
One to one 0 1 2 3 4 5 6 7
correspondence
0 0 0 2 6 7 7 7
New image I’=

6 6 6 6 6
2 6 7 6 2
2 7 7 7 2
2 6 7 6 2
6 6 6 6 6

8. Find the Histogram Equalization for the given data

Given Data : Suppose that a 3-bit image (L=8) of size 64 × 64
pixels (MN =4096) has the intensity distribution shown in
following table.
Get the histogram equalization transformation function and give
the ps(sk) for each sk.

Ans:-
Given 3-bit image (L=8) of size 64 × 64 pixels (MN =4096)

rk 0 1 2 3 4 5 6 7
nk 790 1023 850 656 329 245 122 81
Pr(rk)= nk/MN 0.19 0.25 0.21 0.16 0.08 0.06 0.03 0.02
Running sum 0.19 0.44 0.65 0.81 0.89 0.95 0.98 1
Pr(rk)x7 1.33 3.08 4.55 5.67 6.23 6.65 6.86 7
Max-gray-level 1 3 5 6 6 7 7 7
One to one 0 1 2 3 4 5 6 7
correspondence
1 3 5 6 6 7 7 7
****************************************************

9. Write a note on Smoothing Spatial Filters

10.Write a note on Sharpening Spatial Filters.
UNIT III
1. Explain Erosion and Dilation with example
2. Explain Opening and Closing with example
3. Explain hit or miss transform with example
4. Explain briefly boundary extraction and hole filling
morphological algorithm
5. Explain briefly extraction of connected components and
convex hull
morphological algorithm
6. Explain briefly thinning and thickening morphological
algorithm
7. Explain briefly skeletons and pruning morphological
algorithm
8. Write a note on Gray Scale morphology