DIP QUESTION BANK
[Link]. Question Marks
1 With a neat block diagram, explain the
fundamental steps in digital image
processing.
2 With the help of a neat block diagram,
explain the components of a general purpose
image processing system. Give an example
for each of the component and explain how
this system is different from other systems.
3 a) Describe the principle of image formation
in Human eye
b) Explain brightness adaptation &
discrimination
4 Explain in detail Mach bands & perceived
brightness with diagrams. Also define Weber
ratio
5 Discuss optical illusions with examples
6 Define spatial resolution & gray level
resolution.
Also explain the following
a. False contouring
b. Aliasing & Moiré patterns
OR
Explain the significance of the
processes sampling and quantization
in generating a digital image. What
are the effects of under sampling
and reduction in the quantization
levels?
7 What are the basic relationships between
pixels? With neat diagrams and appropriate
mathematical expressions explain: i)
Neighbors ii) Adjacency
iii) Connectivity
8 a)For pixels p, q with co-ordinates (x, y) and (s, t)
respectively find the distance metric D for the
following cases:
a. Euclidean distance De (p, q)
b. City block distance D4 (p, q)
c. Chessboard distance Dg (p, q)
b)Let p & q be the pixels at coordinates (10, 12) &
(15, 20) respectively. Find out which distance
measure gives the minimum distance between them
Explain arithmetic and logical oprations on images
with examples
9 Explain the following terms:
i. 4 neighbors
ii. False contouring
iii. M-Adjacency
iv. Region
v. Boundary
vi. Euclidean distance
10 a) Let p and q be the pixels at coordinates
(18, 15) and (12, 26), respectively. Find out
which distance measure gives the
minimum distance between the pixels.
b) How many minutes would it take to
transmit a 1024*1024 image with 256 gray
levels using 56k band modem? (Baud rate
is the number of bits transmitted per
second. Assume each byte is one packet
with a start bit and a stop bit).
11 Consider the image segment shown in the
following fig. Let V= {1, 2}. Compute the
lengths of shortest 4, 8 and m-paths
between p and q. If path does not exist,
explain why?
3 1 2 1 (q)
2202
1211
(p)1 0 1 2
