Professional Documents
Culture Documents
Unit 1
Unit 1
Unit 1
Unit-1
Gonzalez, R. C. and Woods, R. E., "Digital Image
Processing", Prentice Hall, 3rd Ed.
Jain, A. K., "Fundamentals of Digital Image Processing",
PHI Learning, 1st Ed.
Bernd, J., "Digital Image Processing", Springer, 6th Ed.
Burger, W. and Burge, M. J., "Principles of Digital Image
Processing", Springer
Scherzer, O., " Handbook of Mathematical Methods in
Imaging", Springer
Image Acquisition Process
Weeks 1 & 2 5
Introduction
► What is Digital Image Processing?
Digital Image
— a two-dimensional function f ( x, y)
x and y are spatial coordinates
The amplitude of f is called intensity or gray level at the point (x, y)
Pixel
— the elements of a digital image
Weeks 1 & 2 6
A Simple Image Formation Model
f ( x, y ) i ( x, y ) r ( x, y )
Weeks 1 & 2 7
Some Typical Ranges of Reflectance
► Reflectance
Digitizing the
coordinate
values
Digitizing the
amplitude
values
Weeks 1 & 2 9
Image Sampling and Quantization
Weeks 1 & 2 10
Representing Digital Images
Weeks 1 & 2 11
Representing Digital Images
Weeks 1 & 2 12
Representing Digital Images
Weeks 1 & 2 13
Representing Digital Images
b=M×N×k
Weeks 1 & 2 14
Representing Digital Images
Weeks 1 & 2 15
What is a Digital Image? (cont…)
►Common image formats include:
1 sample per point (B&W or Grayscale)
3 samples per point (Red, Green, and Blue)
4 samples per point (Red, Green, Blue, and “Alpha”,
a.k.a. Opacity)
► Or the domain of f:
Image Morphological
Restoration Processing
Image
Segmentation
Enhancement
Image Object
Acquisition Recognition
Representation
Problem Domain
& Description
Colour Image Image
Processing Compression
Key Stages in Digital Image Processing:
Image Aquisition
Images taken from Gonzalez & Woods, Digital Image Processing (2002)
Image Morphological
Restoration Processing
Image
Segmentation
Enhancement
Image Object
Acquisition Recognition
Representation
Problem Domain
& Description
Colour Image Image
Processing Compression
Key Stages in Digital Image Processing:
Image Enhancement
Images taken from Gonzalez & Woods, Digital Image Processing (2002)
Image Morphological
Restoration Processing
Image
Segmentation
Enhancement
Image Object
Acquisition Recognition
Representation
Problem Domain
& Description
Colour Image Image
Processing Compression
Key Stages in Digital Image Processing:
Image Restoration
Images taken from Gonzalez & Woods, Digital Image Processing (2002)
Image Morphological
Restoration Processing
Image
Segmentation
Enhancement
Image Object
Acquisition Recognition
Representation
Problem Domain
& Description
Colour Image Image
Processing Compression
Key Stages in Digital Image Processing:
Morphological Processing
Images taken from Gonzalez & Woods, Digital Image Processing (2002)
Image Morphological
Restoration Processing
Image
Segmentation
Enhancement
Image Object
Acquisition Recognition
Representation
Problem Domain
& Description
Colour Image Image
Processing Compression
Key Stages in Digital Image Processing:
Segmentation
Images taken from Gonzalez & Woods, Digital Image Processing (2002)
Image Morphological
Restoration Processing
Image
Segmentation
Enhancement
Image Object
Acquisition Recognition
Representation
Problem Domain
& Description
Colour Image Image
Processing Compression
Key Stages in Digital Image Processing:
Object Recognition
Images taken from Gonzalez & Woods, Digital Image Processing (2002)
Image Morphological
Restoration Processing
Image
Segmentation
Enhancement
Image Object
Acquisition Recognition
Representation
Problem Domain
& Description
Colour Image Image
Processing Compression
Key Stages in Digital Image Processing:
Representation & Description
Images taken from Gonzalez & Woods, Digital Image Processing (2002)
Image Morphological
Restoration Processing
Image
Segmentation
Enhancement
Image Object
Acquisition Recognition
Representation
Problem Domain
& Description
Colour Image Image
Processing Compression
Key Stages in Digital Image Processing:
Image Compression
Image Morphological
Restoration Processing
Image
Segmentation
Enhancement
Image Object
Acquisition Recognition
Representation
Problem Domain
& Description
Colour Image Image
Processing Compression
Key Stages in Digital Image Processing:
Colour Image Processing
Image Morphological
Restoration Processing
Image
Segmentation
Enhancement
Image Object
Acquisition Recognition
Representation
Problem Domain
& Description
Colour Image Image
Processing Compression
Applications
&
Research Topics
Document Handling
Signature Verification
Biometrics
Fingerprint Verification /
Identification
Fingerprint Identification Research at
UNR
Minutiae Matching
Delaunay Triangulation
Object Recognition
Object Recognition Research
reference view 1 reference view 2
► Neighborhood
► Adjacency
► Connectivity
► Paths
Weeks 1 & 2 56
Basic Relationships Between Pixels
Weeks 1 & 2 57
(x, y+1)
N4(p)
(x-1, y) (x, y) (x+1, y)
(x-1, y+1)
(x-1, y-1) (x, y-1) (x+1, y+1)
(x+1, y-1)
ND(p)
(x, y)
(x-1, y-1) (x+1, y-1)
58
Basic Relationships Between Pixels
► Adjacency
Let V be the set of intensity values
Weeks 1 & 2 59
Basic Relationships Between Pixels
► 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.
Weeks 1 & 2 60
Basic Relationships Between Pixels
► 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.
Weeks 1 & 2 61
Examples: Adjacency and Path
V = {1, 2}
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
Weeks 1 & 2 62
Examples: Adjacency and Path
V = {1, 2}
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
8-adjacent
Weeks 1 & 2 63
Examples: Adjacency and Path
V = {1, 2}
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
8-adjacent m-adjacent
Weeks 1 & 2 64
Examples: Adjacency and Path
V = {1, 2}
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
0 0 1
3,1 3,2 3,3 0 0 1 0 0 1
8-adjacent m-adjacent
The 8-path from (1,3) to (3,3): The m-path from (1,3) to (3,3):
(i) (1,3), (1,2), (2,2), (3,3) (1,3), (1,2), (2,2), (3,3)
(ii) (1,3), (2,2), (3,3)
Weeks 1 & 2 65
Basic Relationships Between Pixels
► 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
Weeks 1 & 2 66
Basic Relationships Between Pixels
Weeks 1 & 2 67
Basic Relationships Between Pixels
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.
Weeks 1 & 2 68
Question 1
1 1 1
Region 1
1 0 1
0 1 0
0 0 1 Region 2
1 1 1
1 1 1
Weeks 1 & 2 69
Question 2
1 1 1
Part 1
1 0 1
0 1 0
0 0 1 Part 2
1 1 1
1 1 1
Weeks 1 & 2 70
► In the following arrangement of pixels, the two
regions (of 1s) are disjoint (if 4-adjacency is used)
1 1 1
Region 1
1 0 1
0 1 0
0 0 1 Region 2
1 1 1
1 1 1
Weeks 1 & 2 71
► In the following arrangement of pixels, the two
regions (of 1s) are disjoint (if 4-adjacency is used)
1 1 1
foreground
1 0 1
0 1 0
0 0 1 background
1 1 1
1 1 1
Weeks 1 & 2 72
Distance Measures
b. D(p, q) = D(q, p)
Weeks 1 & 2 73
Distance Measures
a. Euclidean Distance :
De(p, q) = [(x-s)2 + (y-t)2]1/2
Weeks 1 & 2 74
Introduction to Mathematical Operations in
DIP
► Array vs. Matrix Operation
Weeks 1 & 2 75
Arithmetic Operations
Weeks 1 & 2 77
Example: Addition of Noisy Images for Noise Reduction
Weeks 1 & 2 78
Example: Addition of Noisy Images for Noise Reduction
Weeks 1 & 2 79
Weeks 1 & 2 80
An Example of Image Subtraction: Mask Mode Radiography
Weeks 1 & 2 81
Weeks 1 & 2 82
Set and Logical Operations
Weeks 1 & 2 84
Set and Logical Operations
► Let A be the elements of a gray-scale image
The elements of A are triplets of the form (x, y, z), where
x and y are spatial coordinates and z denotes the intensity
at the point (x, y).
A {( x, y, z) | z f ( x, y)}
► The complement of A is denoted Ac
Ac {( x, y, K z ) | ( x, y, z ) A}
K 2k 1; k is the number of intensity bits used to represent z
Weeks 1 & 2 85
Set and Logical Operations
► The union of two gray-scale images (sets) A and B is
defined as the set
A B {max(a, b) | a A, b B}
z
Weeks 1 & 2 86
Set and Logical Operations
Weeks 1 & 2 87
Set and Logical Operations
Weeks 1 & 2 88
Spatial Operations
► Single-pixel operations
► Neighborhood operations
► Geometric spatial transformations
Weeks 1 & 2 89
Spatial Operations
► Single-pixel operations
Alter the values of an image’s pixels based on the intensity.
s T ( z)
e.g.,
Weeks 1 & 2 90
Spatial Operations
► Neighborhood operations
Weeks 1 & 2 91
Spatial Operations
► Neighborhood operations
Weeks 1 & 2 92
Geometric Spatial Transformations
( x, y) T{(v, w)}
— intensity interpolation that assigns intensity values to the spatially
transformed pixels.
► Affine transform
t11 t12 0
x y 1 v w 1 t21 t22 0
t31 t32 1
Weeks 1 & 2 93
Weeks 1 & 2 94
Image Registration
Weeks 1 & 2 95
Image Registration
x c1v c2 w c3vw c4
y c5v c6 w c7 vw c8
Weeks 1 & 2 96
Image Registration
Weeks 1 & 2 97
Image Transform
M 1 N 1
f ( x, y ) T (u, v) s( x, y, u, v) 2
u 0 v 0
Weeks 1 & 2 99
Image Transform
M 1 N 1
T (u, v) f ( x, y )e j 2 ( ux / M vy / N )
x 0 y 0
M 1 N 1
1
f ( x, y )
MN
T (u, v)e
u 0 v 0
j 2 ( ux / M vy / N )
p( z ) 1
k 0
k
k 0