MCQ Unit III

KALASALINGAM ACADEMY OF RESEARCH AND EDUCATION
MCS18R5004 - Digital Image Processing

UNIT III
1 The requirement for approximation used for the first derivative are
Options - Correct answer: 4
(1) must be zero in areas of constant intensity
(2) must be non-zero at the onset of an intensity step
(3) must be non zero at points along an intensity ramp
(1) all the above
2 is set of connected pixels that lies on the boundary

between two regions that differ in grey value.
(1) Edge
(2) Line
(3) Point
(1) None of the above

3 Some of the edges that are normally encountered in image processing are
(1) Step edge
(2) Ramp edge
(3) Roof edge
all the above

4 edge is an abrupt intensity change.
(1) Step
(2) Ramp
(3) Spike
(1) Roof
5 Which of the following points is/are property of the second-order derivative around
an edge?
(1) it produces two values for every edge in an image
(2) its zero crossings can be used for locating the centers of thick edges
(3) it works only for binary image
both 1 and 2
6 Bimodal images are those where the histograms have
peaks separated by valley.
(1) two distinct
(2) three distinct
(3) four distinct
None of the above

7 The slope of the ramp is to the degree of blurring in the
edges.
(1) inversely proportional
(2) directly proportional
(3) constant
8 The direction of the edges is to the direction of

the gradient vector at that point.
(1) Parallel
(2) Perpendicular
(3) at 45 degrees
9 Polygonal approximation are attractive because
(1) they can capture essential shape feature of a region
(2) keeping the representation of the boundary
(3) relatively simple
(4) all the above

10 A true peak is determined by
(1) sharpness
(2) depth
(3) both a and b
None of the above
11 Intensity transitions involving thin objects such as lines often are referred to as
(1) ramp edges
(2) step edges
(3) roof edges
12 In both ramp and step changes the second-order derivative has signs as it transi
into and out of an edge.
(1) Opposite
(2) same
(3) positive
(4) negative
13 represents agradual change in intensity.
(1) Step edge
(2) Ramp edge
(3) Roof edge
Spike edge
14 represents a quick change and immediately return to the original

intensity level.
(1) Step edge
(2) Ramp edge
(3) Roof edge
(4) Spike edge
15 Roof edges are models through with the base of a roof edge are being determined by
the
(1) thickness of the line
(2) sharpness of the line
(3) both a and b

16 The gradient vector sometimes is called as ....................
(1) edge normal
(2) point normal
(3) line normal
None of the above
17 Which of the following is not a necessary step for edge detection?
(1) Image smoothing for noise reduction
(2) Detection of edge points
(3) Edge localization
(4) Brightness enhancement
18 The intersection between the zero intensity axis and a line extending between
the extrema of the second derivative marks a point called the crossing of the
second derivative
(1) level
(2) unit
(3) zero
(4) self
19 The fundamental steps performed in edge detection are
(1) Image smoothing for noise reduction
(2) Detecting the edge points
(3) Edge localization
(4) All of the above
20 Partition an image based on abrupt changes in intensity such as edges are based on
(1) segmentation algorithm based on discontinuity
(2) segmentation algorithm based on similarity
(3) both 1 and 2
21 Partitioning an image into regions according to a set of predefined criteria is based on
(1) segmentation by discontinuity
(2) segmentation by similarity
(3) both a and b

22 Computation of derivatives based on spatial masks is
filtering of an image.
(1) Average
(2) Spatial
(3) Frequency domain

23 detectors are the local image processing method designed to
detect the edge pixels.
(1) Edge
(2) Line
(3) Point

24 The features of images considered for segmentation are
(1) point
(2) line
(3) edge
all the above
25 subdivides an image into its constituent regions or

objects.
(1) Segmentation
(2) Image enhancement
(3) Noise filtering
(4) Contrast stretching

26 Most of the segmentation algorithm is based on
(1) discontinuity
(2) similarity
(3) both 1 and 2
27 Based on user interaction , the segmentation algorithm can be classified into
(1) Manual
(2) Semi-automatic
(3) Automatic
(4) All of the above
28 Based on the pixel relationship, the segmentation algorithm can be classified as
(1) Contextual
(2) Non-contextual
(3) Both a and b

29 method of segmentation is time consuming and
prone to error.
(1) Manual method
(2) Semi-automatic
(3) Automatic
30 algorithm segment the structures of the

objects without any human interventions.
(1) Manual segmentation
(2) Automatic segmentation
(3) Semi-automatic

31 In algorithm human intervention is required at the initial
stage.
(3) Semi-automatic

