Relationship between Pixels and Image Enhancement Basics MCQ

Test your knowledge with important Relationship between Pixels and Image Enhancement Basics MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30+ more Relationship between Pixels and Image Enhancement Basics MCQs on Bissoy. Bissoy App

• For Image Enhancement a general-approach is to use a function of values of f (input image) in a predefined neighborhood of (x, y) to determine the value of g (output image) at (x, y). The techniques that uses such approaches are called ________
  ক

  Contouring

  খ

  Contrast stretching

  গ

  Mask processing

  ঘ

  None of the mentioned
• What is the technique for a gray-level transformation function called, if the transformation would be to produce an image of higher contrast than the original by darkening the levels below some gray-level m and brightening the levels above m in the original image.
  ক

  Contouring

  খ

  Contrast stretching

  গ

  Mask processing

  ঘ

  Point processing
• The domain that refers to image plane itself and the domain that refers to Fourier transform of an image is/are :
  ক

  Spatial domain in both

  খ

  Frequency domain in both

  গ

  Spatial domain and Frequency domain respectively

  ঘ

  Frequency domain and Spatial domain respectively
• For pixels p(x, y), q(s, t), the chessboard distance between p and q is defined as: 1/2 b) D(p, q) = |x – s| + |y – t| c) D(p, q) = max (|x – s| + |y – t|) d) None of the mentioned
  ক

  D(p, q) = 1/2

  খ

  (x – s)2 + (y – t)2

  গ

  (x – s)2 + (y – t)2

  ঘ

  (x – s)2 + (y – t)2
• For pixels p(x, y), q(s, t), the city-block distance between p and q is defined as: 1/2 b) D(p, q) = |x – s| + |y – t| c) D(p, q) = max (|x – s| + |y – t|) d) None of the mentioned
  ক

  D(p, q) = 1/2

  খ

  (x – s)2 + (y – t)2

  গ

  (x – s)2 + (y – t)2

  ঘ

  (x – s)2 + (y – t)2
• For pixels p(x, y), q(s, t), the Euclidean distance between p and q is defined as: 1/2 b) D(p, q) = |x – s| + |y – t| c) D(p, q) = max (|x – s| + |y – t|) d) None of the mentioned
  ক

  D(p, q) = 1/2

  খ

  (x – s)2 + (y – t)2

  গ

  (x – s)2 + (y – t)2

  ঘ

  (x – s)2 + (y – t)2
• For pixels p(x, y), q(s, t), and z(v, w), D is a distance function or metric if:
  ক

  D(p, q) ≥ 0

  খ

  D(p, q) = D(q, p)

  গ

  D(p, z) ≤ D(p, q) + D(q, z)

  ঘ

  All of the mentioned
• Let R be a subset of pixels in an image. How can we define the contour of R?
  ক

  If R is a region, and the set of pixels in R have one or more neighbors that are not in R

  খ

  If R is an entire image, then the set of pixels in the first and last rows and columns of R

  গ

  All of the mentioned

  ঘ

  None of the mentioned
• Let S, a subset of pixels in an image, is said to be a connected set if:
  ক

  If for any pixel p in S, the set of pixels that are connected to it in Sis only one

  খ

  If it only has one connected component

  গ

  If S is a region

  ঘ

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

  q is in N4(p)

  খ

  q is in ND(p) and the set N4(p) ∩ N4(q) has no pixels whose values are from V

  গ

  Any of the mentioned

  ঘ

  None of the mentioned
• What is the set of pixels of 8-neighbors of pixel p at coordinates (x, y)?
  ক

  (x+1, y), (x-1, y), (x, y+1), (x, y-1), (x+2, y), (x-2, y), (x, y+2), (x, y-2)

  খ

  (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)

  গ

  (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)

  ঘ

  (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)