Digitization and Pixel Relationships

Digital Image Processing
Operations
Overview
•This lecture will cover:
•Digitization
– Quantization
– Resolutions
•Pixel Relationships
– Neighbourhood pixels
– Connectivity
– Adjacency
– Path
What is a Digital Image?
•A digital image is a representation of a two-
Images taken from Gonzalez & Woods, Digital Image Processing (2002)
dimensional image as a finite set of digital

values, called picture elements or pixels
What is a Digital Image?
(cont…)
•Pixel values typically represent gray levels,
Images taken from Gonzalez & Woods, Digital Image Processing (2002)
colours, heights, opacities etc

•Remember digitization implies that a digital
image is an approximation of a real scene
1 pixel
Digital Image
• picture element or pixel or
pel
• Typical image size:
– 64 X 64, 128 X 128
– 256 X 256, 640 X 480 1024 X 1024
Gray scale Image
Sampling - Grids
Sampling
Digitization
Original Image Digitized Image

Reduction in Quantization level reduces
quality
Digital Image
• The value of the function f (x, y) at every point

indexed by a row and a column is called grey value or
intensity of the image.
• Resolution is an important characteristic of an

imaging system. It is the ability of the imaging
system to produce the smallest discernible details,
i.e., the smallest sized object clearly, and differentiate
it from the neighboring small objects that are present
in the image.
Useful definitions
• Spatial resolution depends on two parameters—the
number of pixels of the image and the number of
bits necessary for adequate intensity resolution,
referred to as the bit depth.
• Bit depth The number of bits necessary to encode

the pixel value is called bit depth. Bit depth is a
power of two.
Intensity Level Resolution
•Intensity level resolution refers to the number of
intensity levels used to represent the image
– The more intensity levels used, the finer the level of detail
discernible in an image
– Intensity level resolution is usually given in terms of the
number of bits used to store each intensity level
Number of Intensity
Number of Bits Examples
Levels
1 2 0, 1
2 4 00, 01, 10, 11
4 16 0000, 0101, 1111
8 256 00110011, 01010101
16 65,536 1010101010101010
Spatial Resolution..contd
1024 * 1024 512 * 512 256 * 256
128 * 128 64 * 64 32 * 32
Intensity Level Resolution (cont…)
256 grey levels (8 bits per pixel) 128 grey levels (7 bpp) 64 grey levels (6 bpp) 32 grey levels (5 bpp)
16 grey levels (4 bpp) 8 grey levels (3 bpp) 4 grey levels (2 bpp) 2 grey levels (1 bpp)
Session3 Overview
•Digitization
– Quantization
– Resolutions
•This lecture will cover:
•Pixel Relationships
– Neighbourhood pixels
– Connectivity
– Adjacency
– Path
Neighbours of a Pixel
Connectivity
Regions and boundaries
• Let R be a subset of pixels in an image. We call R a

region of the image if R is a connected set.
• The boundary (also called border or contour) of a region

R is the set of pixels in the region that have one or more
neighbours that are not in R
Distance Measures
 Symmetric
 Inequality
• p(x,y) and q(s,t)
• Euclidean Distance:
• City Block Distance
• Chess Board Distance:

Problems
1. A)Let V={0,1}. Compute the De, D4, D8 distances between two pixels
p and q. Let the pixel coordinates of p and q be (3,0) and (2,3)
respectively, for the image shown below:
B)compute the lengths of the shortest 4, 8, and m-path between p and

q, in the image sample given below:
0 1 2 3
0 0 1 1 1 De = √10
1 1 0 0 1
D4 = 1 + 3 = 4
2 1 1 1 11 q
3 1 1 1 1
D8 = max(1,3) = 3
p
Problems
2. A) Let V = {0, 1} and compute the lengths of the shortest 4, 8, and m-

path between p and q, in the image sample given below. If a particular
path does not exist between these points, explain why.
B) Will you get the same result if V = {1, 2}. Justify

Problems
2. A) Let V = {0, 1} and compute the lengths of the shortest 4, 8, and m-

path between p and q, in the image sample given below. If a particular
path does not exist between these points, explain why.
B) Will you get the same result if V = {1, 2}. Justify

Digitization and Pixel Relationships

Uploaded by

Copyright:

Available Formats

Digitization and Pixel Relationships

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Digitization and Pixel Relationships

Uploaded by

Copyright:

Available Formats

Digital Image Processing

dimensional image as a finite set of digital

colours, heights, opacities etc

Original Image Digitized Image

• The value of the function f (x, y) at every point

• Resolution is an important characteristic of an

• Bit depth The number of bits necessary to encode

• Let R be a subset of pixels in an image. We call R a

• The boundary (also called border or contour) of a region

• City Block Distance

• Chess Board Distance:

B)compute the lengths of the shortest 4, 8, and m-path between p and

2. A) Let V = {0, 1} and compute the lengths of the shortest 4, 8, and m-

B) Will you get the same result if V = {1, 2}. Justify

2. A) Let V = {0, 1} and compute the lengths of the shortest 4, 8, and m-

B) Will you get the same result if V = {1, 2}. Justify

You might also like