Scribd Logo
Upload

Welcome to Scribd!

  • 52 views

    Homework #1: Spring 2014 Csce 763: Digital Image Processing

    Uploaded by

    Ngọc Ánh
    This document contains the details of Homework #1 for a digital image processing course. It includes 4 problems: 1. Estimating the smallest printed dot the eye can discern based on assumptions about visual system parameters. 2. Determining whether two image subsets are 4-adjacent, 8-adjacent, or m-adjacent based on their pixel values and positions. 3. Computing the shortest path lengths between two pixels for 4-, 8-, and m-paths under different conditions. 4. Expressing the shaded regions in three figures in terms of set operations using sets A, B, and C.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Homework #1: Spring 2014 Csce 763: Digital Image Processing

    Uploaded by

    Ngọc Ánh
    52 views4 pages
    This document contains the details of Homework #1 for a digital image processing course. It includes 4 problems: 1. Estimating the smallest printed dot the eye can discern based on assumptions about visual system parameters. 2. Determining whether two image subsets are 4-adjacent, 8-adjacent, or m-adjacent based on their pixel values and positions. 3. Computing the shortest path lengths between two pixels for 4-, 8-, and m-paths under different conditions. 4. Expressing the shaded regions in three figures in terms of set operations using sets A, B, and C.

    Original Title

    Homework_1_Solution_on_Digital_Image_Processing

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains the details of Homework #1 for a digital image processing course. It includes 4 problems: 1. Estimating the smallest printed dot the eye can discern based on assumptions about visual system parameters. 2. Determining whether two image subsets are 4-adjacent, 8-adjacent, or m-adjacent based on their pixel values and positions. 3. Computing the shortest path lengths between two pixels for 4-, 8-, and m-paths under different conditions. 4. Expressing the shaded regions in three figures in terms of set operations using sets A, B, and C.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    52 views4 pages

    Homework #1: Spring 2014 Csce 763: Digital Image Processing

    Uploaded by

    Ngọc Ánh
    This document contains the details of Homework #1 for a digital image processing course. It includes 4 problems: 1. Estimating the smallest printed dot the eye can discern based on assumptions about visual system parameters. 2. Determining whether two image subsets are 4-adjacent, 8-adjacent, or m-adjacent based on their pixel values and positions. 3. Computing the shortest path lengths between two pixels for 4-, 8-, and m-paths under different conditions. 4. Expressing the shaded regions in three figures in terms of set operations using sets A, B, and C.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 4

    Spring 2014 CSCE 763: DIGITAL IMAGE PROCESSING

    Homework #1
    Due time: Wednesday, Jan 29th, before class starts

    1. Thinking purely in geometric terms, estimate the diameter of the smallest printed dot that the eye
    can discern if the page on which the dot is printed is 0.4 m away from the eyes. (25pts)
    Assume for simplicity that
    a. the distance between the center of the lens and the retina along the visual axis is 14mm;
    b. the visual system ceases to detect the dot when the image of the dot on the fovea becomes
    smaller than the diameter of one receptor (cone) in that area of the retina; and
    c. the fovea can be modeled as a square array of dimensions 1.5 mm*1.5 mm, and that the cones
    (about 337,000 in total) and spaces between the cones are distributed uniformly throughout
    this array.
    Solution:

    Figure 1

    The diameter, x, of the retinal image corresponding to the dot is obtained from similar
    triangles, as shown in below. That is,
    𝑑 𝑥
    =
    0.4 0.014
    which gives x = 0.035d . From the discussion in Section 2.1.1, we can think of the fovea as a
    square sensor array having on the order of 337,000 elements, which translates into an array of
    size 580 ×580 elements. Assuming equal spacing between elements, this gives 580 elements
    and 579 spaces on a line 1.5 mm long. The size of each element and each space is then s =
    [(1.5mm)/1,159] = 1.3×10−6 m. If the size (on the fovea) of the imaged dot is less than the
    size of a single resolution element, we assume that the dot will be invisible to the eye. In
    other words, the eye will not detect a dot if its diameter, d , is such that 0.035(d ) <1.3×10−6
    m, or d < 37.14×10−6 m.
    2. Consider the two image subsets, S1 and S2, shown in the following figure. For V={1}, determine
    whether these two subsets are (a) 4-adjacent, (b) 8-adjacent, or (c) m-adjacent. (25pts)

    Solution:

    Let p and q be the two pixels in S1 and S2, as shown below. Then, (a) S1 and S2 are not 4-
    connected because q is not in the set N4(p); (b) S1 and S2 are 8-connected because q is in the set
    N8(p); (c) S1 and S2 are m-connected because (i) q is in ND(p), and (ii) the set N4(p) ∩ N4(q) is
    empty.
    3. Consider the image segment shown below. (25pts)
    (a) Let V={0, 1} and compute the lengths of the shortest 4-, 8-, and m-path between p and q. If a
    particular path does not exist between these two points, explain why.
    (b) Repeat for V={1, 2}.

    (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 4-adjacent and also have values from V . The shortest 8-paths are
    shown in Figure a, with length 4. The length of the unique shortest m- path (shown in Figure b) is 4.

    (a) (b)

    (b) The unique shortest 4-pathwhen V ={1,2} is shown in Figure c; its length is 6.
    The unique shortest 8-path is shown in Figure d; its length is 4. The length of the unique shortest m-
    path (shown in Figure e) is 5.

    c d e
    4. Give expressions for the sets shown shaded in the following figure in terms of sets A, B, and C.
    The shaded areas in each figure constitute one set, so give one expression for each of the three
    figures. (25pts)

    Solution:
    The answers are, from left to right,
    𝐴⋂𝐵⋂𝐶 (1)
    (𝐴⋂𝐶) ∪ (𝐴⋂𝐵) ∪ (𝐵⋂𝐶) (2)
    [(𝐵 − 𝐴) − 𝐶] ∪ [(𝐴⋂𝐶) − (𝐴⋂𝐵⋂𝐶)] (3)
    𝑐
    𝑜𝑟 [𝐵⋂(𝐴 ∪ 𝐶) ] ∪ [𝐴⋂(𝐶 − 𝐵)] (3)
    𝑜𝑟 �𝐵 − (𝐴 ∪ 𝐶) � ∪ [(𝐴⋂𝐶) − (𝐴⋂𝐵⋂𝐶)] (3)

    You might also like