You do not have permission to edit this page, for the following reasons:

This IP address has been blocked from editing Wikipedia.
This does not affect your ability to read Wikipedia pages.
Most people who see this message have done nothing wrong. Some kinds of blocks restrict editing from specific service providers or telecom companies in response to recent abuse or vandalism, and can sometimes affect other users who are unrelated to that abuse. Review the information below for assistance if you do not believe that you have done anything wrong.

The IP address or range 44.200.0.0/16 has been blocked (disabled) by ‪Blablubbs‬ for the following reason(s):

The IP address that you are currently using has been blocked because it is believed to be a web host provider or colocation provider. To prevent abuse, web hosts and colocation providers may be blocked from editing Wikipedia.
You will not be able to edit Wikipedia using a web host or colocation provider because it hides your IP address, much like a proxy or VPN.
We recommend that you attempt to use another connection to edit. For example, if you use a proxy or VPN to connect to the internet, turn it off when editing Wikipedia. If you edit using a mobile connection, try using a Wi-Fi connection, and vice versa. If you are using a corporate internet connection, switch to a different Wi-Fi network. If you have a Wikipedia account, please log in.
If you do not have any other way to edit Wikipedia, you will need to request an IP block exemption.

How to appeal if you are confident that your connection does not use a colocation provider's IP address:
If you are confident that you are not using a web host, you may appeal this block by adding the following text on your talk page: ((unblock|reason=Caught by a colocation web host block but this host or IP is not a web host. My IP address is _______. Place any further information here. ~~~~)). You must fill in the blank with your IP address for this block to be investigated. Your IP address can be determined here. Alternatively, if you wish to keep your IP address private you can use the unblock ticket request system. There are several reasons you might be editing using the IP address of a web host or colocation provider (such as if you are using VPN software or a business network); please use this method of appeal only if you think your IP address is in fact not a web host or colocation provider.

Administrators: The IP block exemption user right should only be applied to allow users to edit using web host in exceptional circumstances, and requests should usually be directed to the functionaries team via email. If you intend to give the IPBE user right, a CheckUser needs to take a look at the account. This can be requested most easily at SPI Quick Checkuser Requests. Unblocking an IP or IP range with this template is highly discouraged without at least contacting the blocking administrator.

This block will expire on 16:45, 10 February 2025.

Even when blocked, you will usually still be able to edit your user talk page, as well as email administrators and other editors.

For information on how to proceed, please read the FAQ for blocked users and the guideline on block appeals. The guide to appealing blocks may also be helpful.

Other useful links: Blocking policy · Help:I have been blocked
Your IP address is in a range that has been blocked on all Wikimedia Foundation wikis. The block was made by ‪AntiCompositeNumber‬. The reason given is Open proxy/Webhost: Visit the FAQ if you are affected .
- Start of block: 13:55, 18 August 2022
- Expiry of block: 13:55, 18 March 2025
Your current IP address is 44.200.254.7. The blocked range is 44.200.0.0/16. Please include all above details in any queries you make. If you believe you were blocked by mistake, you can find additional information and instructions in the No open proxies global policy. Otherwise, to discuss the block please post a request for review on Meta-Wiki. You could also send an email to the stewards VRT queue at stewards@wikimedia.org including all above details.

You can view and copy the source of this page:

