Scribd Logo
Upload

Welcome to Scribd!

  • Ex - 6

    Uploaded by

    Hafiz Faraz
    7 views10 pages
    The document discusses connected component labeling and counting pixels assigned to each label. It notes that boundary pixels do not need to be considered and the algorithm goes through the image pixel by pixel, line by line, simply counting pixels assigned to each label. It also discusses features that can be extracted from digital images like the number of corners in a shape indicated by non-zero curvature code values, with typical triangles having hundreds or thousands of pixels on the sides and only three non-zero codes at the corners.

    Original Description:

    DIS Exercise solution

    Original Title

    Ex -6

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses connected component labeling and counting pixels assigned to each label. It notes that boundary pixels do not need to be considered and the algorithm goes through the image pixel by pixel, line by line, simply counting pixels assigned to each label. It also discusses features that can be extracted from digital images like the number of corners in a shape indicated by non-zero curvature code values, with typical triangles having hundreds or thousands of pixels on the sides and only three non-zero codes at the corners.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views10 pages

    Ex - 6

    Uploaded by

    Hafiz Faraz
    The document discusses connected component labeling and counting pixels assigned to each label. It notes that boundary pixels do not need to be considered and the algorithm goes through the image pixel by pixel, line by line, simply counting pixels assigned to each label. It also discusses features that can be extracted from digital images like the number of corners in a shape indicated by non-zero curvature code values, with typical triangles having hundreds or thousands of pixels on the sides and only three non-zero codes at the corners.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 10

    0.

    5
    In the algorithm for connected component, we do not know at all (and
    need not care) about boundary pixels, so such approaches cannot be
    used!
    But we go through the image pixel by pixel, line by line.
    So we just count how many pixels get which label!
    No. Curv. code is 0 for straight (no matter
    which direction), and +1 and -1 are 45deg right
    or left etc.
    there is no -3 (135deg turn) here!

    a typical triangle in a digital image (remember.


    Millions of pixels!) has hundreds or thousands of
    pixels as the sides.
    So thousands of 0s and three non-zeroes

    say explicitly what is different! (the number of


    nonzero values, which is thenumber of corners)
    and how?

    a bit too small for realistic images.


    For 100x100 pixels, (0,0) and (1,1) are
    much much more frequent than (0,1)
    you must use the normalised GLCM!
    A moment is just one single number, not a matrix any more!
    Review the definition...

    You might also like