0% found this document useful (0 votes)
19 views2 pages

Steps in Histogram Equalization Algorithm

The document describes the histogram equalization algorithm for contrast enhancement of digital images. It explains that histogram equalization takes control over the effect to enhance an image without loss of details. The original input image preserves its histogram characteristics. Then histogram equalization is applied to another copy of the image. The output image is compiled with the preserved input image to retrieve any lost points and reduce noise in the processed image.

Uploaded by

kedir Gemechu
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
19 views2 pages

Steps in Histogram Equalization Algorithm

The document describes the histogram equalization algorithm for contrast enhancement of digital images. It explains that histogram equalization takes control over the effect to enhance an image without loss of details. The original input image preserves its histogram characteristics. Then histogram equalization is applied to another copy of the image. The output image is compiled with the preserved input image to retrieve any lost points and reduce noise in the processed image.

Uploaded by

kedir Gemechu
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Histogram Equalization Algorithm

Kedir Gemechu
Department of Computer Science
Mada Walabu University
Kedirwaritu1@[Link]

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 [Link] 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}

Common questions

Powered by AI

The limitations of histogram equalization include potential over-enhancement, leading to loss of detail in specific areas and introduction of artifacts, especially in images with low contrast or poor lighting conditions. These issues can be mitigated by applying adaptive histogram equalization, which considers local regions of an image rather than global adjustments, or by using a combination of techniques that stabilize the output by preserving important features while enhancing contrast. These approaches can make histogram equalization more suitable for applications that require precision and nuanced enhancement .

The transformation function used in histogram equalization is based on the cumulative distribution function (CDF) of the input image's intensity levels. It is defined as f(x) = X0 + (XL−1 − X0)c(x), where c(x) is the cumulative distribution function, and X0 and XL−1 are the minimum and maximum intensity values, respectively. This function maps the original intensity values of an image to new values across the available range, based on the cumulative probabilities. The significance of this transformation is that it redistributes the pixel intensities to enhance contrast while preserving detail, resulting in a more visually informative output image .

Histogram equalization improves image quality by enhancing the contrast of an image. The underlying principle involves reallocating the intensity values of the pixels in an image such that the resultant histogram is spread more uniformly across all intensity levels. This process improves the visibility of features in an image by reducing its noise and preserving its details. The algorithm works by first computing the probability density function (PDF) and cumulative distribution function (CDF) of the input image, and then using these functions to transform the pixel values according to a specified transfer function .

The histogram equalization algorithm differs from other image enhancement techniques in its specific ability to preserve image details while simultaneously enhancing contrast. Unlike simple contrast stretching methods that can cause detail loss in certain sections of the image, histogram equalization utilizes the cumulative distribution function (CDF) to ensure that all intensity levels are represented uniformly. This process helps to retain the original structure and texture details, while its emphasis on the pixel probability distribution assists in reducing noise in the enhanced image. Other techniques may not address both detail preservation and noise reduction as effectively .

The role of histogram characteristics in the histogram equalization process is crucial, as it determines how intensities are distributed in the output image. By preserving the histogram characteristics of the original image, the method ensures that the enhanced image maintains textural information and details that are important for interpretation. This is particularly significant in applications where retaining the original image details is critical, such as in medical imaging. Equalization modifies the cumulative distribution so that it produces a more uniform histogram, effectively increasing global contrast .

When applying histogram equalization, several factors should be considered to ensure it meets specific image processing objectives. These include the context of the application (e.g., medical imaging, photography), the necessity to preserve image detail and avoid artifacts introduced by over-enhancement, and the initial distribution of pixel intensities, which might dictate the level of equalization needed. Consideration of these factors helps in tuning the process to enhance contrast effectively while maintaining the integrity and usefulness of the image for its intended purpose .

In the histogram equalization process, the probability density function (PDF) is important as it represents the distribution of pixel intensity values in an image. It is defined as p(Xk) = nk/n, where nk is the number of pixels with intensity Xk and n is the total number of pixels. The PDF provides the necessary data to compute the cumulative distribution function (CDF), which in turn is used to construct the transformation function for histogram equalization. This process effectively reallocates the pixels to enhance image contrast .

Maintaining the original image's histogram characteristics during the histogram equalization process is important because it helps ensure that the fundamental structure and details of the original image are preserved in the enhanced version. This is particularly crucial in applications where detail loss can mislead interpretations, such as in medical imaging. By preserving these characteristics, the enhanced image retains important textural and edge information while achieving improved contrast, thus providing a better balance between enhancement and detail preservation .

Histogram equalization is commonly used in various applications, such as medical imaging, speech recognition preprocessing, and general image and video processing. In these contexts, it provides several benefits, including improved visual interpretation of images by enhancing contrast and making features more distinguishable. This enhances the diagnostic capabilities in medical imaging by highlighting crucial features. It also serves as an effective preprocessing step for machine learning models in speech recognition, where improved image quality can lead to better feature extraction and model performance .

In the context of histogram equalization, the cumulative distribution function (CDF) represents the cumulative probability of occurrence of pixel intensity values in an image, as computed from its probability density function (PDF). The CDF is used to transform the original pixel intensity values to new values that stretch the histogram across the entire range of possible values, thereby enhancing the image contrast. The transformation is guided by a transform function defined as f(x) = X0 + (XL−1 − X0)c(x), where c(x) is the CDF. This function helps ensure that the output image has improved contrast with minimal loss of detail .

You might also like