TUTORIAL - I

Problem 1. A common measure of transmission for digital data is the baud rate, defined as the
number of bits transmitted per second. Generally, transmission is accomplished in packets
consisting of a start bit, a byte (8 bits) of information, and a stop bit. Using these facts, answer
the following:

(a) How many minutes would it take to transmit a 1024 X 1024 image with 256 gray levels
using a 56K baud modem?
(b) What would the time be at 750K baud, a representative speed of a phone DSL (digital
subscriber line) connection?

Solution:

(a) The total amount of data (including the start and stop bit) in an 8bit, 1024 X 1024 image,
is (1024)2 X [8 + 2] bits. The total time required to transmit this image over a At 56K baud
link is (1024)2 X [8 + 2]=56000 = 187:25 sec or about 3.1 min.

(c) At 750K this time goes down to about 14 sec.

Problem 2. Find the shortest 4-, 8-, m-path between p and q for V= {0, 1} and V={1, 2}.

Solution:

(a) When V = {0, 1}, 4-path does not exist between p and q because it is impossible to get from p
to q by traveling along points that are both 4adjacent and also have values from V. Figure
P2.15(a) shows this condition it is not possible to get to q. The shortest 8-path is shown in Fig.
P2.15(b); its length is 4. In this case the length of shortest m- and 8-paths is the same. Both of
these shortest paths are unique in this case. (b) One possibility for the shortest 4-path when V =
{1, 2} is shown in Fig. P2.15(c); its length is 6. It is easily verified that another 4-path of the
same length exists between p and q. One possibility for the shortest 8-path (it is not unique) is
shown in Fig. P2.15(d); its length is 4. The length of a shortest m-path similarly is 4.

Problem 3:

We will deal with operators whose function is to compute the sum of pixel values in a
small subimage area, S. Show that these are linear operators.

Solution:

With reference to Eq. (2.61), let H denote the neighborhood sum operator, let S1 and S2 denote
two different small subimage areas of the same size, and let S1+S2 denote the corresponding
pixel-by-pixel sum of the elements in S1 and S2, as explained in Section 2.5.4. Note that the size
of the neighborhood (i.e., number of pixels) is not changed by this pixel-by-pixel sum. The
operator H computes the sum of pixel values is a given neighborhood. Then, H(aS1 + bS2)
means: (1) multiplying the pixels in each of the subimage areas by the constants shown, (2)
adding the pixel-by-pixel values fromS1 and S2 (which produces a single subimage area), and
(3) computing the sum of the values of all the pixels in that single subimage area. Let ap1 and
bp2 denote two arbitrary (but corresponding) pixels from aS1 + bS2. Then we can write
which, according to Eq. (2.61), indicates that H is a linear operator.
Problem 4: Suppose if we consider 512 X 512 color images, how many number of bits used in
this image?

Solution:

No. of bits used in this image => 512 X 512 X 3

= 786, 432 bytes = 786.43 Kb = 0.786 Mb

Problem5: When you enter a dark theater on a bright day, it takes an appreciable interval of time
before you can see well enough to find an empty seat. Which of the visual processes explained is
at play in this situation?

Solution:

Rod – Dim light Vision (No color)

Problem6:Let (S) be the size of the object at a distance (d) from the eye and (x) the size of the
projection on the retina. The focal length (L) of the object is about 17 mm; Assume that an object
15 m high at 100 m away. Find out the retinal projection (x) and visual angle (A).
Solution:

x 15
15m =
17 100
17
100
x
Size of the projection on the retina X:
X = (L * S/d) where S -> size of the object & d -> distance from the object
 X = 2.55 mm
Visual Angle A:
A = tan-1(S/d) degrees
 A = 8.5 degree