WELCOME

What is an image?
A representation of the external form of a person or thing in art,
the general impression that a person, organization, or product.

What is matrix representation of an image?

An image can be represented in form of a matrix by the
help of the grey values of various colours ranging from 0 to
255, and with those grey values a matrix can be generated
according to the positioning of various colours present in
that image.
What is image Enhancement?

Image enhancement is the procedure of improving the

quality and the information content of original data before
processing. The common practices include contrast
enhancement, spatial filtering, density slicing and FCC.
Contrast enhancement or stretching is performed by linear
transformation expanding the original range of gray level.
Spatial filtering improves the naturally occurring linear
features like fault, shear zones and lineaments. Density
slicing converts the continuous gray tone range into a
series of density intervals marked by separate color or
symbol to represent different features.
 Histogram
A histogram is an accurate representation of the distribution of
numerical data. It is an estimate of the probability distribution of
a continuous variable (CORAL ) and was first introduced by Karl
Pearson.

In case of Digital Image Processing Histogram analysis is done

with the grey values of each of the pixels plotted on X-axis and
the occurrence of those pixels plotted on Y-axis.
Conventional way of Histogram Equalization
in Digital Image Processing:
Proposed method of Histogram Equalization:
PICK THE
LOAD GET THE SMALLEST
START IMAGE
IMAGE
MATRIX GREY
VALUE(SI)
FOR EACH
ROW
SUBTRACT (SI)
CALCULATE LOAD THE WITH EACH
CALCULATE THE NEW ELEMENTS OF ITS
CUMULATIVE OCCURRENC MATRIX (M) CORRESPONDING
SUM FOR EACH E OF EACH ROWS
PIXELOF M PIXEL IN M
MULTIPLY
EACH OF
CLACULATE PICK THE THE CDF REPLACE THE
CDF HIGHEST GREY VALUES
WITH H
GREY WITH THE
VALUE(H) AND GREY VALUES
PRESENT IN M ROUND PRESENT IN M
OFF THE
RESULTS GET THE
SHOW
HISTOGRAM
STOP GRAPHICAL
EQUILIZED
RESULT
IMAGE
Algorithm:
 Examples:
A = [[0 1 5 1 7 2 0 3] Aʹ = [[0 1 5 1 7 2 0 3]
[0 0 5 5 5 2 4 3] [0 0 5 5 5 2 4 3]
SUBTRACT (SI)
[4 5 1 4 1 5 1 4] WITH EACH [3 4 0 3 0 4 0 3]
[5 1 2 4 5 2 6 3] ELEMENTS OF [4 0 1 3 4 1 5 2]
ITS
[5 2 6 4 0 4 0 5] CORRESPOND [5 2 6 4 0 4 0 5]
ING ROWS
[4 0 2 4 7 4 6 2] [4 0 2 4 7 4 6 2]
[5 1 6 1 0 1 1 5] [5 1 6 1 0 1 1 5]
[4 5 2 4 2 5 2 5]] [2 3 0 2 0 3 0 3]]
Pixels 0 1 2 3 4 5 6 7

Number of pixels 15 8 8 9 10 9 3 2

Cumulative Sum 15 23 31 40 50 59 62 64

Probability 0.21 0.34 0.45 0.59 0.75 0.89 0.93 1

Multiply Highest grey 1.47 2.38 3.15 4.13 5.25 6.23 6.51 7
value with probability
Round off 2 3 3 4 5 6 7 7
 Occurrence
16
14
12
10
8
Occurrence
6
4
2
0
1 2 3 4 5 6 7

Original Histogram
 Occurrence
18
16
14
12
10
8 Occurrence
6
4
2
0
2 3 4 5 6 7

Equalized Histogram
(With new method)