Scribd
Upload
8 views2 pages

AID 324 Image Processing ProbSet#2

The document outlines a problem set for an image processing course, focusing on various aspects of monitor resolutions, pixel access times, refresh rates, and Huffman coding for gray-scale images. It includes specific questions related to 4k Ultra HDTV and WQXGA monitors, as well as exercises involving indexed gray-scale images. The problems require calculations and comparisons of resolutions, bitrates, and coding efficiencies.

Uploaded by

elmoo2ndtyb
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
8 views2 pages

AID 324 Image Processing ProbSet#2

The document outlines a problem set for an image processing course, focusing on various aspects of monitor resolutions, pixel access times, refresh rates, and Huffman coding for gray-scale images. It includes specific questions related to 4k Ultra HDTV and WQXGA monitors, as well as exercises involving indexed gray-scale images. The problems require calculations and comparisons of resolutions, bitrates, and coding efficiencies.

Uploaded by

elmoo2ndtyb
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/ 2

AID 324 Image Processing

Problems set #1

1. The 4k Ultra HDTV monitor has a resolution of 3840x2160 pixels. It offers a higher pixel density and
a sharper image quality than the WQXGA that has a resolution of 2560x1600 pixels.

a) What does 3840x2160 mean on a monitor?


b) How many times the pixels of the 4k UHDTV monitor compared to the Full HDTV 1920x1080
pixels monitor?
c) Compare between the aspect ratios of the Ultra HD and WQXGA monitors.
d) If the graphics controller refreshes the screen at a rate of 120 frame/s, compute the pixel
access time for both Ultra HD and WQXGA monitors.
e) If the graphics controller refreshes the screen at a rate of 60 frame/s, how long would it take
to load the frame buffer for the Ultra HD and WQXGA monitors?
f) If the graphics controller refreshes the screen at a rate of 60 frame/s, how many pixels could
be accessed per second for Ultra HD monitor?
g) Estimate the access times per pixel and per row, assuming row-wise scanning for each
monitor, if the graphics controller refreshes the screen at a rate of 60 frame/s for the Ultra HD
and WQXGA monitors.
h) For the maximum distinct colors to be displayed at any one time, what is the least required
color resolution?
i) What is the refresh rate of the Ultra HD frame buffer if it can access 64 pixels in a group
simultaneously in an access time of 20 ns ?
j) What is the refresh rate of the WQXGA frame buffer if it can access 32 pixels in a group
simultaneously in an access time of 50 ns ?

2. Repeat Problem 1 for a Full HDTV 1920x1080 pixels modern monitor.


3. Given the following indexed gray-scale image

g=[2 0 0 0 1; 0 0 1 0 2; 0 0 1 1 1;3 3 2 2 1 ; 1 2 0 0 1]
a) What is the spatial resolution of this image?
b) What is the color resolution of the image?
c) What is the total size of the uncompressed image bitstream?
d) Compute the Entropy of this digital image (as the optimal bit-rate of its lossless
representation.
e) Sketch the Huffman tree and find the corresponding Huffman codebook of the image.
f) What is the total size of the losslessly compressed bitstream of the Huffman coded
image?
g) Compute the corresponding Huffman coding bitrate.
h) Estimate the obtained Huffman coding compression ratio.
i) How many unique Huffman codebooks can be obtained by shuffling the 0-1 branches
assignments of the current Huffman tree?
j) List all possible Huffman codebooks.
k) Suggest a useful application of having multiple Huffman codebooks.
l) Discuss the advantages and limitations of your suggestion of Part k.
m) What is the worst obtained Huffman bit rate for the same gray-scale of the given image?
Explain in details when it could happen.
n) What is the main practical difficulty associated with Huffman coding hardware
implementation?

4. Repeat Problem 3 considering the following indexed gray-scale image:


g = [ 0 0 0 0 0 2 2 2
0 0 0 0 0 3 3 3
3 3 0 0 6 6 6 6
6 6 6 6 5 5 5 5
6 5 0 0 0 0 0 4
6 5 4 4 7 7 7 7
6 5 4 4 4 7 7 7
6 6 6 6 6 6 7 7 ]

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy