Digital Image Processing Questions and Answers – Zooming and Shrinking Digital Images

This set of Digital Image Processing Multiple Choice Questions & Answers (MCQs) focuses on “Zooming and Shrinking Digital Images”.

1. In terms of Sampling and Quantization, Zooming and Shrinking may be viewed as ___________
a) Oversampling for both
b) Oversampling and Undersampling respectively
c) Undersampling and Oversampling respectively
d) Undersampling for both
View Answer

Answer: b
Explanation: Oversampling increases the number of sample in the image, i.e. like Zooming.
Undersampling decreases the number of samples in the image, i.e. like Shrinking.

2. The two steps: one is the creation of new pixel locations, and other is the assignment of gray levels to those new locations are involved in ____________
a) Shrinking
b) Zooming
c) All of the mentioned
d) None of the mentioned
View Answer

Answer: b
Explanation: Suppose that we have an image of size500*500pixels and we want to enlarge it 1.5 times to 750*750pixels.
Creation of new Pixels: One of the easiest ways to visualize zooming is laying an imaginary 750*750 grid over the original image and so there would be less spacing by one pixel in the grid because we are fitting it over a smaller image.
Assignment of gray levels to new locations: In order to perform gray-level assignment for any point in the overlay, we assign its gray level to the new pixel in the grid its closest pixel in the original image.
When the above steps are done with all points in the overlay grid, we expand it to the original specified size to obtain the zoomed image.

3. While Zooming, In order to perform gray-level assignment for any point in the overlay, we assign its gray level to the new pixel in the grid its closest pixel in the original image. What’s this method of gray-level assignment called?
a) Neighbor Duplication
b) Duplication
c) Nearest neighbor Interpolation
d) None of the mentioned
View Answer

Answer: c
Explanation: Because we look for the closest pixel in the original image and assign its gray level to the new pixel in the grid.
advertisement
advertisement

4. A special case of nearest neighbor Interpolation that just duplicates the pixels the number of times to achieve the desired size, is known as ___________
a) Bilinear Interpolation
b) Contouring
c) Ridging
d) Pixel Replication
View Answer

Answer: d
Explanation: A special case of nearest neighbor interpolation is Pixel replication and is applicable when we want to increase the size of an image an integer number of times.
For example, doubling the size of an image is achieved duplicating each column and hence image size gets doubled in the horizontal direction. Then, we duplicate each row of the enlarged image to double the size in the vertical direction. Similarly, enlarging the image by any integer number of times (triple, quadruple, and so on) is possible.

5. Nearest neighbor Interpolation has an undesirable feature, that is _________
a) Aliasing effect
b) False contouring effect
c) Ridging effect
d) Checkerboard effect
View Answer

Answer: d
Explanation: At greater magnification nearest neighbor Interpolation has the undesirable feature that it produces a checkerboard effect.
Note: Join free Sanfoundry classes at Telegram or Youtube

6. What does the bilinear Interpolation do for gray-level assignment?
a) Assign gray level to the new pixel using its right neighbor
b) Assign gray level to the new pixel using its left neighbor
c) Assign gray level to the new pixel using its four nearest neighbors
d) Assign gray level to the new pixel using its eight nearest neighbors
View Answer

Answer: c
Explanation: Bilinear interpolation uses the four nearest neighbors of the new pixel. Let (x’, y’) is the coordinates of a point in the zoomed image and the gray level assigned to the point is v(x, y’).
For bilinear interpolation, the assigned gray level is given by
v(x’, y’) = ax’ + by’ + cx’y’ + d
Here, a, b, c and d are determined from the four equations in four unknowns that can be written using the four nearest neighbors of point (x’, y’).

7. Row-column deletion method of Image Shrinking is an equivalent process to which method of Zooming?
a) Bilinear Interpolation
b) Contouring
c) Pixel Replication
d) There is no such equivalent process
View Answer

Answer: c
Explanation: Row-column deletion method is used to shrink an image by one-half, one-fourth and so on.
In case of one-half we delete every other row and column.
advertisement

8. Image Shrinking has an undesirable feature, that is ____________
a) Aliasing effect
b) False contouring effect
c) Ridging effect
d) Checkerboard effect
View Answer

Answer: a
Explanation: Although Image Shrinking uses the grid analogy of nearest neighbor interpolation, but that we now expand the grid to fit over the original image, do gray-level nearest neighbor or bilinear interpolation, causing the possible aliasing effect, and then shrink the grid back to its original specified size.

9. 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
View Answer

Answer: a
Explanation: For case 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.
advertisement

Sanfoundry Global Education & Learning Series – Digital Image Processing.

To practice all areas of Digital Image Processing, here is complete set of 1000+ Multiple Choice Questions and Answers.

If you find a mistake in question / option / answer, kindly take a screenshot and email to [email protected]

advertisement
advertisement
Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.