Histogram Processing: Enhancement Through Histogram Manipulation
Histogram Processing: Enhancement Through Histogram Manipulation
Histogram Equalization
is an automatic enhancement technique which produces an output
(enhanced) image that has a near uniformly distributed histogram.
For continuous functions, the intensity (gray level) in an image
may be viewed as a random variable with its probability density function
(PDF). The PDF at a gray level r represents the expected proportion
(likelihood) of occurrence of gray level r in the image. A transformation
function has the form
Page 1
Image Processing
s = T(r) = (L - 1) J Pr(w) dw
L L
k k
sk = T(rk) = (L - 1) Pr(1}) = (L - 1) M� N
j=O j=O
k
= (L- l)�n- k = 0, 1 , 2 , ... , L - 1
Mx NL 1
j=O
The right side of this equation is known as the cumulative histogram for
the input image. This transformation is called histogram equalization or
histogram linearization.
Because a histogram is an approximation to a continuous PDF, perfectly
flat histograms are rare in applications of histogram equalization. Thus,
the histogram equalization results in a near uniform histogram. It spreads
the histogram of the input image so that the gray levels of the equalized
(enhanced) image span a wider range of the gray scale. The net result is
contrast enhancement.
Page 2
Image Processing
Example:
Suppose that a 3-bit image (L =8) of size 64 x 64 pixels has the gray
level (intensity) distribution shown in the table below.
rk nk
ro =0 790
r1 =1 1023
r2= 2 850
r1 =3 656
r4= 4 329
r5 =5 245
r6 6
=
122
r 7 =7 81
Solution:
M x N =4096
We compute the normalized histogram:
rk nk Pr (rk ) = n k /MN
ro= 0 790 0.19
r1 =1 1023 0.25
r2 =2 850 0.21
r3 =3 656 0.16
r4 =4 329 0.08
r5 =5 245 0.06
r6 6 =
122 0.03
r7 =7 81 0.02
Page 3
Image Processing
.25
•
. 20
. 15 : .
.IO
.05 •
0 2 3 4 5 6 7
Normalized histogram
sk = T(rk) = (L - 1) _L Pr(71)
j=O
S1 = T(r1 ) = 7 _L P ( ) = 7pr(r
r 7i 0) + 7p r (r1 ) = 3.08
J=O
7.0 · - · --- ·
.'i.6
4.2
2.8
1.4
0 1 2 3 4 .'i 6 7
Transformation function
We round the values of s to the nearest integer:
So = 1.33 ➔ 1 S1 = 3.08 ➔ 3 Sz = 4.55 ➔ 5
S3 = 5.67 ➔ 6 S4 = 6.23 ➔ 6 S5 = 6.65 ➔ 7
s6 = 6.86 ➔ 7 S7 = 7.00 ➔ 7
Page 4
Image Processing
These are the values of the equalized histogram. Note that there are only
five gray levels.
P.,(sk)
.25 • •'
. 20 • ''
•''
'
.15
'
.Hl
'
.05
sk
2 3 4 5 6 7
Histogram of equalized image
Page 5
Image Processing
Figure 1 Left column original images. Center column corresponding histogram equalized
images. Right column histograms of the images in the center column.
Page 6
Image Processing
Although all the histograms of the equalized images are different, these
images themselves are visually very similar. This is because the
difference between the original images is simply one of contrast, not of
content.
However, in some cases histogram equalization does not lead to a
successful result as shown below.
◄
X 10
250
Page 7
Image Processing
We clearly see that histogram equalization did not produce a good result
in this case. We see that the intensity levels have been shifted to the upper
one-half of the gray scale, thus giving the image a washed-out
appearance. The cause of the shift is the large concentration of dark
components at or near O in the original histogram. In tum, the cumulative
transformation function obtained from this histogram is steep, as shown
in the fi gu re below, thus mapping the large concentration of pixels in the
low end of the gray scale to the high end of the scale.
255
.!!l 192
� 128
';:i
';:i 64
0
In other cases, HE may introduce noise and other undesired effect to the
output images as shown in the fi gu re below.
Page 8
Image Processing
Page 9
Image Processing
k
= (L- l)�n-
k = 0, 1, 2 , ... , L - 1
M x N Li 1
j=O
Then round the resulting values, sk, to the integer range [O, L-1].
2. Compute the specified histogram Pz (z) ofthe given image, and use
it find the transformation function G using
Then round the values of G to integers in the range [O, L-1]. Store
the values of G in a table.
3. Perform inverse mapping. For every value of sk , use the stored
values of G from step 2 to find the corresponding value of Zq so
that G(zq ) is closest to sk and store these mappings from s to z.
When more than one value of Zq satisfies the given sk (i.e. the
mapping is not unique), choose the smallest value.
4. Form the output image by first histogram-equalizing the input
image and then mapping every equalized pixel value, sk , ofthis
image to the corresponding value Zq in the histogram-specified
image using the inverse mappings in step 3.
Page 10
Image Processing
Example:
Suppose the 3-bit image of size 64 x 64 pixels with the gray level
distribution shown in the table, and the specified histogram below.
rk nk Pt ( Zq)
r0 = 0 790 .30 !
:
r1 = 1 1023 .25
r2 =2 850 .20 • •
r3 =3 656 .15 • ' •
r4 =4 329 .10 ;
r5 = 5 245 .05
r6= 6 122 Zq
I 2 3 ➔ 5 6 7
r 1= 7 81
Solution:
Step 1:
M x N =4096
We compute the normalized histogram:
rk nk Pr(rk ) = nk /MN
ro= O 790 0.19
r1 =1 1023 0.25
r2 2
=
850 0.21
r3 =3 656 0.16
r4 =4 329 0.08
r5 = 5 245 0.06
r6= 6 122 0.03
r 7 =7 81 0.02
Page 11
Image Processing
.25
•
. 20
. 15 : .
.IO
.05 •
: • ,-k
0 3 4 5 6 7
Normalized histogram
_L Pr(1j')
k
sk = T(rk) = (L - l)
j=O
Step 2:
We compute the values of the transformation G
Page 12
Image Processing
L
0
G(z0 ) =7 p2 (zJ =0
i=O
L
1
Step 3:
We find the corresponding value of Zq so that the value G(zq ) is the
closest to sk
Sk Zq
1 �
� 3
3 4
::
5 5
6 :: 6
7 7
Page 13
Image Processing
Step 4:
rk nk Sk Newn k ps (sk ) = New nk /MN
ro = 0 790 So =
3 790 0.19
r1 = 1 1023 SJ = 4 1023 0.25
r2 = 2 850 S2
=5 850 0.21
r3 = 3 656 S3 = 6 985 0.24
r4 =
4 329 S4 = 6
r5 =5 245 S5 = 7 448 0.11
r6 = 6 122 s6 = 7
r7 = 7 81 S7 = 7
.25 • •
•
'
.20
I
'
.15
. 10
.05
Zq
() 1 2 3 4 5 6 7
Page 14
Image Processing
Page 15