Intensity Transformation - Image Processing - Annotated Chap 3 G&W

Lecture 2.
Intensity Transformation
and Spatial Filtering
Spatial Domain vs. Transform Domain

Spatial
domain
image plane itself, directly process the intensity values of

the image plane
Transform
domain
process the transform coefficients, not directly process the

intensity values of the image plane
2/6/2014
Spatial Domain Process
g ( x, y ) = T [ f ( x, y )])
f ( x, y ) : input image
g ( x, y ) : output image
T : an operator on f defined over
a neighborhood of point ( x, y )
2/6/2014
2/6/2014
Intensity transformation function

s = T (r )
2/6/2014
Some Basic Intensity Transformation

Functions
2/6/2014
Image Negatives
Image negatives
s = L 1 r
2/6/2014
Example: Image Negatives
Small
lesion
2/6/2014
Log Transformations
Log Transformations
=
s c log(1 + r )
2/6/2014
Example: Log Transformations
2/6/2014
10
Power-Law (Gamma) Transformations
s = cr
2/6/2014
11
Example: Gamma Transformations
2/6/2014
12

Cathode ray tube
(CRT) devices have an
intensity-to-voltage
response that is a
power function, with
exponents varying
from approximately
1.8 to 2.5
s=r
2/6/2014
1/2.5
13
2/6/2014
14
2/6/2014
15
Piecewise-Linear Transformations
Contrast
Stretching
Expands the range of intensity levels in an image so that it spans

the full intensity range of the recording medium or display device.
Intensity-level
Slicing
Highlighting a specific range of intensities in an image often is of

interest.
2/6/2014
16
2/6/2014
17
Highlight the major

blood vessels and
study the shape of the
flow of the contrast
medium (to detect
blockages, etc.)
2/6/2014
Measuring the actual

flow of the contrast
medium as a function
of time in a series of
images
18
Bit-plane Slicing
2/6/2014
19
Bit-plane Slicing
2/6/2014
20
Bit-plane Slicing
2/6/2014
21
Histogram Processing
Histogram Equalization
Histogram Matching
Local Histogram Processing
Using Histogram Statistics for Image Enhancement
2/6/2014
22
Histogram Processing
Histogram h(rk ) = nk
rk is the k th intensity value
nk is the number of pixels in the image with intensity rk
nk
Normalized histogram p(rk ) =
MN
nk : the number of pixels in the image of
size M N with intensity rk
2/6/2014
23
2/6/2014
24
The intensity levels in an image may be viewed as
random variables in the interval [0, L-1].
Let pr (r ) and ps ( s ) denote the probability density
function (PDF) of random variables r and s.
2/6/2014
25
=
s T (r )
0 r L 1
a. T(r) is a strictly monotonically increasing function

in the interval 0 r L -1;
b. 0 T (r ) L -1 for 0 r L -1.
2/6/2014
26
=
s T (r )
0 r L 1
a. T(r) is a strictly monotonically increasing function

in the interval 0 r L -1;
b. 0 T (r ) L -1 for 0 r L -1.
T (r ) is continuous and differentiable.
ps ( s)ds = pr (r )dr
2/6/2014
27
r
=
s T (r=
) ( L 1) pr ( w)dw
0
ds dT (r )
d r
=
= ( L 1)
p
w
dw
(
)
r
0
dr
dr
dr
= ( L 1) pr (r )
pr (r )dr pr (r )
1
pr (r )
=
ps ( s ) =
=
=
( ( L 1) pr (r ) ) L 1
ds
ds

dr
2/6/2014
28
Example
Suppose that the (continuous) intensity values
in an image have the PDF
2r
,
2
pr (r ) = ( L 1)
0,
for 0 r L-1
otherwise
Find the transformation function for equalizing

