Scribd
Upload
92 views14 pages

UEI721 Digital Image Processing: Pixel Relationship

This document discusses basic relationships between pixels in digital image processing, including neighborhood, adjacency, connectivity, paths, regions, and boundaries. It defines 4-neighbors and 8-neighbors of a pixel and 4-adjacency and 8-adjacency between pixels. A path is described as a sequence of adjacent pixels. Connectedness within a pixel subset is discussed. Regions are defined as connected subsets and boundaries are pixel borders between regions. Foreground and background are also defined. Distance measures like Euclidean, city block, and chessboard distances are also introduced.

Uploaded by

Shwetank Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
92 views14 pages

UEI721 Digital Image Processing: Pixel Relationship

This document discusses basic relationships between pixels in digital image processing, including neighborhood, adjacency, connectivity, paths, regions, and boundaries. It defines 4-neighbors and 8-neighbors of a pixel and 4-adjacency and 8-adjacency between pixels. A path is described as a sequence of adjacent pixels. Connectedness within a pixel subset is discussed. Regions are defined as connected subsets and boundaries are pixel borders between regions. Foreground and background are also defined. Distance measures like Euclidean, city block, and chessboard distances are also introduced.

Uploaded by

Shwetank Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 14

UEI721 Digital Image Processing

Pixel Relationship

Course Instructor : Vishal Srivastava


Electrical and Instrumentation Engineering Department
Thapar Institute of Engineering and Technology, Patiala
Basic Relationships Between Pixels

• Neighborhood

• Adjacency

• Connectivity

• Paths

• Regions and boundaries


Basic Relationships Between Pixels
• Neighbors of a pixel p at coordinates (x,y)

 4-neighbors of p, denoted by N4(p):


(x-1, y), (x+1, y), (x,y-1), and (x, y+1).

 4 diagonal neighbors of p, denoted by ND(p):


(x-1, y-1), (x+1, y+1), (x+1,y-1), and (x-1, y+1).

 8 neighbors of p, denoted N8(p)


N8(p) = N4(p) U ND(p)
Basic Relationships Between Pixels

Adjacency

  Two pixels are linked if they are neighbors and their gray levels satisfy few detailed pattern of similarity.

For instance, in a binary image two pixels are connected if they are 4-neighbors and have same value (0/1).

Let V be the set of intensity values (V ϵ I)

4-adjacency: Two pixels p and q with values from V are 4-adjacent if q is in the set N 4(p).

8-adjacency: Two pixels p and q with values from V are 8-adjacent if q is in the set N 8(p).
Basic Relationships Between Pixels

• Adjacency
Let V be the set of intensity values (V ϵ I)

m-adjacency: Two pixels p and q with values from V are m-adjacent if

(i) q is in the set N4(p), or

(ii) q is in the set ND(p) and the set N4(p) ∩ N4(q) has no pixels whose values are from V.
Basic Relationships Between Pixels
• Path
 A (digital) path (or curve) from pixel p with coordinates (x 0, y0) to pixel q with coordinates (xn, yn) is a
sequence of distinct pixels with coordinates

(x0, y0), (x1, y1), …, (xn, yn)

Where (xi, yi) and (xi-1, yi-1) are adjacent for 1 ≤ i ≤ n.

 Here n is the length of the path.

 If (x0, y0) = (xn, yn), the path is closed path.

 We can define 4-, 8-, and m-paths based on the type of adjacency used.
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
4-adjacent 8-adjacent m-adjacent
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

(x0, y0), (x1, y1), …, (xn, yn)

Where
i, 0  i  n, ( xi , yi )  S
Basic Relationships Between Pixels

Let S represent a subset of pixels in an image

• For every pixel p in S, the set of pixels in S that are connected to p is called a connected component
of S.

• If S has only one connected component, then S is called Connected Set.

• We call R a region of the image if R is a connected set

• Two regions, Ri and Rj are said to be adjacent if their union forms a connected set.
• Regions that are not to be adjacent are said to be disjoint.
Basic Relationships Between Pixels

• Boundary (or border)

 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.

• Foreground and background

 An image contains K disjoint regions, R k, k = 1, 2, …, K. Let Ru denote the union of all the K regions, and let (R u)c
denote its complement.
All the points in Ru is called foreground;
All the points in (Ru)c is called background.
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. D(p, q) ≥ 0 [D(p, q) = 0, if p = q]

b. D(p, q) = D(q, p) (It must be symmetric)

c. D(p, z) ≤ D(p, q) + D(q, z)


Distance Measures
The following are the different Distance measures:

a. Euclidean Distance :
De(p, q) = [(x-s)2 + (y-t)2]1/2

b. City Block Distance:


D4(p, q) = |x-s| + |y-t|

c. Chess Board Distance:


D8(p, q) = max(|x-s|, |y-t|)
Slide Credits and References
Digital Image Processing Rafael C. Gonzalez & Richard E. Woods 4e

P A V Krishna Rao & D.Siva Phanindra, Lectures on Digital Image Processing

Stanford Digital Image Processing Course

Lecture “Histogram Equalization of Grey Scale Images” by Prof. Saravanan Vijayakumaran

Lectures ” Image Processing and Interpretation” by Prof. Bebis (University of Nevada)

You might also like