32 Watershed is based on visualizing an image in three dimensions:
(1) two spatial coordinates versus intensity
(2) two intensity versus spatial coordinates
(3) one intensity versus two spatial coordinates
33 For topographic interpretation in watershed we have to consider
(1) points belonging to a regional minimum.
(2) points at which a drop of water, if placed at the location of any those points
(3) points at which water would be equally likely to fall to more than one such
minimum.
(4) all the above

34 The set of points satisfying the condition, "point at which a drop of water, if
placed at the location of any those of points, would fall with certainty to a single
minimum:" is called the
(1) Catchment basin
(2) divide line
(3) watershed line

35 The point satisfying the condition, "point at which water would be equally likely
to fall to more than one such minimum" form crest lines on the tropospheric
surface and are termed as
(1) catchment basin
(2) watershed
(3) divide lines
(4) none of the above

36 The principal objective of Segmentation using Morphological Watersheds
algorithm based on these concepts is to find the
(1) confinement basin
(2) watershed line
(3) mountains
(4) none of the above

37 When the rising water is distinct catchment basin is about to merge a
prevent the merge.
(1) dam
(2) mountains
(3) both a and b

38 In a topographic view, the height of the is
proportional to intensity values in the input image.
(1) dam
(2) mountains
(3) both a and b

39 The watershed transform for image segmentation is executed on
(1) the input image directly
(2) the gradient of the input image
(3) input image after low pass filtering
(4) input image after contrast stretching
40 The term catchment basin is associated with
(1) LBG Algorithm
(2) SPIHT Algorithm
(3) Watershed algorithm
(4) SPECK algorithm
41 Thresholding, region growing, region splitting and merging are examples of
(1) segmentation by discontinuity
(2) segmentation by similarity
(3) both a and b

42 Similarity states that a region is if all the pixels of that region
are homogeneous.
(1) coherent
(2) Noncoherent
(3) correlated
(4) uncorrelated
43 is the process repeated till the region coverage to an extent
that no further merging is possible.
(1) Region growing
(2) Region splitting
(3) Thresholding

44 is a process of grouping the pixels or sub regions to get a
bigger region present in an image.
(1) Region growing
(2) Region splitting
(3) Region merging
None of the above

45 The important issues of region growing algorithm are
(1) the selection of initial seed
(2) the seed growing criteria
(3) the termination of the segmentation process
all the above
46 If the thresholding operation depends on greyscale value and also neighborhood

property then it is called as
(1) global thresholding
(2) Local thresholding
(3) dynamic thresholding

47 If the thresholding operation depends on the pixel
coordinates also then it is called as
(2) Local thresholding

48 -thresholding is difficult when the image contrast is very
poor.
(1) local thresholding

49 If there are more than two classes of objects in the image,
(1) local
(2) global
(3) dynamic
(4) multiple
50 Adaptive algorithmis also known as
thresholding algorithm.
(1) Dynamic thresholding
(2) local thresholding
(3) Global
(4) multiple
51 Region growing techniques are examples of
algorithm.

(3) Semi-automatic

MCQ Unit III

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

MCQ Unit III

Uploaded by

Copyright:

Available Formats

KALASALINGAM ACADEMY OF RESEARCH AND EDUCATION

MCS18R5004 - Digital Image Processing

Options - Correct answer: 4

(1) must be zero in areas of constant intensity

(2) must be non-zero at the onset of an intensity step

(3) must be non zero at points along an intensity ramp

(1) all the above

2 is set of connected pixels that lies on the boundary

Options - Correct answer: 1

(1) None of the above

Options - Correct answer: 4

(1) Step edge

(2) Ramp edge

(3) Roof edge

all the above

Options - Correct answer: 1

Options - Correct answer: 4

(1) it produces two values for every edge in an image

(3) it works only for binary image

6 Bimodal images are those where the histograms have

peaks separated by valley.

Options - Correct answer: 1

(1) two distinct

(2) three distinct

(3) four distinct

None of the above

Options - Correct answer: 1

(1) inversely proportional

(2) directly proportional

(4) None of the above

8 The direction of the edges is to the direction of

Options - Correct answer: 2

(4) None of the above

9 Polygonal approximation are attractive because

Options - Correct answer: 4

(1) they can capture essential shape feature of a region

(2) keeping the representation of the boundary

(3) relatively simple

(4) all the above

Options - Correct answer: 3

(3) both a and b

None of the above

Options - Correct answer: 3

(1) ramp edges

(2) step edges

(3) roof edges

(4) None of the above

Options - Correct answer: 1

Options - Correct answer: 2

(1) Step edge

(2) Ramp edge

(3) Roof edge

14 represents a quick change and immediately return to the original

Options - Correct answer: 4

(1) Step edge

(2) Ramp edge

(3) Roof edge

(4) Spike edge

Options - Correct answer: 3

(1) thickness of the line

(2) sharpness of the line

(3) both a and b

(4) None of the above