Scribd
Upload
33 views

Lect 5 Image (Quantization) Post

This document discusses basic relationships between pixels in digital images, including: - Neighborhood and adjacency definitions for pixels based on 4-connectivity and 8-connectivity. - Connectivity between pixels is defined based on them being neighbors and having grayscale values within a specified range. - Adjacency can be 4-adjacency, 8-adjacency, or mixed adjacency to avoid ambiguities in path connections. - Paths between pixels are defined based on the adjacency type, as are connected components and region boundaries in an image. - Distance measures for pixels include Euclidean, city block, and chessboard distances. - Neighborhood arithmetic and logic operations are used for tasks

Uploaded by

deepchouhanaman
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
33 views

Lect 5 Image (Quantization) Post

This document discusses basic relationships between pixels in digital images, including: - Neighborhood and adjacency definitions for pixels based on 4-connectivity and 8-connectivity. - Connectivity between pixels is defined based on them being neighbors and having grayscale values within a specified range. - Adjacency can be 4-adjacency, 8-adjacency, or mixed adjacency to avoid ambiguities in path connections. - Paths between pixels are defined based on the adjacency type, as are connected components and region boundaries in an image. - Distance measures for pixels include Euclidean, city block, and chessboard distances. - Neighborhood arithmetic and logic operations are used for tasks

Uploaded by

deepchouhanaman
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 36

Relationships between pixels and adjacency

Dr. Sakshi Arora


Basic Relationships Between Pixels
• Neighbourhood
• Adjacency
• Connectivity
• Paths
• Regions and boundaries
Neighbours of a Pixel

• There are two different ways to define the


neighbors of a pixel p located at (x,y).

• The four diagonal neighbors of p(x,y) are


given by, (x+1, y+1), (x+1, y-1), (x-1, y+1),
(x-1 ,y-1)
• This set is denoted by N D(P).
• Each of them are at Euclidean distance of
1.414 from P.
Neighbours of a Pixel

• The points ND(P) and N4(P) are together known as 8-neighbors of the point P, denoted by N8(P).

• Some of the points in the N4, ND and N8 may fall outside image when P lies on the border of image.
Neighbours of a Pixel
Open Neighbourhood

Closed Neighbourhood
Adjacency and connectivity
• Two pixels are connected if: –
• They are neighbors (i.e. adjacent in some sense).
• Their gray levels satisfy a specified criterion of similarity.
• V is the set of gray-level values used to define adjacency.
(e.g. V={1} for adjacency of pixels of value 1)
Adjacency and connectivity
• In a binary image two pixels are connected if they are 4-neighbors and have
same value (0/1).
• Let v: a set of intensity values used to define adjacency and connectivity.
• In a binary Image v={1}, if we are referring to adjacency of pixels with value 1.
• In a Gray scale image, the idea is the same, but v typically contains more
elements, for example v= {180, 181, 182,....,200}.
• If the possible intensity values are 0 to 255, v set could be any subset of these
256 values.
Types of adjacency

• 4-adjacency: Two pixels p and q with values from v are 4-adjacent if q is in the
set N4 (p).
• 8-adjacency: Two pixels p and q with values from v are 8-adjacent if q is in the
set N8 (p).
• m-adjacency (mixed): two pixels p and q with values from v are m-adjacent
• if: q is in N4 (p) or q is in ND (P) and The set N4 (p) ∩ N4 (q) has no pixel whose values
are from v (No intersection).
• Pixel arrangement as shown in figure for v= {1}
M-Adjacency
Adjacency and connectivity
Adjacency and connectivity
• Mixed adjacency is a modification of 8-adjacency ''introduced to eliminate the
ambiguities that often arise when 8- adjacency is used. (eliminate multiple path
connection)
• 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 8-adjacency
Solve
Connectivity
• To determine whether the pixels are adjacent in some
sense.
• Let V be the set of gray-level values used to define
connectivity; then Two pixels p, q that have values
from the set V are:
• a. 4-connected, if q is in the set N4(p)
• b. 8-connected, if q is in the set N8(p)
• c. m-connected, iff
• i. q is in N4(p) or
• ii. q is in ND(p) and the set N4 (p) ∩ N4 (q) is empty
Adjacency/Connectivity
Solve
Solve
To solve
Solve
• Q3 (i)
Solve
• Q3 (ii) V = [2,6]……
• Path does not exist between p and q.
Path
• A path from pixel p with coordinates (x, y) to pixel q with coordinates
(s, t) is a sequence of distinct pixels with coordinates:
(x0, y0), (x1, y1), (x2, y2) … (xn, yn),
where (x0, y0)=(x, y)
and (xn, yn)=(s, t);
and (xi, yi ) is adjacent to (xi-1, yi-1).

• Here n is the length of the path.

• We can define 4-, 8-, and m-paths based on type of adjacency used.
Path
Connected Components
• If p and q are pixels of an image subset S then p is connected to q in S,
if there is a path from p to q consisting entirely of pixels in S.

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


Regions and Boundaries
• A subset R of pixels in an image is called a Region of the image if R is a
connected set.
000000
010010
011010
010110
000000
• 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 entire Image?
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, iff p = q]
• b. D(p, q) = D(q, p)
• c. D(p, z) ≤ D(p, q) + D(q, z)
Distance measures:
• Euclidean Distance :
De(p, q) = [(x-s)2 + (y-t)2 ]1/2

• City Block Distance:


D4(p, q) = |x-s| + |y-t|
Distance measures
• Chess Board Distance:
D8(p, q) = max(|x-s|, |y-t|)
Distance Measures
To Solve
To Solve
To Solve
Distance Measures
Neighborhood based arithmetic/Logic
• Value assigned to a pixel at position ‘e’ is a function of its neighbors
and a set of window functions.
Arithmetic/Logic Operations
• Tasks done using neighborhood processing: –
• Smoothing / averaging
• Noise removal / filtering
• Edge detection
• Contrast enhancement
Thank you

You might also like