Suppose a square image has pixels. We would like to approximately know how many pixels there are in total in a -level image pyramid consisting of the original image plus smaller images, each of which is the size. As a first approximation, let's just count all possible levels, down to a size 1x1 image.
(a) First, suppose is a power of 2 .
What is an expression for the exact count of pixels in this case, if ?
What is the exact count of pixels in this case, if ? Write the total as a binary and as a decimal number.
(b) Suppose is not a power of 2 .
Just give an upper bound for the number of pixels, assuming there are an infinite number of pyramid levels and we can use floats for numbers of pixels. What is this upper bound if ?
Hint: for the Taylor series expansion of is . What does this mean if ?
Correct Answer:
Verified
View Answer
Unlock this answer now
Get Access to more Verified Answers free of charge
Q23: Suppose that in MPEG our program detects
Q24: What is the advantage of interlaced
Q25: In many Computer Graphics applications,
Q26: Assume an analog halftoning process uses
Q27: We have spent time looking at the
Q29: State Shannon-Fano Algorithm.
(b) Complete the following table
Q30: Given the Lempel-Ziv-Welch (LZW) Decompression Algorithm,
read
Q31: In JPEG, each nonzero AC coefficient
Q32: In MPEG, what are all the different
Q33: Compare and contrast the
(a) bandwidth (i.e., bitrate),
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents