Given an 10 X 10 image show in Figure 2, use an appropriate technique to identify the shape of the fruitFigure 2. FruitsB1=B2=use the following structuring elementsX00X1X110110X1XX00B3=B4=000000000000000 100000 0 0 1 1 0 0 0 01000111 11 1 0 01111 0 00 1 1 11 110 00 0 1 1 1 1 0 0 000 0 1 10 0 1 10 0 1 10000000000000000000000X1X00X01101100XX1Xhere '1' represents the foreground, '0' represents the background and x represents 'don't care'

The solution for the above-given question is given below:

Given an 10 X 10 image show in Figure 2, use an appropriate technique to identify the shape of the fruit Figure 2. Fruits B1= B2= use the following structuring elements X 0 0 X 1 X 1 1 0 1 1 0 X 1 X X 0 0 B3= B4= oooooooooo 000 0 0 10000 0 0 0 0 1 1 0 0 0 0 0011 1 11000 0011 1 11100 0011 1 1 1 100 0011 1 11100 0001 111000 0000 000000 0 000 0 0 0 0 0 0 X 1 X 0 0 X 0 1 1 0 1 1 0 0 X X 1 X here '1' represents the foreground, '0' represents the background and x represents 'don't care'

Given an 10 X 10 image show in Figure 2, use an appropriate technique to identify the shape of the fruit Figure 2. Fruits B1= B2= use the following structuring elements X 0 0 X 1 X 1 1 0 1 1 0 X 1 X X 0 0 B3= B4= oooooooooo 000 0 0 10000 0 0 0 0 1 1 0 0 0 0 0011 1 11000 0011 1 11100 0011 1 1 1 100 0011 1 11100 0001 111000 0000 000000 0 000 0 0 0 0 0 0 X 1 X 0 0 X 0 1 1 0 1 1 0 0 X X 1 X here '1' represents the foreground, '0' represents the background and x represents 'don't care'

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider the following 8-bit greyscale image: 12 12 12 59 179 254 254 254 12 12 12 59 179 254 254 254 12 12 12 59 179 254 254 254 12 12 12 59 179 254 254 254 Compress the image using Huffman coding. Hint: construct the Huffman table and encode the image scanlines using the table entries.
Observe the following image matrix. Note that this is 4-bits grayscale image. Identify the following items: 11 10 12 13 10 11 15 15 15 11 15 12 10 10 12 12 10 13 11 15 15 12 12 10 11 12 11 15 11 15 14 12 10 14 11 12 10 11 10 11 12 11 10 12 14 13 10 10 11 11 11 11 12 12 14 14 11 11 11 11 14 14 13 13 14 13 11 11 10 13 15 15 11 13 12 15 14 10 12 11 10 14 14 14 11 11 11 11 15 15 11 11 11 15 11 11 11 15 (a) Intensity Level Resolution bits/pixel (b) Spatial Resolution pixel (c) Memory size required to store the image bits (d) Memory size of colour image (RGB) with the similar specification as the mentioned grayscale image bits 5N2N 45
For the following 5x5 image f(x,y) with 3 bits per pixel, compute the histogram of f(x,y)f(x,y) = 0 0 1 1 2 0 1 1 2 4 1 1 2 4 5 1 3 4 5 6 3 3 5 6 7
Q3: Apply the Mean-Filter to the following image 3 1 10 14 7 13 7 7 mO77 27744 159 66
13) What does a NOT operation do to the appearance of an image? Perform the NOT operation to this random gray-level image: -150 105 145 75 80 45 50 67 80 130 123 40 37 20 250 23 65 95 220 22 L200 150 255 110 145¹
5. Consider the following 8x8 image: F5= 242 43 193 38 89 20 158 172 189 239 91193 127 155 178 55 2268 141 223 65 138 70 60 152 224 226 128 130218 1072 175 133 214 145 20 163 93 185 99 206 62 217 14 69 20 143 56 114 111 251 161 27 17 140 33 88 211 201 157 15 30 189 Threshold it at level = 109. What happens to the results of thresholding as the threshold level is increased?
For the given 4x4 RGB image below, apply uniform quantization algorithm and find the reduced 64-color palette image. (Hint: divide each color space into 8 regions.) 38,49,35 26,34,19 70,80,72 58,67,50 63,70,54 76,85,82 40,46,44 45,52,45 46,51,47 40,45,38 58,65,49 23,28,8 111,111,99 78,79,63 80,80,56 30,29,1
The histogram of a 128x128 gray-level image of a black-and-white square chessboard on a gray background is given as H = [141 1597 2292 1064 0 278 2996 15748 3028 314 0 400 1220 2480 !! 1210] Given further that that actual size of the chessboard is 32x32cm. Based the histogram information, what is the pixel spacing (resolution) in mm/pixel? O 3.14 O 4.48 O 2.14 O 4.39 O 1.25 nechoand on a grav
Apply histogram stretching to the shqwn image to cover the full contrast [0 - 255]. 40 200 20 200 40 20 200
Encode the following 8-bit 6*6 image using Huffman coding .the histogram of the image mentioned below.
8- 1 2 3 Gaussian Kernel 12 22 15 14 20 1 12 17 22 1 24 0.0275 0.1102 0.0275 13 33 24 27 24 0.1102 0.4421 0.1102 14 16 30 33 23 0.0275 0.1102 0.0275 16 12 39 43 22 5 17 12 34 34 12 If you apply Gaussian Smoothing Filter to the above image, what are the approximate values for the following pixels: IMG(2,1) IMG(3,2) IMG(3,3) Hint: pixles oreder is IMG(y,x) a) O 29 - 33 - 31 b) 24 29 - 31 O 24 - 31 29 - d) O 21 - 22 - 31 O Boş bırak 4- 2. 3. 4-
Compute the output image after applying the input image with the given sharpening filter in producing the smoothing operation (assume intensity Level resolution = 8 bits/px) Input image, f(x.y) 10 10 10 10 10 10 Sharpening filter, w(x.y) 10 10 11 12 100 10 -1 -1 -1 10 12 14 101 102 10 -1 9 -1 10 15 111 110 | 100 | 10 -1 -1 -1 10 10 10 10 | 10 10 ANSWER : Output image, g(x.y) 0|000 0 0 000 0 0