Histogram Equalization Algorithm

Kedir Gemechu
Department of Computer Science
Mada Walabu University
Kedirwaritu1@gmail.com

Abstract

Histogram Equalization algorithm is one of the technique most commonly used in contrast (the
difference in color or intensity between two objects in an image) enhancement. It is a technique
for adjusting image intensities to enhance contrast. The histogram equalization technique which
takes control over the effect of histogram equalization technique so that it performs the
enhancement of an image without making any loss of details in it. In this method the original
input image preserve histogram characteristics, then make histogram equalization method in the
other copy image, the output image is compiled with preserve image. so that the loss points in
output image can retrieve from input points. It come to reduce the noise in image product
process.

1. Introduction

The goal of image enhancement is to improve the image quality so that image processed is better
than the original image for a specific application or set of objectives [1]. Image enhancement is
an important area in image processing for both human and computer vision [2]. It is widely used
for medical image and as preprocessing step in speech recognition, and many other image video
processing applications. The purpose are to enhance images for human visually by improving the
interpretation of information contained in it, or also the result can be used as a high quality input
for more image processing use[3].

2. METHODS

Histogram Equalization Algorithm

Let us suppose that X = X (i, j) denotes a digital image, where X(i,j) denotes the gray level of
the pixel at (i,j) place. The total number of the image pixels is n, and the image intensity is
digitized into L levels that are {X0, X1, X2...XL−1}. L is the number of possible intensity
values, often 256.So it is obvious that ∀X(i, j) ∈ {X0, X1, X2...XL−1}. Suppose nk denotes the
total number of pixels with gray level of Xk in the image, then the probability density of Xk will
be :

p(Xk) = nk/n where k = 0, 1..., L – 1

The relationship between p(Xk) and Xk is defined as the probability density function (PDF), and
the graphical appearance of PDF is known as the histogram. Based on the images PDF, its
cumulative distribution function is defined as:

Where, k = 0, 1. . . L - 1, and it is obvious that c(XL − 1) = 1. Let us define a transform function

f(x) based on the cumulative density function as:

f(x) = X0 + (XL−1 − X0)c(x)

Then the output image of the Y = Y (i, j), can be expressed as: Y = f(x) = {f(X(i, j))∀X(i, j) ∈ X}