Histogram Processing: Histogram of a digital image with intensity levels in the range [0, L-1] is a discrete function h(rk)=nk,

where rk is the kth intensity value and nk is the number of pixels in the image with intensity rk. It is Plot of h(rk) = nk vs rk p(rk) = nk/MN vs rk Histogram equalization: Histogram equalization automatically determines a transformation function that seeks to produce an output image that has a uniform histogram. s=T(r) 0<= r <= L-1 We assume that, a) T(r) is a monotonically increasing function in the range 0<= r <= L-1 and b) 0<= T(r) <= L-1 for 0<= r <= L-1. The inverse r = T-1(s) in which case we change condition a to T(r) is a strictly monotonically increasing function in the interval 0<= r <= L-1.

Histogram matching (specification): The method used to generate a processed image that has a specified histogram is called histogram matching or histogram specification. What Is Image Enhancement? Image enhancement is the process of making images more useful The reasons for doing this include: Highlighting interesting detail in images Removing noise from images Making images more visually appealing

Spatial & Frequency Domains: There are two broad categories of image enhancement techniques Spatial domain techniques Direct manipulation of image pixels

Frequency domain techniques Manipulation of Fourier transform or wavelet transform of an image

Image Histograms: The histogram of an image shows us the distribution of grey levels in the image. Massively useful in image processing, especially in segmentation Histogram Equalisation: Spreading out the frequencies in an image (or equalising the image) is a simple way to improve dark or washed out images The formula for histogram equalisation is given where

s k T ( rk )

j 1
k

pr ( r j )
nj n

j 1

rk : sk : k: nj: n:

input intensity processed intensity the intensity range (e.g 0.0 1.0) the frequency of intensity j the sum of all frequencies