Strive for Excellence
Slide #1
In this PPT
1.What is a Histogram ?
2.Basic Image Types and
their Histograms
3.Histogram Equalization
4.Applications of Histogram
Equalization
Strive for Excellence
Slide #2
1. What is a Histogram ?
• The histogram of a digital image with intensity levels in the
range [0, L-1] is a discrete function
• h(rk) = nk where
• rk = the kth intensity value and
• nk = the number of pixels in an image with the intensity r k
• It is common practice to normalize a histogram by dividing
each of its components by the total number of pixels in the
image, denoted by the product MN where M and N are the
row and column dimensions of the image
• Thus, a normalized histogram is given by
• p(rk) = rk / MN
• Histogram manipulation can be used for image enhancement
Strive for Excellence
Slide #3
2. Basic Image types and their
Histograms
Figure 2.15a : A dark
image and its histogram
Figure 2.15b : A light
image and its histogram
Strive for Excellence
Slide #4
2. Basic Image types and their
Histograms Contd
Figure 2.15c : A low
contrast image and its
histogram
Figure 2.15d : A high
contrast image and its
histogram
Strive for Excellence
Slide #5
3. Histogram Equalization
• Technique to improve the contrast in images.
• It accomplishes it by stretching out the intensity range of an
image
• The objective of this technique is to give a linear trend to the
cumulative probability function associated to the image.
Figure 2.16b : Result of
Figure 2.16a : An arbitrary PDF applying the transformation to
all intensity levels
Strive for Excellence
Slide #6
3. Histogram Equalization
• Consider continuous intensity values and let r denote the
intensities of an image to be processed, with r in the range
[0,L-1]
• We consider Transformations(Intensity Mappings) of the form
s = T(r) 0 ≤ r ≤ L – 1
• that produce an output intensity level s for every pixel in the
input image having intensity r. We assume that
1. T(r) is a monotonically increasing function in the range
[0,L-1]
2. 0 ≤ T(r) ≤ L – 1 for 0≤r ≤ L–1
• We may sometimes have to use the inverse also
r = T-1 (s) for 0≤ s ≤ L–1
• In which case the 1 condition changes to
st
3. T(r) is a strictly monotonically increasing function in the
interval 0≤r ≤ L–1
Strive for Excellence
Slide #7
3. Histogram Equalization Contd
• The requirement in condition (1) that be monotonically
increasing guarantees that output intensity values will
never be less than corresponding input values, thus
preventing artifacts created by reversals of intensity.
• Condition (2) guarantees that the range of output intensities
is the same as the input.
• Finally, condition (3 ) guarantees that the mappings from s
back to r will be one-to-one, thus preventing ambiguities.
Strive for Excellence
Slide #8
Monotonically Increasing
Functions
Figure 2.16a : Figure 2.16b : Strictly
Monotonically increasing monotonically increasing
function, showing how function. This is a one-to-
multiple values can map to one mapping, both ways.
a single value.
Strive for Excellence
Slide #9
3. Histogram Equalization Contd
• The Transformation in the Continuous Domain is
• Where w is the dummy variable of integration and the
RHS of this equation is the cumulative distribution
function (CDF) of random variable r.
• The Transformation in the Discrete domain
Strive for Excellence
Slide #10
4. Histogram Equalization
Application
Figure 2.17 : Images after Histogram Equalization
Strive for Excellence
Slide #11
Histogram Equalization Application
Contd
Figure 2.18 : Images after Histogram Equalization
