Digital Image Processing
Digital Image Processing
Lecture 1
Introduction &
Fundamentals
Pixel
— the elements of a digital image
Sent by submarine
cable between London
and New York, the
transportation time
was reduced to less
than three hours from
Copyright@Md. Shahid Uz Zaman 3
more than a week
Origins of Digital Image
Processing
f ( x, y ) = i( x, yg) r ( x, y )
► Illumination
Lumen — A unit of light flow or luminous flux
Lumen per square meter (lm/m2) — The metric unit of measure for
illuminance of a surface
On a cloudy day, the sun may produce less than 10,000 lm/m2 of illumination
on the surface of the Earth
► Reflectance
b=M×N×k
► Spatial resolution
— A measure of the smallest discernible detail in an
image
— stated with line pairs per unit distance, dots
(pixels) per unit distance, dots per inch (dpi)
► Intensity resolution
— The smallest discernible change in intensity level
— stated with 8 bits, 12 bits, 16 bits, etc.
► Neighborhood
► Adjacency
► Connectivity
► Paths
► Adjacency
Let V be the set of intensity values
► Adjacency
Let V be the set of intensity values
(ii) q is in the set ND(p) and the set N4(p) ∩ N4(q) has no pixels whose values are
from V.
► Path
A (digital) path (or curve) from pixel p with coordinates (x0, y0) to pixel q with
coordinates (xn, yn) is a sequence of distinct pixels with coordinates
We can define 4-, 8-, and m-paths based on the type of adjacency used.
0 1 1 0 1 1 0 1
1
0 2 0 0 2 0 0 2
0
0 0 1 0 0 1 0 0
1
0 1 1 0 1 1 0 1
1
0 2 0 0 2 0 0 2
0
8-adjacent
0 0 1 0 0 1 0 0
1
0 1 1 0 1 1 0 1
1
0 2 0 0 2 0 0 2
0 m-adjacent
8-adjacent
0 0 1 0 0 1 0 0
1
0 1 1
1,1 1,2 1,3 0 1 1 0 1
1
0 2 0
2,1 2,2 2,3 0 2 0 0 2
0 m-adjacent
8-adjacent
0 0 1
3,1 3,2 3,3 0 0 1 0 0
The 8-path from (1,3) to (3,3):
1
(i) (1,3), (1,2), (2,2), (3,3)
The m-path from (1,3) to (3,3):
(1,3), (1,2), (2,2), (3,3)
(ii) (1,3), (2,2), (3,3)
► Connected in S
Let S represent a subset of pixels in an image. Two pixels p
with coordinates (x0, y0) and q with coordinates (xn, yn) are
said to be connected in S if there exists a path
Where
∀i, 0 ≤ i ≤ n, ( xi , yi ) ∈ S
The boundary of the region R is the set of pixels in the region that
have one or more neighbors that are not in R.
If R happens to be an entire image, then its boundary is defined as
the set of pixels in the first and last rows and columns of the image.
Region 1
1 1 1
1 0 1
0 1 0 Region 2
0 0 1
1 1 1
1 1 1
Part 1
1 1 1
1 0 1
0 1 0 Part 2
0 0 1
1 1 1
1 1 1
Region 1
1 1 1
1 0 1
0 1 0 Region 2
0 0 1
1 1 1
1 1 1
foregroun
1 1 1 d
1 0 1
0 1 0 background
0 0 1
1 1 1
1 1 1