Image Enhancement in Digital Image Processing MCQ [Free PDF] – Objective Question Answer for Image Enhancement in Digital Image Processing Quiz

21. State for the validation of the statement:
“In general-purpose for a digital image of zooming and shrinking, where Bilinear Interpolation generally is the method of choice over nearest-neighbor Interpolation”.

A. True
B. False

Answer: A

For cases 32*32 to 1024*1024, the data is rather lost in nearest neighbor Interpolation, but the result of Bilinear Interpolation remains reasonably good for the same.

 

22. A pixel p at coordinates (x, y) has neighbors whose coordinates are given by:
(x+1, y), (x-1, y), (x, y+1), (x, y-1)
This set of pixels is called ____________

A. 4-neighbors of p
B. Diagonal neighbors
C. 8-neighbors
D. None of the mentioned

Answer: A

The given set of a neighbor pixel is 1 unit distance to the right, left, up, and below respectively from pixel p(x, y). So, are called 4-neighbors of p.

 

23. A pixel p at coordinates (x, y) has neighbors whose coordinates are given by:
(x+1, y+1), (x+1, y-1), (x-1, y+1), (x-1, y-1)
This set of pixels is called ____________

A. 4-neighbors of p
B. Diagonal neighbors
C. 8-neighbors
D. None of the mentioned

Answer: B

The given set of a neighbor pixel is 1 unit distance to the right-up diagonal, right-down diagonal, left-up diagonal, and left-down diagonal respectively from pixel p(x, y). So, are called Diagonal neighbors of p.

 

24. What is the set of pixels of 8-neighbors of pixel p at coordinates (x, y)?

A. (x+1, y), (x-1, y), (x, y+1), (x, y-1), (x+2, y), (x-2, y), (x, y+2), (x, y-2)
B. (x+1, y), (x-1, y), (x, y+1), (x, y-1), (x+1, y+1), (x+1, y-1), (x-1, y+1), (x-1, y-1)
C. (x+1, y+1), (x+1, y-1), (x-1, y+1), (x-1, y-1), (x+2, y+2), (x+2, y-2), (x-2, y+2), (x-2, y-2)
D. (x+2, y), (x-2, y), (x, y+2), (x, y-2), (x+2, y+2), (x+2, y-2), (x-2, y+2), (x-2, y-2)

Answer: B

The set of pixels of 4-neighbors of p and Diagonal neighbors of p together are called 8-neighbors of pixel p(x, y).

 

25. Two pixels p and q having gray values from V, the set of gray-level values used to define adjacency, are m-adjacent if:

A. q is in N4(p)
B. q is in ND(p) and the set N4(p) ∩ N4(q) has no pixels whose values are from V
C. Any of the mentioned
D. None of the mentioned

Answer: C

Mixed adjacency is a modified form of 8-adjacency.
The above conditioned Two pixels p and q are m-adjacent if:
q is in N4(p), or q is in ND(p) and the set N4(p) ∩ N4(q) has no pixels whose values are from V.

 

26. Let S, a subset of pixels in an image, is said to be a connected set if:

A. If for any pixel p in S, the set of pixels that are connected to it in Sis only one
B. If it only has one connected component
C. If S is a region
D. All of Mentioned

Answer: D

For a subset of pixels in an image S.

For any pixel p in S, the set of pixels is called a connected component of S if connected to p in S. The set S is called a connected set if it only has one connected component. S is a region of the image if S is a connected set.

 

27. Let R be a subset of pixels in an image. How can we define the contour of R?

A. If R is a region, and the set of pixels in R has one or more neighbors that are not in R
B. If R is an entire image, then the set of pixels in the first and last rows and columns of R
C. All of Mentioned
D. None of the mentioned

Answer: C

For a subset of pixels in an image R.

The boundary or contour of a region R is the set of pixels in the region that have one or more neighbors that are not in R.

In case R is an entire image, then its boundary is defined as the set of pixels in the first and last rows and columns of the image.

 

28. For pixels p(x, y), q(s, t), and z(v, w), D is a distance function or metric if:

A. D(p, q) ≥ 0
B. D(p, q) = D(q, p)
C. D(p, z) ≤ D(p, q) + D(q, z)
D. All of Mentioned

Answer: D

For pixels p(x, y), q(s, t), and z(v, w), D is a distance function or metric if:
(i) D(p, q) ≥ 0, (D(p, q) = 0 if p=q),
(ii) D(p, q) = D(q, p), and
(iii) D(p, z) ≤ D(p, q) + D(q, z).

 

29. For pixels p(x, y), q(s, t), the Euclidean distance between p and q is defined as:

A. D(p, q) = [(x – s)2 + (y – t)2]1/2
B. D(p, q) = |x – s| + |y – t|
C. D(p, q) = max (|x – s| + |y – t|)
D. None of the mentioned

Answer: A

The Euclidean distance for pixels p(x, y), q(s, t) is:
D(p, q) = [(x – s)2 + (y – t)2]1/2.

 

30. For pixels p(x, y), q(s, t), the city-block distance between p and q is defined as:

A. D(p, q) = [(x – s)2 + (y – t)2]1/2
B. D(p, q) = |x – s| + |y – t|
C. D(p, q) = max (|x – s| + |y – t|)
D. None of the mentioned

Answer: B

The city-block distance for pixels p(x, y), q(s, t) is the D4 distance given by:
D(p, q) = |x – s| + |y – t|.

Scroll to Top