Scribd
Upload
5 views9 pages

HistogramEqualization Examples

Histogram equalization is an image processing technique that enhances image contrast by redistributing intensity values. It spreads out the most frequent intensity values to improve the overall visual quality of images. The document also discusses the mathematical formulation of equalization and raises the question of whether it always yields good results.

Uploaded by

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

HistogramEqualization Examples

Histogram equalization is an image processing technique that enhances image contrast by redistributing intensity values. It spreads out the most frequent intensity values to improve the overall visual quality of images. The document also discusses the mathematical formulation of equalization and raises the question of whether it always yields good results.

Uploaded by

Eliaa Quraan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Histogram Equalization

Histogram Equalization
• Histogram equalization is an image
processing technique used to improve
contrast in images.
• It accomplishes this by effectively spreading
out the most frequent intensity values, i.e.
stretching out the intensity range of the
image.
Example (Matlab histeq function)
• If you use Matlab, this histogram plot of pout.tif image

Pixels’ intensities values


are concentrated in the
middle. This is a low
contrast image (it’s a
grey image…)
Example (Matlab histeq function)
• Using histogram equalization we adjust the image intensities to
enhance contrast.
Example (Matlab histeq function)
• Compare the histogram of a through d!

(a) (b)

(c) (d)
Does Histogram Equalization always produces
good results?
Equalization (Mathematically)
• Assume
• 𝐺(𝑥) is equalized image
• 𝑇(𝑥) is the cumulative sum of each gray level
• 𝐿 is the number of gray level 2
• 𝑛 is the number of pixels of the image.
• Then
( )
•𝐺 𝑥 = ∗ 𝐿 − 1 i.e, 𝐺 𝑥 = ∗ 𝑇(𝑥) − 1 Why -1 ?
Contrast stretching using Thresholding

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy