Introduction To Digital Image Processing
Introduction To Digital Image Processing
Prerequisites:
- Signals and Systems
- Digital Signal Processing
- Computer Programming (MATLAB or C++)
Textbook:
- Digital Image Processing, third edition,
by R. Gonzalez and R. Woods,
Introduction
Contents
This lecture will cover:
What is a digital image?
What is digital image processing?
State of the art examples of digital image
processing
What is pixel?
10
1 pixel
11
12
Gray level?
The value of the pixel at any point denotes
the intensity of image at that location, and
that is also known as gray level.
13
14
15
16
17
18
19
20
21
22
23
Examples: GIS
Geographic Information Systems
Digital image processing techniques are used
extensively to manipulate satellite imagery
Terrain classification
Meteorology
25
Examples: HCI
26
Digital images
Basic terms of digital imaging
Pixel
Grayscale
Concept of Dimensions
28
1DSignal
2DImage
29
Shades:
30
White in Binary?
White in 8 bit?
31
Image Size
32
Grayscaleimage,having256differentshades
ofgray
NoofRows=1024
NoofColumns=1024
WhatistheimagesizeinMb?
33
34
75
75
75
75
75
75
128 128 128 200 200 255 255 200 200 200
128 128 128 255 255 200 200 200 75
175 175 175 225 225 225 75
75
75
75 100
75 100
75
75
75
35
35
35
35
35
35
35
35
35
35
75
75
75
35
36
1024
512
256
128
64
32
37
moirpattern
Properlysampledimage
Spatialaliasinginthe
formofamoirpattern
38
A2
A3
A4
A5
A6
A7
A8
A9
39
A1
A2
A3
A4
A5
A6
A7
A8
A9
40
41
Neighbors of a Pixel
42
Adjacency
Two pixels are connected if they are neighbors
and their gray levels satisfy some specified
criterion of similarity.
For example, in a binary image two pixels are
connected if they are 4-neighbors and have
same value (0/1).
Types of Adjacency
43
4-adjacency: Two pixels p and q with values from V are 4adjacent if q is in the set .
8-adjacency: Two pixels p and q with values from V are 8adjacent if q is in the set .
m-adjacency: Two pixels p and q with values from V are
m-adjacent if,
q is in
q is in and the set [ ] is empty
(has no pixels whose values are from V).
Types of Adjacency
44
45
Types of Adjacency
In this example, we can note that to connect between
two pixels (finding a path between two pixels):
In 8-adjacency way, you can find multiple paths
between two pixels
While, in m-adjacency, you can find only one path
between two pixels
So, m-adjacency has eliminated the multiple path
connection that has been generated by the 8adjacency.
Distance Measures
46
Chessboard distance ()
47
Distance Measures
Given pixels p, q and z with coordinates
(x, y), (s, t), (u, v) respectively,
the distance function D has following properties:
a.
[]
b.
c.