ADAPTIVE HISTOGRAM

EQUALIZATION

Angad chahal
Ashish Mane
Dhaval Solanki
Durgesh kesarkar
Rupesh gawade
Histogram Equalization:
 he histogram equalization is an approach to
enhance a given image. The approach is to
design a transformation such that the gray values
in the output is uniformly distributed in [0, 1] i.e
• pout (s) 1, 0  s1
 h(i) h(i)
3000.00 3000.00

2500.00 2500.00

2000.00 2000.00

1500.00 1500.00

1000.00 1000.00

500.00 500.00

0.00
i 0.00
i
0.00 50.00 100.00 150.00 200.00 250.00 0.00 50.00 100.00 150.00 200.00 250.00
Adaptive histogram equalization:
Adaptive histogram equalization is a computer
image processing technique used to improve contrast
in images.
It computes several histograms, each corresponding
to a distinct section of the image, and uses them to
redistribute the lightness values of the image.
Adaptive histogram equalization is considered an
image enhancement technique capable of improving
an image's local contrast, bringing out more detail in
the image.
Drawback:
It produces noise in the images

This noise can spoil the information content of the

image
Solution:
Contrast limited adaptive
histogram equalization(CLAHE):
CLAHE is improved version of AHE
CLAHE is a technique used to improve the local
contrast of an image.
The CLAHE algorithm partitions the images into
contextual regions and applies the histogram
equalization to each one.
This evens out the distribution of used grey values
and thus makes hidden features of the image more
visible.
The full grey spectrum is used to express the image.
Reduction of noise :
Noise can be reduced while maintaining the high
spatial frequency content of the image by applying a
combination of CLAHE, median filtration and edge
sharpening.

This technique known as Sequential processing can

be recorded into a user macro for repeat application
at any time.
2D minimum filter:
The minimum filter replaces the value of a pixel by the
smallest value of neighboring pixels covered by a NxN
matrix mask.

The size of the mask can be adjusted via the input field
kernel size

If applied to a binary label field the minimum filter

implements a so-called erosion operation. It reduces the
size of a segmented region by removing pixels from its
boundary.
2D maximum filtering:
The maximum filter replaces the value of a pixel by
the largest value of neighboring pixels covered by a
NxN mask.
The size of the mask can be adjusted via the input
field kernel size.
If applied to a binary label field the maximum filter
implements a so-called dilation operation. It enlarges
the size of a segmented region by adding pixels to its
boundary.
2D median filtering:
The median filter is a simple edge-preserving
smoothing filter.
The filter works by sorting pixels covered by a NxN
mask according to their grey value.
The center pixel is then replaced by the median of
these pixels, i.e., the middle entry of the sorted list.
The size of the pixel mask may be adjusted via the
text field labeled kernel size.
Example:
Original image
Image after CLADHE:
Applications:
ADE can be used to enhance image used to visualize
3-D data

It is widely used in medicine industry

It also has some radiological applications