Scribd Logo
Upload

Welcome to Scribd!

  • 294 views

    DIP

    Uploaded by

    MAHEEN
    The document discusses intensity transformations and histogram equalization techniques for digital images. It asks the reader to provide a single intensity transformation function that scales image intensities from the lowest value of 0 to the highest value of L-1. It also asks the reader to explain why discrete histogram equalization does not always yield a flat histogram and to show that applying histogram equalization twice to an image produces the same result as applying it once. Finally, it asks the reader to find an intensity transformation that matches one probability density function to another assuming continuous quantities and to propose a method for updating local histograms between neighborhoods rather than recomputing them.

    Copyright:

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

    DIP

    Uploaded by

    MAHEEN
    294 views12 pages
    The document discusses intensity transformations and histogram equalization techniques for digital images. It asks the reader to provide a single intensity transformation function that scales image intensities from the lowest value of 0 to the highest value of L-1. It also asks the reader to explain why discrete histogram equalization does not always yield a flat histogram and to show that applying histogram equalization twice to an image produces the same result as applying it once. Finally, it asks the reader to find an intensity transformation that matches one probability density function to another assuming continuous quantities and to propose a method for updating local histograms between neighborhoods rather than recomputing them.

    Original Description:

    A B C.

    Original Title

    DIP.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses intensity transformations and histogram equalization techniques for digital images. It asks the reader to provide a single intensity transformation function that scales image intensities from the lowest value of 0 to the highest value of L-1. It also asks the reader to explain why discrete histogram equalization does not always yield a flat histogram and to show that applying histogram equalization twice to an image produces the same result as applying it once. Finally, it asks the reader to find an intensity transformation that matches one probability density function to another assuming continuous quantities and to propose a method for updating local histograms between neighborhoods rather than recomputing them.

    Copyright:

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

    DIP

    Uploaded by

    MAHEEN
    The document discusses intensity transformations and histogram equalization techniques for digital images. It asks the reader to provide a single intensity transformation function that scales image intensities from the lowest value of 0 to the highest value of L-1. It also asks the reader to explain why discrete histogram equalization does not always yield a flat histogram and to show that applying histogram equalization twice to an image produces the same result as applying it once. Finally, it asks the reader to find an intensity transformation that matches one probability density function to another assuming continuous quantities and to propose a method for updating local histograms between neighborhoods rather than recomputing them.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 12

    3.

    1 Give a single intensity transformation function for spreading the intensities


    of an image so the lowest intensity is 0 and the highest is L−1.

    3.6 Explain why the discrete histogram equalization technique does not yield a
    flat histogram in general.

    3.7 Suppose that a digital image is subjected to histogram equalization. Show


    that a second pass of histogram equalization (on the histogram-equalized
    image) will produce exactly the same result as the first pass.
    3.12 An image with intensities in the range [0,1] has the PDF, pr r( ), shown in
    the following figure. It is desired to transform the intensity levels of this image
    so that they will have the specified pz z() shown in the figure. Assume continuous
    quantities, and find the transformation (expressed in terms of r and z) that will
    accomplish this.
    3.14 * The local histogram processing method discussed in Section 3.3 requires
    that a histogram be computed at each neighborhood location. Propose a method
    for updating the histogram from one neighborhood to the next, rather than
    computing a new histogram each time.

    You might also like