Digital Image Processing

Chapter 2: Digital Image

Fundamentals
 Image formation in the eye
 Brightness adaptation and
discrimination
 Brightness discrimination
 Perceived
brightness
 Simultaneous contrast
 Optical
illusion
Image Sensing and Acquisition
 Image acquisition using a single
sensor
 Using
sensor
strips
 A simple
image
formation
model
 Illumination and reflectance
f ( x, y )  i ( x, y ) r ( x, y )
Image Sampling and Quantization
 Sampling
and
quantization
 Representing digital images
 Number of storage bits
Some Basic Relationships Between
Pixels

 Neighbors of a pixel
 N 4 ( p) : 4-neighbors of p

( x  1, y ), ( x  1, y ) , ( x, y  1) , ( x, y  1)

N D ( p) : four diagonal neighbors of p

( x  1, y  1) , ( x  1, y  1) , ( x  1, y  1) ,
( x  1, y  1)

N8 ( p) : 8-neighbors of p
N4 ( p) and N D ( p)
 Adjacency
 V : The set of gray-level values used
to define adjacency
 4-adjacency: Two pixels p and q with
values from V are 4-adjacency if q is in
the set N4 ( p)
 8-adjacency: Two pixels p and q with
values from V are 8-adjacency if q is in
the set N8 ( p)
 m-adjacency (mixed adjacency): Two
pixels p and q with values from V are
m-adjacency if
 q is in N4 ( p) , or
 q is in N ( p) and the set N 4 ( p)  N 4 (q)
D
has no pixels whose values are from V
 Path
 A path from p with coordinates ( x, y ) to
pixel q with coordinates ( s, t ) is a
sequence of distinct pixels with
coordinates
 ( x0 , y0 ), ( x1 , y1 ) ,…, ( xn , yn )
where ( x0 , y0 )= ( x, y ) , ( xn , yn ) = ( s, t ) ,
and pixels ( xi , yi ) and ( xi 1 , yi 1 ) are
adjacent
 Distance measures
 Euclidean distance
1
De ( p, q)  [( x  s) 2  ( y  t ) ]
2 2

 City-block distance
D4 ( p, q) | ( x  s) |  | ( y  t ) |

 Chessboard distance
D8 ( p, q)  max(| ( x  s) |, | ( y  t ) |)
City-block distance Chessboard distance
 Dm distance: The shortest m-path
between the points
An Introduction to the Mathematical
Tools Used in Digital Image Processing

 Linear operation
 H is said to be a linear operator if, for
any two images f and g and any two
scalars a and b,

H (af  bg )  aH ( f )  bH ( g )
 Arithmetic
operations
 Addition
 Arithmetic
operations
 Subtraction
 Digital
subtraction
angiography
 Shading correction
 Image multiplication
 Set operations
 Complements
 Logical
operations