the image histogram.
2/6/2014
29
Example
r
=
s T (r=
) ( L 1) pr ( w)dw
0
= ( L 1)
2w
dw
2
( L 1)
r
=
L 1
2/6/2014
30
Continuous case:
r
) ( L 1) pr ( w)dw
=
s T (r=
0
Discrete values:
k
) ( L 1) pr (rj )
s=
T (rk=
k
j =0
L 1 k
=
= n j
( L 1)
MN MN j 0
=j 0=
k
2/6/2014
nj
k=0,1,..., L-1
31
Example: Histogram Equalization

Suppose that a 3-bit image (L=8) of size 64 64 pixels (MN = 4096)
has the intensity distribution shown in following table.
Get the histogram equalization transformation function and give the
ps(sk) for each sk.
2/6/2014
32
s0 =
T (r0 ) =
7 pr (rj ) =
7 0.19 =
1.33
s1 =
T (r1 ) =
7 pr (rj ) =
7 (0.19 + 0.25) =
3.08
j =0
1
j =0
2/6/2014
s2 =
4.55 5
s3 =
5.67 6
s4 =
6.23 6
s5 =
6.65 7
s6 =
6.86 7
s7 =
7.00 7
33
2/6/2014
34
2/6/2014
35
2/6/2014
36
Question
Is histogram equalization always good?
No
2/6/2014
37
Histogram Matching
Histogram matching (histogram specification)
generate a processed image that has a specified histogram
Let pr (r ) and pz ( z ) denote the continous probability

density functions of the variables r and z. pz ( z ) is the
specified probability density function.
Let s be the random variable with the probability
r
) ( L 1) pr ( w)dw
=
s T (r=
0
Define a random variable z with the probability

z
( L 1) pz (t )dt =
G( z) =
s
0
2/6/2014
38
Histogram Matching
r
=
s T (r=
) ( L 1) pr ( w)dw
0
G( z) =
s
( L 1) pz (t )dt =
0
=
z G=
(s) G
2/6/2014
[T (r )]
39
Histogram Matching: Procedure
Obtain pr(r) from the input image and then obtain the values of s
r
=
s ( L 1) pr ( w)dw
0
Use the specified PDF and obtain the transformation function G(z)
z
G( z) =
( L 1) pz (t )dt =
s
0
Mapping from s to z
z = G 1 ( s )
2/6/2014
40
Histogram Matching: Example

Assuming continuous intensity values, suppose that an image has
the intensity PDF
2r
,
2
pr (r ) = ( L 1)
0,
for 0 r L -1
otherwise
Find the transformation function that will produce an image

whose intensity PDF is
3z 2
,
3
pz ( z ) = ( L 1)
0,
2/6/2014
for 0 z ( L -1)
otherwise
41
Histogram Matching: Example

Find the histogram equalization transformation for the input image
2
r
2w
s=
T (r ) =
( L 1) pr ( w)dw =
( L 1)
dw =
0
0 ( L 1) 2
L 1
r
Find the histogram equalization transformation for the specified histogram
z3
3t 2
G( z) =
( L 1) pz (t )dt =
( L 1)
dt ==
s
2
0
0 ( L 1)3
( L 1)
z
The transformation function

1/3
z=
( L 1) s
2
2/6/2014
1/3
2 r
=
( L 1) L 1
2 1/3
( L 1)r
=
42
Histogram Matching: Discrete Cases
Obtain pr(rj) from the input image and then obtain the values of
sk, round the value to the integer range [0, L-1].
( L 1) k
sk =
T (rk ) =
( L 1) pr (rj ) = n j
MN j 0
=j 0=
k
Use the specified PDF and obtain the transformation function

G(zq), round the value to the integer range [0, L-1].
q
G ( zq ) =
( L 1) pz ( zi ) =
sk
i =0
Mapping from sk to zq
2/6/2014
zq = G 1 ( sk )
43
Example: Histogram Matching

Suppose that a 3-bit image (L=8) of size 64 64 pixels (MN = 4096)
has the intensity distribution shown in the following table (on the
left). Get the histogram transformation function and make the output
image with the specified histogram, listed in the table on the right.
2/6/2014
44

Obtain the scaled histogram-equalized values,
s0 1,=
s1 3,=
s2 5,=
s3 6,=
s4 7,
=
s5 7,=
s6 7,=
s7 7.
=
Compute all the values of the transformation function G,
0
=
G ( z0 ) 7=
pz ( z j ) 0.00
j =0
=
G ( z1 ) 0.00
G ( z2 ) 0.00 0
0
1
=
G ( z3 ) 1.05
G ( z4 ) 2.45 2
G ( z5 )
5
=
G ( z6 ) 5.95 6
4.55
G ( z7 ) = 7.00 7
2/6/2014
45
2/6/2014
46

Obtain the scaled histogram-equalized values,
s0 1,=
s1 3,=
s2 5,=
s3 6,=
s4 7,
=
s5 7,=
s6 7,=
s7 7.
=
Compute all the values of the transformation function G,
0
=
G ( z0 ) 7=
pz ( z j ) 0.00
j =0
=
G ( z1 ) 0.00
G ( z2 ) 0.00 0
0
1 s0 G ( z4 ) 2.45 2 s1
=
G ( z3 ) 1.05
G ( z5 )
5 s2 G ( z6 ) 5.95 6 s3
=
4.55
G ( z7 ) = 7.00 7
2/6/2014
s4 s5 s6 s7
47

=
s0 1,=
s1 3,=
s2 5,=
s3 6,=
s4 7,
=
s5 7,=
s6 7,=
s7 7.
rk
0
1
2
2/6/2014
3
4
5
6
7
48

rk zq
03
1 4
25
36
47
57
67
77
2/6/2014
49
2/6/2014
50
2/6/2014
51
2/6/2014
52
2/6/2014
53
Local Histogram Processing

Define a neighborhood and move its center from pixel to
pixel
At each location, the histogram of the points in the
neighborhood is computed. Either histogram equalization or
histogram specification transformation function is obtained
Map the intensity of the pixel centered in the neighborhood
Move to the next location and repeat the procedure
2/6/2014
54
Local Histogram Processing: Example
2/6/2014
55
Using Histogram Statistics for Image

Enhancement
Average Intensity
L 1
m = ri p (ri )
i =0
u=
n (r )
Variance
L 1
(
r
m
)
p(ri )
i
i =0
=
2 u=
2 (r )
2/6/2014
1 M 1 N 1
f ( x, y )
=
MN =x 0=y 0
L 1
M 1 N 1
1
2
2
(
,
)
=
f
x
y
m
[
]
(ri m) p (ri )
MN =x 0=y 0
i =0
56

Enhancement
Local average intensity
L 1
msxy = ri psxy (ri )

i =0
sxy denotes a neighborhood

Local variance
=
2
sxy
2/6/2014
L 1
(r m
i =0
s xy
) psxy (ri )
57

Enhancement: Example
E f ( x, y ), if msxy k0 mG and k1 G sxy k2 G
g ( x, y ) =
otherwise
f ( x, y ),
mG : global mean;
G : global standard deviation
=
=
=
=
k0 0.4;
k1 0.02;
k2 0.4;
E 4
2/6/2014
58
Spatial Filtering
A spatial filter consists of (a) a neighborhood, and (b) a
predefined operation
Linear spatial filtering of an image of size MxN with a filter
of size mxn is given by the expression
=
g ( x, y )
w(s, t ) f ( x + s, y + t )
s=
a t=
b
2/6/2014
59
Spatial Filtering
2/6/2014
60
Spatial Correlation
The correlation of a filter w( x, y ) of size m n
with an image f ( x, y ), denoted as w( x, y ) f ( x, y )
w( x,=
y ) f ( x, y )
w(s, t ) f ( x + s, y + t )
s=
a t=
b
2/6/2014
61
Spatial Convolution
The convolution of a filter w( x, y ) of size m n
with an image f ( x, y ), denoted as w( x, y ) f ( x, y )
w( x,=
y ) f ( x, y )
w(s, t ) f ( x s, y t )
s=
a t=
b
2/6/2014
62
2/6/2014
63
Smoothing Spatial Filters

Smoothing filters are used for blurring and for noise
reduction
Blurring is used in removal of small details and bridging of
small gaps in lines or curves
Smoothing spatial filters include linear filters and nonlinear
filters.
2/6/2014
64
Spatial Smoothing Linear Filters

The general implementation for filtering an M N image
with a weighted averaging filter of size m n is given
a
g ( x, y ) =
w(s, t ) f ( x + s, y + t )
s=
a t=
b
w(s, t )
s=
a t=
b
where m
= 2a + 1,
2/6/2014
=
n 2b + 1.
65
Two Smoothing Averaging Filter Masks
2/6/2014
66
2/6/2014
67
Example: Gross Representation of Objects
2/6/2014
68
Order-statistic (Nonlinear) Filters

Nonlinear
Based on ordering (ranking) the pixels contained in the
filter mask
Replacing the value of the center pixel with the value
determined by the ranking result
E.g., median filter, max filter, min filter
2/6/2014
69
Example: Use of Median Filtering for Noise Reduction
2/6/2014
70
Sharpening Spatial Filters
Foundation
Laplacian Operator
Unsharp Masking and Highboost Filtering
2/6/2014
Using First-Order Derivatives for Nonlinear Image

Sharpening The Gradient
71
Sharpening Spatial Filters: Foundation
The first-order derivative of a one-dimensional function f(x)

is the difference
f
= f ( x + 1) f ( x)
x
The second-order derivative of f(x) as the difference
2 f
= f ( x + 1) + f ( x 1) 2 f ( x)
2
x
2/6/2014
72
2/6/2014
73
Sharpening Spatial Filters: Laplace Operator

The second-order isotropic derivative operator is the
Laplacian for a function (image) f(x,y)
2
2
f
2
f=
+ 2
2
x
y
2 f
= f ( x + 1, y ) + f ( x 1, y ) 2 f ( x, y )
2
x
2 f
=
f ( x, y + 1) + f ( x, y 1) 2 f ( x, y )
2
y
2 f = f ( x + 1, y ) + f ( x 1, y ) + f ( x, y + 1) + f ( x, y 1)
- 4 f ( x, y )
2/6/2014
74
2/6/2014
75

Image sharpening in the way of using the Laplacian:
g ( x=
, y ) f ( x, y ) + c 2 f ( x, y )
where,
f ( x, y ) is input image,
g ( x, y ) is sharpenend images,
=
c -1 if 2 f ( x, y ) corresponding to Fig. 3.37(a) or (b)
and c = 1 if either of the other two filters is used.
2/6/2014
76
2/6/2014
77
Unsharp masking
Sharpen images consists of subtracting an unsharp (smoothed)
version of an image from the original image
e.g., printing and publishing industry
Steps
1. Blur the original image

2. Subtract the blurred image from the original
3. Add the mask to the original
2/6/2014
78

Let f ( x, y ) denote the blurred image, unsharp masking is
g mask=
( x, y ) f ( x, y ) f ( x, y )
Then add a weighted portion of the mask back to the original
g=
k 0
( x, y ) f ( x, y ) + k * g mask ( x, y )
when k > 1, the process is referred to as highboost filtering.
2/6/2014
79
Unsharp Masking: Demo
2/6/2014
80
Unsharp Masking and Highboost Filtering: Example
2/6/2014
81
Image Sharpening based on First-Order Derivatives

For function f ( x, y ), the gradient of f at coordinates ( x, y )
is defined as
f
g x x
f grad( f ) =
g y f
y
The magnitude of vector f , denoted as M ( x, y )

Gradient Image
2/6/2014
M ( x, y=
) mag(f =
)
gx2 + g y2
82
The magnitude of vector f , denoted as M ( x, y )

M ( x, y=
) mag(f =
)
gx2 + g y2
M ( x, y ) | g x | + | g y |
z1
z4
z7
2/6/2014
z2
z5
z8
z3
z6
z9
M ( x, y ) =| z8 z5 | + | z6 z5 |
83
Roberts Cross-gradient Operators

M ( x, y ) | z9 z5 | + | z8 z6 |
Sobel Operators
z1
z4
z7
2/6/2014
z2
z5
z8
z3
z6
z9
M ( x, y ) | ( z7 + 2 z8 + z9 ) ( z1 + 2 z2 + z3 ) |
+ | ( z3 + 2 z6 + z9 ) ( z1 + 2 z4 + z7 ) |
84
2/6/2014
85
Example
2/6/2014
86
Example:
Combining
Spatial
Enhancement
Methods
Goal:
Enhance the
image by
sharpening it
and by bringing
out more of the
skeletal detail
2/6/2014
87
Example:
Combining
Spatial
Enhancement
Methods
Goal:
Enhance the
image by
sharpening it
and by bringing
out more of the
skeletal detail
2/6/2014
88

Intensity Transformation - Image Processing - Annotated Chap 3 G&W

Hochgeladen von

Dokumentinformationen

Originalbeschreibung:

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Intensity Transformation - Image Processing - Annotated Chap 3 G&W

Hochgeladen von

Copyright:

Verfügbare Formate

Lecture 2.

Spatial Domain vs. Transform Domain

image plane itself, directly process the intensity values of

process the transform coefficients, not directly process the

Spatial Domain Process

Spatial Domain Process

Spatial Domain Process

Intensity transformation function

Some Basic Intensity Transformation

Example: Image Negatives

Example: Log Transformations

Power-Law (Gamma) Transformations

Example: Gamma Transformations

Example: Gamma Transformations

Example: Gamma Transformations

Example: Gamma Transformations

Expands the range of intensity levels in an image so that it spans

Highlighting a specific range of intensities in an image often is of

Highlight the major

Measuring the actual

Local Histogram Processing

Using Histogram Statistics for Image Enhancement

a. T(r) is a strictly monotonically increasing function

a. T(r) is a strictly monotonically increasing function

T (r ) is continuous and differentiable.

Find the transformation function for equalizing

Example: Histogram Equalization

Example: Histogram Equalization

Example: Histogram Equalization

Let pr (r ) and pz ( z ) denote the continous probability

Define a random variable z with the probability

Histogram Matching: Procedure

Histogram Matching: Example

Find the transformation function that will produce an image

Histogram Matching: Example

Find the histogram equalization transformation for the specified histogram

The transformation function

Histogram Matching: Discrete Cases

Use the specified PDF and obtain the transformation function

Example: Histogram Matching

Example: Histogram Matching

Example: Histogram Matching

Example: Histogram Matching

Example: Histogram Matching

Example: Histogram Matching

Example: Histogram Matching

Example: Histogram Matching

Example: Histogram Matching

Example: Histogram Matching

Local Histogram Processing

Local Histogram Processing: Example

Using Histogram Statistics for Image

Using Histogram Statistics for Image

msxy = ri psxy (ri )

sxy denotes a neighborhood

Using Histogram Statistics for Image

G : global standard deviation

Smoothing Spatial Filters

Spatial Smoothing Linear Filters

Two Smoothing Averaging Filter Masks

Example: Gross Representation of Objects

Order-statistic (Nonlinear) Filters