0% found this document useful (0 votes)
55 views3 pages

Digital Image Processing Concepts

The document contains multiple-choice questions related to image processing concepts, including terms like 'region', 'sampling', 'quantization', and 'pixel neighbors'. Key answers highlight the importance of connected sets in images, the process of digitizing continuous data, and the definitions of pixel adjacency. It emphasizes the significance of discrete gray levels and sampling in determining the quality of digital images.

Uploaded by

Smita Sangewar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
55 views3 pages

Digital Image Processing Concepts

The document contains multiple-choice questions related to image processing concepts, including terms like 'region', 'sampling', 'quantization', and 'pixel neighbors'. Key answers highlight the importance of connected sets in images, the process of digitizing continuous data, and the definitions of pixel adjacency. It emphasizes the significance of discrete gray levels and sampling in determining the quality of digital images.

Uploaded by

Smita Sangewar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd

If R is a subset of pixels, we call R a _________ of the image if R is a connected

set.
A. Disjoint
B. Region
C. Closed
D. Adjacent
ANSWER: B

A continuous image is digitised at _______ points.


A. sampling
B. random
C. vertex
D. contour
ANSWER: A

The transition between continuous values of the image function and its digital
equivalent is called ______________
A. Quantisation
B. Sampling
C. Rasterisation
D. None of the Mentioned
ANSWER: A

The smallest discernible change in intensity level is called ____________


A. Intensity Resolution
B. Contour
C. Saturation
D. Contrast
ANSWER: A

What is the tool used in tasks such as zooming, shrinking, rotating, etc.?
A. Interpolation
B. Sampling
C. Filters
D. None of the Mentioned
ANSWER: A

If R is a subset of pixels, we call R a _________ of the image if R is a connected


set.
A. Disjoint
B. Region
C. Closed
D. Adjacent
ANSWER: B

To convert a continuous sensed data into Digital form, which of the following is
required?
A. Both Sampling and Quantization
B. Sampling
C. Quantization
D. Neither Sampling nor Quantization
ANSWER: A

To convert a continuous image f(x, y) to digital form, we have to sample the


function in __________
A. All of the mentioned
B. Coordinates
C. Amplitude
D. None of the mentioned
ANSWER: A

For a continuous image f(x, y), how could be Sampling defined?


A. Digitizing the coordinate values
B. Digitizing the amplitude values
C. All of the mentioned
D. None of the mentioned
ANSWER: A

For a continuous image f(x, y), Quantization is defined as


A. Digitizing the amplitude values
B. Digitizing the coordinate values
C. All of the mentioned
D. none of the mentioned
ANSWER: A

The quality of a digital image is well determined by ___________


A. The discrete gray levels
B. number of samples
C. All of the mentioned
D. None of the mentioned
ANSWER: A

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

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. Diagonal neighbors
B. 4-neighbors of p
C. 8-neighbors
D. None of the mentioned
ANSWER: A

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+1, y+1), (x+1, y-1), (x-1, y+1), (x-
1, y-1)
B. (x+1, y), (x-1, y), (x, y+1), (x, y-1), (x+2, y), (x-2, y), (x, y+2), (x, y-x+1,
y+1)
C. (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: A

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 ND(p) and the set N4(p) n N4(q) has no pixels whose values are from V

B. q is in N4(p)
C. Any of the mentioned
D. None of the mentioned
ANSWER: A
In 4-neighbours of a pixel p, how far are each of the neighbours located from p?
A. one pixel apart
B. four pixels apart
C. alternating pixels
D. None of the Mentioned
ANSWER: A

You might also like