B) For an image f(x,y) of size M (rows)* N (columns), if the number of discrete intensity levels L is 16,m=640, and N-712, find the size of the image in byte. Hint. 1-2 where K is the number of bitsrepresenting one pixel. If the spatial resolution of this image is 220 dot per inches( dpi) find the actual sizeof the image in inches for both height and width.

B) For an image f(x,y) of size M (rows)* N (columns), if the number of discrete intensity levels L is 16. m=640, and N-712, find the size of the image in byte. Hint. L-2k where K is the number of bits representing one pixel. If the spatial resolution of this image is 220 dot per inches( dpi) find the actual size of the image in inches for both height and width.

B) For an image f(x,y) of size M (rows)* N (columns), if the number of discrete intensity levels L is 16. m=640, and N-712, find the size of the image in byte. Hint. L-2k where K is the number of bits representing one pixel. If the spatial resolution of this image is 220 dot per inches( dpi) find the actual size of the image in inches for both height and width.

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

Answer briefly to the following questions: 1. Propose two solutions to speed up the Horn & Shunk algorithm by reducing the number of iterations. 2. Give an example of indicator of "contrast" to characterize image quality.
If you sat close enough to an old TV, you could see individual (R)ed, (G)reen and (B)lue (or RGB) “phosphors” that could represent just about any color you could imagine (using “additive color model”). When these three-color components are at their maximum values, the resulting color is white from a distance (which is amazing – look at your screen with a magnifying glass!). When all are off, the color results in black. If red and green are fully on, you’d get a shade of yellow; red and blue on would result in purple, and so on. For computers, each color component is usually represented by one byte (8 bits), and there are 256 different values (0-255) for each. To find the “inverse” of a color (like double-clicking your iFone® button), you subtract the RGB values from 255. The “luminance” (or brightness) of the color = (0.2126*R + 0.7152*G + 0.0722*B). For this program, you need to design (pseudocode) and implement (source code) a Color class that has R, G and B attributes (which can be…
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.
The pixels in a 3 x 3 image sub-block are as follows: 3 4 2 9 ? 1 3 7 3 (a) Estimate the unknown pixel in the center using both a mean and a median estimator. (b) Repeat if the pixel of value 1 is changed to 25. Are both the mean and median affected? Why or why not?
An 8-bit image has a perfectly normalized histogram. Suppose that each pixel value is ANDed with 1000 0000 , and is set to white if the result of ANDing is non-zero, otherwise is set to black if the result is zero. What is the normalized number of black pixels in the output image? Write the number with 2 decimal points in the box below.
Consider two images. One should be relatively large, like 512 x 512 pixels that contains several sparsely populated points with magnitude 255, and the other is small such as 15 x 15 that contains a non-symmetric object like, with the object white and the background black for both images. Perform both the correlation, and convolution of the two images separately and correctly label each result. Make the resulting image the same size as the larger input image.
1. Answer the following: (a) Use the projective transformation x' = x + y + z y' = x − y + z z' = x + y − z to find the images of the images of the points (0,0,1),(1,0,0),(1,0,1) and (2,0,5). (b) Compare the cross ratio of the four original points and the cross ratio of four image points in part (a).
Suppose we have a video of two white points moving toward each other at a uniform rate against a black background. We encode it via MPEG. In one I frame the two points are 100 pixels apart; in the next I frame they have merged. The final point of merger happens to lie at the center of a 16 x 16 macroblock. (a) Describe how you might optimally encode the Y component of the intervening B (or P) frames. (b) Now suppose the points are in color and that the color changes slowly as the points move. Describe what the encoding of the U and V values might look like.
If you used RLE (run-length encoding), how do you suggest we compress the following black and white image? How much space (in bits) did we save by compressing the image? What is the ratio?
The figure shown above is a binary images I in which white piİxels have values of one and black pixels have values of zero. First compute derivatives of the image intensities in the x and y directions following the numerical way to obtain Ix and Iy : Ix(i,j)= (I(i+1,j)-I(i-1,j))/2 and Iy(i,j) = (I(i,j+1)-I(i,j-1))/2. For the computation of Ix(i,j) on pixels in the first column Ix(i, j) = I(i+1,j) - I(i,j) or of Iy(i,j) on pixels in the first row Iy(i,j) = I(i,j+1) - I(i,j). For the computation of Ix(i,j) on pixels in the last column Ix(i,j) = I(i,j) - I(i-1,j) or of Iy(i,j) on pixels in the last row Iy(i,j) = I(i,j) - I(i,j-1). Calculate the response R of the Harris corner detector at each pixel based on Ix and ly, assuming (i) a value of k=0.05 in the calculation, (ii) that products of derivatives are summed over an equally weighted 3 by 3 pixel window around each pixel, (iii) that the image is padded with zeros when computing at pixels on the edge. ANSWER: R= (to 2 decimal places)
Determine the background sky brightness average counts per pixel for the star at x = 359, y=129. Give your answer to two decimal places. My answer is [x]. 16581 is absolutely wrong
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