Scribd
Upload
44 views1 page

Image Processing 38 Page-38

Uploaded by

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

Image Processing 38 Page-38

Uploaded by

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

IP: Page 38 of 38

NUMERICAL
49. A grayscale image has pixel values ranging from 0 to 255. Apply a contrast stretching
transformation with the following parameters: r1 = 50, s1 = 0, and r2 = 200, s2 = 255.
Find the output pixel value s for an input pixel value r = 100.
50. Consider a grayscale image with the following histogram values for 4 gray levels: h(0) =
10, h(1) = 30, h(2) = 40, h(3) = 20. Compute the equalized histogram values.
51. Given a 3x3 averaging filter, apply it to the following 3x3 image and Compute the
filtered value at the center pixel.
50 80 90
60 100 80
70 90 110
52. Apply a 3x3 Laplacian filter to the following 3x3 image and Calculate the output at the
center pixel.
10 20 30
20 40 60
30 60 90
Laplacian matrix =
0 -1 0
-1 4 -1
0 -1 0
53. A 2D image of size 256x256 is filtered using a Gaussian low-pass filter with a cutoff
frequency D0 = 50. What is the value of the filter at distance D(u,v) = 25?
54. For an ideal low-pass filter with cutoff D0 = 50, determine whether a point with D(u,v)
= 60 is passed or blocked.
55. Calculate the Butterworth filter response H(u,v) for D0 = 50, D(u,v) = 30, and filter
order n = 2.
56. If a high-pass filter in the frequency domain is designed with a Gaussian filter with D0 =
20, find the filter value at D(u,v) = 10.
57. Compute the Laplacian filter in the frequency domain for an image of size 256 x 256
with u = 50 and v = 50.
58. Calculate the Euclidean distance between two pixels (x1, y1) = (2, 3) and (x2, y2) = (5,
7).
59. A 4-connected neighborhood is used for connectivity analysis in a binary image.
Consider a binary image with the following pixel values (0 = background, 1 = object):
0100
1110
0101
0011
How many connected components are present in this image?

You might also like