((Short description|Method in image processing of contrast adjustment using the image's histogram))
((Lead too short|date=November 2023))

((Use American English|date=March 2021))
((Use mdy dates|date=March 2021))
'''Histogram equalization''' is a method in [[image processing]] of [[contrast (vision)|contrast]] adjustment using the [[image]]'s [[Image histogram|histogram]]. 

[[Image:Histogrammeinebnung.png|thumb|right|300px|alt=A histogram which is zero apart from a central area containing strong peaks is transformed by stretching the peaked area to fill the entire x-axis.|Histograms of an image before and after equalization.]]

==Overview==
This method usually increases the global [[contrast (vision)|contrast]] of many images, especially when the image is represented by a narrow range of intensity values. Through this adjustment, the [[luminous intensity|intensities]] can be better distributed on the histogram utilizing the full range of intensities evenly. This allows for areas of lower local contrast to gain a higher contrast.  Histogram equalization accomplishes this by effectively spreading out the highly populated intensity values which are used to degrade image contrast.

The method is useful in images with backgrounds and foregrounds that are both bright or both dark. In particular, the method can lead to better views of [[bone]] structure in [[x-ray]] images, and to better detail in [[photographs]] that are either over or under-exposed. A key advantage of the method is that it is a fairly straightforward technique adaptive to the input image and an [[invertible]] [[Operator (mathematics)|operator]]. So in theory, if the histogram equalization [[function (mathematics)|function]] is known, then the original histogram can be recovered. The calculation is not [[computation]]ally intensive. A disadvantage of the method is that it is indiscriminate. It may increase the contrast of background [[signal noise|noise]], while decreasing the usable [[signal (information theory)|signal]].

In scientific imaging where spatial correlation is more important than intensity of signal (such as separating [[DNA]] fragments of quantized length), the small [[signal-to-noise ratio]] usually hampers visual detections.

Histogram equalization often produces unrealistic effects in photographs; however it is very useful for scientific images like [[Thermography|thermal]], [[satellite]] or [[x-ray]] images, often the same class of images to which one would apply [[false-color]]. Also histogram equalization can produce undesirable effects (like visible [[image gradient]]) when applied to images with low [[color depth]]. For example, if applied to 8-bit image displayed with [[List of 8-bit computer hardware palettes|8-bit gray-scale palette]] it will further reduce [[color depth]] (number of unique shades of gray) of the image. Histogram equalization will work the best when applied to images with much higher [[color depth]] than [[Palette (computing)|palette]] size, like [[Continuous function|continuous]] data or 16-bit gray-scale images.

There are two ways to think about and implement histogram equalization, either as image change or as [[Palette (computing)|palette]] change. The operation can be expressed as ''P(M(I))'' where ''I'' is the original image, ''M'' is histogram equalization mapping operation and ''P'' is a palette.  If we define a new palette as ''P'=P(M)'' and leave image ''I'' unchanged then histogram equalization is implemented as [[Palette (computing)|palette]] change or mapping change. On the other hand, if palette P remains unchanged and image is modified to ''I'=M(I)'' then the implementation is accomplished by image change. In most cases palette change is better as it preserves the original data.

Modifications of this method use multiple histograms, called subhistograms, to emphasize local contrast, rather than overall global contrast. Examples of such methods include [[adaptive histogram equalization]], ''contrast limiting adaptive histogram equalization'' or [[CLAHE]], multipeak histogram equalization (MPHE), and multipurpose beta optimized bihistogram equalization (MBOBHE). The goal of these methods, especially MBOBHE, is to improve the contrast without producing brightness mean-shift and detail loss artifacts by modifying the HE algorithm.<ref>((cite journal|last1=Hum|first1=Yan Chai|last2=Lai|first2=Khin Wee|last3=Mohamad Salim|first3=Maheza Irna|title=Multiobjectives bihistogram equalization for image contrast enhancement|journal=Complexity|date=11 October 2014|volume=20|issue=2|pages=22–36|doi=10.1002/cplx.21499|bibcode=2014Cmplx..20b..22H))</ref>

A signal transform equivalent to histogram equalization also seems to happen in [[biological neural networks]] so as to maximize the output firing rate of the neuron as a function of the input statistics. This has been proved in particular in the [[fly]] [[retina]].<ref>((cite journal|last=Laughlin|first=S.B|year=1981|title=A simple coding procedure enhances a neuron's information capacity|journal=Z. Naturforsch.|volume=9–10(36):910–2))</ref>

Histogram equalization is a specific case of the more general class of histogram remapping methods.  These methods seek to adjust the image to make it easier to analyze or improve visual quality (e.g., [[retinex]])

===Back projection===
The '''back projection''' (or "project") of a histogrammed image is the re-application of the modified histogram to the original image, functioning as a look-up table for pixel brightness values.

For each group of pixels taken from the same position from all input single-channel images, the function puts the histogram bin value to the destination image, where the coordinates of the bin are determined by the values of pixels in this input group. In terms of statistics, the value of each output image pixel characterizes the probability that the corresponding input pixel group belongs to the object whose histogram is used.<ref>((cite journal|year=2001|title=Open Source Computer Vision Library Reference Manual|url=http://www.cs.unc.edu/~stc/FAQs/OpenCV/OpenCVReferenceManual.pdf|author=Intel Corporation|access-date=2015-01-11))</ref>

==Implementation==
Consider a discrete [[Grayscale|grayscale image]] {''x''} and let ''n<sub>i</sub>'' be the number of occurrences of gray level ''i''. The probability of an occurrence of a pixel of level ''i'' in the image is 
:<math>\ p_x(i) = p(x=i) = \frac{n_i}{n},\quad 0 \le i < L </math>
<math>\ L </math> being the total number of gray levels in the image (typically 256), ''n'' being the total number of pixels in the image, and <math>p_x(i)</math> being in fact the image's histogram for pixel value i, normalized to [0,1].

Let us also define the ''[[cumulative distribution function]]'' corresponding to ''i'' as
:<math>\operatorname{cdf}_x(i) = \sum_{j=0}^i p_x(x=j)</math>,
which is also the image's accumulated normalized histogram.

We would like to create a transformation of the form  <math>\ y=T(x) </math> to produce a new image {''y''}, with a flat histogram. Such an image would have a linearized cumulative distribution function (CDF) across the value range, i.e.
:<math>\operatorname{cdf}_y(i) = (i+1) K</math> for <math> 0 \le i < L </math>
for some constant  <math>\ K </math>.  The properties of the CDF allow us to perform such a transform (see [[Cumulative distribution function#Inverse distribution function (quantile function)|Inverse distribution function]]); it is defined as
:<math>\ y = T(k) = \operatorname{cdf}_x(k)</math>
where <math>\ k </math> is in the range <math> [0,L-1]) </math>.
Notice that <math>\ T </math> maps the levels into the range [0,1], since we used a normalized histogram of {''x''}. In order to map the values back into their original range, the following simple transformation needs to be applied on the result:
:<math>\ y^\prime = y \cdot(\max\{x\} - \min\{x\}) + \min\{x\}= y \cdot(L- 1)</math>.
A more detailed derivation is [http://www.math.uci.edu/icamp/courses/math77c/demos/hist_eq.pdf provided here].

<math>\ y </math> is a real value while  <math>\ y^\prime </math> has to be an integer. An intuitive and popular method<ref>((Cite book|last=Gonzalez|first=Rafael C.|url=https://www.worldcat.org/oclc/991765590|title=Digital image processing|date=2018|publisher=Pearson|others=Richard E. Woods|isbn=978-1-292-22304-9|edition=4th|location=New York, NY|pages=138–140|oclc=991765590))</ref> is applying the round operation:
:<math>\ y^\prime = \operatorname{round} (y \cdot(L- 1))</math>.
However, detailed analysis results in slightly different formulation. The mapped value <math>\ y^\prime </math> should be 0 for the range of <math>0<y \leq1/L</math>. And <math>\ y^\prime =1</math> for <math>1/L < y \leq 2/L</math>, <math>\ y^\prime = 2 </math> for <math>2/L < y \leq 3/L</math>, ...., and finally <math>\ y^\prime =L-1</math> for <math>(L-1)/L < y \leq 1</math>. Then the quantization formula from <math>\ y</math>  to <math>\ y^\prime </math>  should be

<math>y^\prime=\operatorname{ceil}(L \cdot y)-1 </math>.

(Note: <math>y^\prime=-1 </math> when <math>\ y=0 </math> , however, it does not happen just because <math>\ y=0 </math> means that there is no pixel corresponding to that value.)

== Of color images ==

The above describes histogram equalization on a grayscale image.  However it can also be used on color images by applying the same method separately to the Red, Green and Blue components of the [[RGB]] color values of the image. However, applying the same method on the Red, Green, and Blue components of an RGB image may yield dramatic changes in the image's [[color balance]] since the relative distributions of the color channels change as a result of applying the algorithm. However, if the image is first converted to another color space, [[Lab color space]], or [[HSL and HSV|HSL/HSV color space]] in particular, then the algorithm can be applied to the [[luminance]] or value channel without resulting in changes to the hue and saturation of the image.<ref>S. Naik and C. Murthy, "[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=1257395 Hue-preserving color image enhancement without gamut problem]," IEEE Trans. Image Processing, vol. 12, no. 12, pp. 1591–1598, Dec. 2003</ref>
There are several histogram equalization methods in 3D space. Trahanias and Venetsanopoulos applied histogram equalization in 3D color space<ref>P. E. Trahanias and A. N. Venetsanopoulos, "[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=202045 Color image enhancement through 3-D histogram equalization]," in Proc. 15th IAPR Int. Conf. Pattern Recognition, vol. 1, pp. 545–548, Aug.-Sep. 1992.</ref> However, it results in "whitening" where the probability of bright pixels are higher than that of dark ones.<ref>N. Bassiou and C. Kotropoulos, "[http://www.sciencedirect.com/science/article/pii/S1077314206002141 Color image histogram equalization by absolute discounting back-off]," Computer Vision and Image Understanding, vol. 107, no. 1-2, pp.108-122, Jul.-Aug. 2007</ref> Han et al. proposed to use a new cdf defined by the iso-luminance plane, which results in uniform gray distribution.<ref>((Cite journal|doi = 10.1109/TIP.2010.2068555|title = A Novel 3-D Color Histogram Equalization Method with Uniform 1-D Gray Scale Histogram|year = 2011|last1 = Han|first1 = Ji-Hee|last2 = Yang|first2 = Sejung|last3 = Lee|first3 = Byung-Uk|journal = IEEE Transactions on Image Processing|volume = 20|issue = 2|pages = 506–512|pmid = 20801744| bibcode=2011ITIP...20..506H |s2cid = 17972519))</ref>

==Examples==

For consistency with [[statistics|statistical]] usage, "CDF" (i.e. Cumulative distribution function) should be replaced by "cumulative histogram", especially since the article links to [[cumulative distribution function]] which is derived by dividing values in the cumulative histogram by the overall amount of pixels. The equalized CDF is defined in terms of [[ranking|rank]] as <math>rank/pixelcount</math>.

===Small image===
[[File:JPEG example subimage.svg|thumb|256px|The 8×8 sub-image shown in 8-bit grayscale]]
The 8-bit grayscale image shown has the following values:

{| class="wikitable"
! style="background-color:#343434; color:#ffffff;" | 52
! style="background-color:#373737; color:#ffffff;" | 55
! style="background-color:#3d3d3d; color:#ffffff;" | 61
! style="background-color:#3b3b3b; color:#ffffff;" | 59
! style="background-color:#464646; color:#ffffff;" | 79
! style="background-color:#3d3d3d; color:#ffffff;" | 61
! style="background-color:#4c4c4c; color:#ffffff;" | 76
! style="background-color:#3d3d3d; color:#ffffff;" | 61
|-
| style="background-color:#3e3e3e; color:#ffffff;" | 62
| style="background-color:#3b3b3b; color:#ffffff;" | 59
| style="background-color:#373737; color:#ffffff;" | 55
| style="background-color:#686868; color:#ffffff;" | 104
| style="background-color:#5e5e5e; color:#ffffff;" | 94
| style="background-color:#555555; color:#ffffff;" | 85
| style="background-color:#3b3b3b; color:#ffffff;" | 59
| style="background-color:#474747; color:#ffffff;" | 71
|-
| style="background-color:#3f3f3f; color:#ffffff;" | 63
| style="background-color:#414141; color:#ffffff;" | 65
| style="background-color:#424242; color:#ffffff;" | 66
| style="background-color:#717171; color:#ffffff;" | 113
| style="background-color:#909090; color:#000000;" | 144
| style="background-color:#686868; color:#ffffff;" | 104
| style="background-color:#3f3f3f; color:#ffffff;" | 63
| style="background-color:#484848; color:#ffffff;" | 72
|-
| style="background-color:#404040; color:#ffffff;" | 64
| style="background-color:#464646; color:#ffffff;" | 70
| style="background-color:#464646; color:#ffffff;" | 70
| style="background-color:#7e7e7e; color:#ffffff;" | 126
| style="background-color:#9a9a9a; color:#000000;" | 154
| style="background-color:#6d6d6d; color:#ffffff;" | 109
| style="background-color:#474747; color:#ffffff;" | 71
| style="background-color:#454545; color:#ffffff;" | 69
|-
| style="background-color:#434343; color:#ffffff;" | 67
| style="background-color:#494949; color:#ffffff;" | 73
| style="background-color:#444444; color:#ffffff;" | 68
| style="background-color:#6a6a6a; color:#ffffff;" | 106
| style="background-color:#7a7a7a; color:#ffffff;" | 122
| style="background-color:#585858; color:#ffffff;" | 88
| style="background-color:#444444; color:#ffffff;" | 68
| style="background-color:#444444; color:#ffffff;" | 68
|-
| style="background-color:#444444; color:#ffffff;" | 68
| style="background-color:#4f4f4f; color:#ffffff;" | 79
| style="background-color:#3c3c3c; color:#ffffff;" | 60
| style="background-color:#464646; color:#ffffff;" | 70
| style="background-color:#4d4d4d; color:#ffffff;" | 77
| style="background-color:#424242; color:#ffffff;" | 66
| style="background-color:#3a3a3a; color:#ffffff;" | 58
| style="background-color:#4b4b4b; color:#ffffff;" | 75
|-
| style="background-color:#454545; color:#ffffff;" | 69
| style="background-color:#555555; color:#ffffff;" | 85
| style="background-color:#404040; color:#ffffff;" | 64
| style="background-color:#3a3a3a; color:#ffffff;" | 58
| style="background-color:#373737; color:#ffffff;" | 55
| style="background-color:#3d3d3d; color:#ffffff;" | 61
| style="background-color:#414141; color:#ffffff;" | 65
| style="background-color:#535353; color:#ffffff;" | 83
|-
| style="background-color:#464646; color:#ffffff;" | 70
| style="background-color:#575757; color:#ffffff;" | 87
| style="background-color:#454545; color:#ffffff;" | 69
| style="background-color:#444444; color:#ffffff;" | 68
| style="background-color:#414141; color:#ffffff;" | 65
| style="background-color:#494949; color:#ffffff;" | 73
| style="background-color:#4e4e4e; color:#ffffff;" | 78
| style="background-color:#5a5a5a; color:#ffffff;" | 90
|}


The histogram for this image is shown in the following table.  Pixel values that have a zero count are excluded for the sake of brevity.
:{| class="wikitable"
|-
! Value !! Count
! Value !! Count
! Value !! Count
! Value !! Count
! Value !! Count
|-
|  52 || 1
|  64 || 2
|  72 || 1
|  85 || 2
| 113 || 1
|-
|  55 || 3
|  65 || 3
|  73 || 2
|  87 || 1
| 122 || 1
|-
|  58 || 2
|  66 || 2
|  75 || 1
|  88 || 1
| 126 || 1
|-
|  59 || 3
|  67 || 1
|  76 || 1
|  90 || 1
| 144 || 1
|-
|  60 || 1
|  68 || 5
|  77 || 1
|  94 || 1
| 154 || 1
|-
|  61 || 4
|  69 || 3
|  78 || 1
| 104 || 2
|rowspan="3" colspan="2"| 
|-
|  62 || 1
|  70 || 4
|  79 || 2
| 106 || 1
|-
|  63 || 2
|  71 || 2
|  83 || 1
| 109 || 1
|}

The [[cumulative distribution function]] (cdf) is shown below.  Again, pixel values that do not contribute to an increase in the cdf are excluded for brevity.
:{| class="wikitable"
|-
! v, Pixel Intensity !! cdf(v) !! h(v), Equalized v
|-
| 52||1||0
|-
| 55||4||12
|-
| 58||6||20
|-
| 59||9||32
|-
| 60||10||36
|-
| 61||14||53
|-
| 62||15||57
|-
| 63||17||65
|-
| 64||19||73
|-
| 65||22||85
|-
| 66||24||93
|-
| 67||25||97
|-
| 68||30||117
|-
| 69||33||130
|-
| 70||37||146
|-
| 71||39||154
|-
| 72||40||158
|-
| 73||42||166
|-
| 75||43||170
|-
| 76||44||174
|-
| 77||45||178
|-
| 78||46||182
|-
| 79||48||190
|-
| 83||49||194
|-
| 85||51||202
|-
| 87||52||206
|-
| 88||53||210
|-
| 90||54||215
|-
| 94||55||219
|-
| 104||57||227
|-
| 106||58||231
|-
| 109||59||235
|-
| 113||60||239
|-
| 122||61||243
|-
| 126||62||247
|-
| 144||63||251
|-
| 154||64||255
|} (Please note that <math>h(v)=\operatorname{ceil}(\operatorname{cdf}(v))-1 </math> version is not illustrated yet.)

This cdf shows that the minimum value in the subimage is 52 and the maximum value is 154.  The cdf of 64 for value 154 coincides with the number of pixels in the image.  The cdf must be normalized to <math>[0,255]</math>. The general histogram equalization formula is:

:<math>
h(v) =
 \mathrm{round}
 \left(
   \frac {\operatorname{cdf}(v) - \operatorname{cdf}_{\min)) {(M \times N) - \operatorname{cdf}_{\min))
   \times (L - 1)
 \right)
</math>

where cdf<sub>min</sub> is the minimum non-zero value of the cumulative distribution function (in this case 1), M × N gives the image's number of pixels (for the example above 64, where M is width and N the height) and L is the number of grey levels used (in most cases, like this one, 256).


''Note that to scale values in the original data that are above 0 to the range 1 to L-1, inclusive, the above equation would instead be:''

:<math>
h(v) =
 \mathrm{round}
 \left(
   \frac {\operatorname{cdf}(v) - \operatorname{cdf}_{\min)) {(M \times N) - \operatorname{cdf}_{\min))
   \times (L - 2)
 \right) + 1
</math>
''where cdf(v) > 0. Scaling from 1 to 255 preserves the non-zero-ness of the minimum value.''


The equalization formula for the example scaling data from 0 to 255, inclusive, is:

:<math>
h(v) =
 \mathrm{round}
 \left(
   \frac {\operatorname{cdf}(v) - 1} {63}
   \times 255
 \right)
</math>

For example, the cdf of 78 is 46.  (The value of 78 is used in the bottom row of the 7th column.)  The normalized value becomes

:<math>
h(78) =
 \mathrm{round}
 \left(
   \frac {46 - 1} {63}
   \times 255
 \right)
=
 \mathrm{round}
 \left(
   0.714286
   \times 255
 \right)
=
182
</math>

Once this is done then the values of the equalized image are directly taken from the normalized cdf to yield the equalized values:

{| class="wikitable"
! style="background-color:#000000; color:#FFFFFF;" | 0
! style="background-color:#0C0C0C; color:#FFFFFF;" | 12
! style="background-color:#353535; color:#FFFFFF;" | 53
! style="background-color:#202020; color:#FFFFFF;" | 32
! style="background-color:#929292; color:#000000;" | 190
! style="background-color:#353535; color:#FFFFFF;" | 53
! style="background-color:#AEAEAE; color:#000000;" | 174
! style="background-color:#353535; color:#FFFFFF;" | 53
|-
! style="background-color:#393939; color:#FFFFFF;" | 57
! style="background-color:#202020; color:#FFFFFF;" | 32
! style="background-color:#0C0C0C; color:#FFFFFF;" | 12
! style="background-color:#E3E3E3; color:#000000;" | 227
! style="background-color:#DBDBDB; color:#000000;" | 219
! style="background-color:#CACACA; color:#000000;" | 202
! style="background-color:#202020; color:#FFFFFF;" | 32
! style="background-color:#9A9A9A; color:#000000;" | 154
|-
! style="background-color:#414141; color:#FFFFFF;" | 65
! style="background-color:#555555; color:#FFFFFF;" | 85
! style="background-color:#5D5D5D; color:#FFFFFF;" | 93
! style="background-color:#EFEFEF; color:#000000;" | 239
! style="background-color:#FBFBFB; color:#000000;" | 251
! style="background-color:#E3E3E3; color:#000000;" | 227
! style="background-color:#414141; color:#FFFFFF;" | 65
! style="background-color:#9E9E9E; color:#000000;" | 158
|-
! style="background-color:#494949; color:#FFFFFF;" | 73
! style="background-color:#929292; color:#000000;" | 146
! style="background-color:#929292; color:#000000;" | 146
! style="background-color:#F7F7F7; color:#000000;" | 247
! style="background-color:#FFFFFF; color:#000000;" | 255
! style="background-color:#EBEBEB; color:#000000;" | 235
! style="background-color:#9A9A9A; color:#000000;" | 154
! style="background-color:#828282; color:#000000;" | 130
|-
! style="background-color:#616161; color:#FFFFFF;" | 97
! style="background-color:#A6A6A6; color:#000000;" | 166
! style="background-color:#757575; color:#FFFFFF;" | 117
! style="background-color:#E7E7E7; color:#000000;" | 231
! style="background-color:#F3F3F3; color:#000000;" | 243
! style="background-color:#D2D2D2; color:#000000;" | 210
! style="background-color:#757575; color:#FFFFFF;" | 117
! style="background-color:#757575; color:#FFFFFF;" | 117
|-
! style="background-color:#757575; color:#FFFFFF;" | 117
! style="background-color:#BEBEBE; color:#000000;" | 190
! style="background-color:#242424; color:#FFFFFF;" | 36
! style="background-color:#BEBEBE; color:#000000;" | 146
! style="background-color:#B2B2B2; color:#000000;" | 178
! style="background-color:#5D5D5D; color:#FFFFFF;" | 93
! style="background-color:#141414; color:#FFFFFF;" | 20
! style="background-color:#AAAAAA; color:#000000;" | 170
|-
! style="background-color:#828282; color:#000000;" | 130
! style="background-color:#CACACA; color:#000000;" | 202
! style="background-color:#494949; color:#FFFFFF;" | 73
! style="background-color:#141414; color:#FFFFFF;" | 20
! style="background-color:#0C0C0C; color:#FFFFFF;" | 12
! style="background-color:#353535; color:#FFFFFF;" | 53
! style="background-color:#555555; color:#FFFFFF;" | 85
! style="background-color:#C2C2C2; color:#000000;" | 194
|-
! style="background-color:#929292; color:#000000;" | 146
! style="background-color:#CECECE; color:#000000;" | 206
! style="background-color:#828282; color:#000000;" | 130
! style="background-color:#757575; color:#FFFFFF;" | 117
! style="background-color:#555555; color:#FFFFFF;" | 85
! style="background-color:#A6A6A6; color:#000000;" | 166
! style="background-color:#B6B6B6; color:#000000;" | 182
! style="background-color:#D7D7D7; color:#000000;" | 215
|}

Notice that the minimum value (52) is now 0 and the maximum value (154) is now 255.

:{|
|-
| [[File:JPEG example subimage.svg|200px]]
| [[File:JPEG example subimage - equalized.svg|200px]]
|-
|align="center"| Original
|align="center"| Equalized
|}

:{|
|-
| [[File:Plot for illustrating histogram equalization.svg|200px]]
| [[File:Histogram equalization.svg|200px]]
|-
|align="center"| Histogram of Original image
|align="center"| Histogram of Equalized image
|}

===Full-sized image===
{|class="wikitable"|align="left"	 
|- valign="top" |	 
|[[File:Unequalized Hawkes Bay NZ.jpg|thumb|300px|Before Histogram Equalization|center]]
|[[File:Unequalized Histogram.svg|thumb|300px|Corresponding histogram (red) and cumulative histogram (black)|center]]
|- valign="top" |	 
|[[File:Equalized Hawkes Bay NZ.jpg|thumb|300px|After Histogram Equalization|center]]
|[[File:Equalized Histogram.svg|thumb|300px|Corresponding histogram (red) and cumulative histogram (black)|center]]
|}

== Advantages and Disadvantages ==

=== Advantages ===

# Better-Looking Images: Histogram equalization makes images look better by making the details clearer and improving their overall appearance.
# Helps Spot Things: It can help computer programs spot important features in images, which is handy for tasks like medical diagnosis or identifying objects.
# Easy to Use: You don't need to be an expert to use histogram equalization. It's straightforward and can be used by beginners in image editing and computer vision.
# Saves Time and Resources: Since it works directly on the image pixels, you don't need extra data or complicated setup, making it efficient for real-time applications and devices with limited computing power.

=== Disadvantages ===

# Can Make Things Look Strange: Sometimes, histogram equalization can make images look odd by exaggerating small details or making textures too prominent, which can be distracting.
# Not Good with Local Details: It might not preserve small details well, especially in areas of the image that have both bright and dark parts.
# Not Customizable Enough: It treats the whole image the same way, which might not work well for images with specific lighting conditions or unique characteristics.
# Tricky to Fine-Tune: Adjusting the settings for histogram equalization can be tricky, and getting it just right often requires a good understanding of image processing.

== See also ==
* [[Histogram matching]]
* [[Adaptive histogram equalization]]
* [[Normalization (image processing)]]
* [[Digital image processing]]
* [[Image segmentation]]

==Notes==
== See also ==
* [[Histogram matching]]
* [[Adaptive histogram equalization]]
* [[Normalization (image processing)]]
((reflist))

== References ==
*Acharya and Ray, ''Image Processing: Principles and Applications'', Wiley-Interscience 2005 ((ISBN|0-471-71998-6))
*Russ, ''The Image Processing Handbook: Fourth Edition'', CRC 2002 ((ISBN|0-8493-2532-3))
* [http://www.generation5.org/content/2004/histogramEqualization.asp "Histogram Equalization" at Generation5] ''([https://archive.today/20160516012012/http://www.generation5.org/content/2004/histogramEqualization.asp archive])''

[[Category:Image processing]]

Pages transcluded onto the current version of this page (help):

Histogram equalization (edit)
Template:Ambox (view source) (template editor protected)
Template:Catalog lookup link (view source) (template editor protected)
Template:Cite book (view source) (protected)
Template:Cite journal (view source) (protected)
Template:DMCA (view source) (template editor protected)
Template:Dated maintenance category (view source) (template editor protected)
Template:Dated maintenance category (articles) (view source) (template editor protected)
Template:FULLROOTPAGENAME (view source) (template editor protected)
Template:ISBN (view source) (template editor protected)
Template:Lead too short (view source) (template editor protected)
Template:Main other (view source) (protected)
Template:Ns has subpages (view source) (protected)
Template:Pagetype (view source) (protected)
Template:Reflist (view source) (protected)
Template:Reflist/styles.css (view source) (protected)
Template:SDcat (view source) (protected)
Template:Short description (view source) (protected)
Template:Short description/lowercasecheck (view source) (protected)
Template:Use American English (view source) (template editor protected)
Template:Use mdy dates (view source) (template editor protected)
Template:Yesno (view source) (protected)
Template:Yesno-no (view source) (template editor protected)
Template:Yesno-yes (view source) (template editor protected)
Module:Arguments (view source) (protected)
Module:Catalog lookup link (view source) (template editor protected)
Module:Category handler (view source) (protected)
Module:Category handler/blacklist (view source) (protected)
Module:Category handler/config (view source) (protected)
Module:Category handler/data (view source) (protected)
Module:Category handler/shared (view source) (protected)
Module:Check for unknown parameters (view source) (protected)
Module:Check isxn (view source) (template editor protected)
Module:Citation/CS1 (view source) (protected)
Module:Citation/CS1/COinS (view source) (protected)
Module:Citation/CS1/Configuration (view source) (protected)
Module:Citation/CS1/Date validation (view source) (protected)
Module:Citation/CS1/Identifiers (view source) (protected)
Module:Citation/CS1/Utilities (view source) (protected)
Module:Citation/CS1/Whitelist (view source) (protected)
Module:Citation/CS1/styles.css (view source) (protected)
Module:Disambiguation/templates (view source) (protected)
Module:Message box (view source) (protected)
Module:Message box/ambox.css (view source) (protected)
Module:Message box/configuration (view source) (protected)
Module:Namespace detect/config (view source) (protected)
Module:Namespace detect/data (view source) (protected)
Module:Ns has subpages (view source) (protected)
Module:Pagetype (view source) (protected)
Module:Pagetype/config (view source) (protected)
Module:Pagetype/disambiguation (view source) (protected)
Module:Pagetype/setindex (view source) (protected)
Module:Pagetype/softredirect (view source) (protected)
Module:SDcat (view source) (protected)
Module:String (view source) (protected)
Module:Unsubst (view source) (protected)
Module:Wikitext Parsing (view source) (protected)
Module:Yesno (view source) (protected)

Return to Histogram equalization.

Retrieved from "https://en.wikipedia.org/wiki/Histogram_equalization"