Академический Документы
Профессиональный Документы
Культура Документы
1/10/2014
Image Negatives
Reverses the gray level order For L gray levels the transformation function is s =T(r) = (L - 1) - r
1/10/2014
Image Scaling
s =T(r) = a.r (a is a constant)
1/10/2014
Log Transformations
Function of s = cLog(1+r)
1/10/2014
Log Transformations
Properties of log transformations
For lower amplitudes of input image the range of gray levels is expanded For higher amplitudes of input image the range of gray levels is compressed
Application:
This transformation is suitable for the case when the dynamic range of a processed image far exceeds the capability of the display device (e.g. display of the Fourier spectrum of an image) Also called dynamic-range compression / expansion
1/10/2014 7
Log Transformations
1/10/2014
Power-Law Transformation
1/10/2014
Power-Law Transformation
For < 1: Expands values of dark pixels, compress values of brighter pixels For > 1: Compresses values of dark pixels, expand values of brighter pixels If =1 & c=1: Identity transformation (s = r)
A variety of devices (image capture, printing, display) respond according to power law and need to be corrected
Gamma () correction The process used to correct the power-law response phenomena
1/10/2014 10
Power-Law Transformation
1/10/2014
11
Gamma Correction
1/10/2014
12
1/10/2014
13
1/10/2014
14
1/10/2014
Transformed Intensities
15
Transformed Intensities
1/10/2014
16
s = r 0.6
s = r 0.4
1/10/2014
17
1/10/2014
18
Transformed Intensities
1/10/2014
19
s = r 3.0
s = r 4.0
20
Piecewise-Linear Transformation
Contrast Stretching Goal:
Increase the dynamic range of the gray levels for low contrast images
1/10/2014
22
1/10/2014
23
Thresholding
1/10/2014
24
First approach
Display a high value for all the gray levels in the range of interest Low value for all other gray levels This will produce a Binary Image
1/10/2014
25
2nd approach
Brightens the desired range of Gray Levels but preserves the Gray Levels of rest of the pixels
1/10/2014
26
Contrast Stretching
Histogram Equalization
Histogram Equalization
Histogram Equalization
Histogram Equalization
Histogram Equalization
Histogram Equalization
Histogram Equalisation(Summary)
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 sk T ( rk ) equalisation is given where
rk: input intensity sk: processed intensity k: the intensity range (e.g 0.0 1.0) nj: the frequency of intensity j n: the sum of all frequencies
pr ( r j )
j 1
j 1
nj n
Example
Example: cdf
Example
Initial Image
Notice that the minimum value (52) is now 0 and the maximum value (154) is now 255.
Example
Histogram Equalization-Examples
Histogram Equalization-Examples
Histogram Equalization-Examples
Histogram Equalization-Examples
Images taken from Gonzalez & Woods, Digital Image Processing (2002)
Histogram Equalization-Examples
Histogram Equalization-Examples
Histogram Equalization-Examples
Histogram Equalization-Examples
Edge detection
Mathematical Basis of Filtering for Image Sharpening First-order and Second-order Derivatives Approximation in Discrete-space Domain Implementation by Mask filtering
1st Derivative
The formula for the 1st derivative of a function is as follows:
f f ( x 1) f ( x) x
Its just the difference between subsequent values and measures the rate of change of the function
Ramp
Ramp or step in 1D profile normally characterize an edge in the image f is non-zero on on-set and end of Ramp and produces thin edges f is non-zero along whole Ramp and produces thick edges
Thin Line
Isolated Point