Relationship between pixels
Neighbors of a pixel
– 4-neighbors (N,S,W,E pixels) == N4(p).
A pixel p at coordinates (x,y) has
four horizontal and vertical neighbors:
• (x+1,y), (x-1, y), (x,y+1), (x, y-1)
– You can add the four diagonal neighbors to give the 8-
neighbor set. Diagonal neighbors == ND(p).
– 8-neighbors: include diagonal pixels == N8(p).
Pixel Connectivity
Connectivity -> to trace contours, define object boundaries,
segmentation.
In order for two pixels to be connected, they must be
“neighbors” sharing a common property—satisfy some
similarity criterion.
In a binary image with pixel values “0” and “1”,
two neighboring pixels are said to be connected if they have
the same value.
Let V: Set of gray level values used to define
connectivity; e.g., V={1}.
Connectivity
4-adjacency: Two pixels p and q with values
in V are 4-adjacent if q is in the set N4(p).
8-adjacency: q is in the set N8(p).

A 4 (8)-path from p to q is a sequence of points
p=p0, p1, …, pn=q such that each pn+1 is
4 (8)-adjacent to pn
Connected components
Let S represent a subset of pixels in an image.
If p and q are in S, p is connected to q in S if there is a path
from p to q entirely in S.
A connected component is a maximal set of pixels in S that
is connected.
There can be more than one such set within a given S.
We assume that points r and t have been visited and labeled.
Now we visit point p: p=0: no action; p=1: check r and t.
– both r and t = 0; assign new label to p;
– only one of r and t is a 1. assign its label to p;
– both r and t are 1:
• same label => assign it to p;
• different label=> assign one of them to p and
establish equivalence between labels (they are the same.)
Second pass over the image to merge equivalent labels.
r
p
t
4-connected component labeling for points
Exercise
Develop a similar algorithm for 8-connectivity.
Border following algorithm
Problems with 4- and 8-connectivity
Neither method is satisfactory.
– Why? A simple closed curve divides a plane into
two simply connected regions.
– However, neither 4-connectivity nor 8-connectivity
can achieve this for discrete labeled components.
– Give some examples..
Distance Measures
Distance Metric
For pixels p,q, and z, with coordinates (x,y), (s,t),
and (u,v), respectively:
Distance Measures

Digital image processing for relationship of pixels

  • 1.
    Relationship between pixels Neighborsof a pixel – 4-neighbors (N,S,W,E pixels) == N4(p). A pixel p at coordinates (x,y) has four horizontal and vertical neighbors: • (x+1,y), (x-1, y), (x,y+1), (x, y-1)
  • 2.
    – You canadd the four diagonal neighbors to give the 8- neighbor set. Diagonal neighbors == ND(p). – 8-neighbors: include diagonal pixels == N8(p).
  • 3.
    Pixel Connectivity Connectivity ->to trace contours, define object boundaries, segmentation. In order for two pixels to be connected, they must be “neighbors” sharing a common property—satisfy some similarity criterion. In a binary image with pixel values “0” and “1”, two neighboring pixels are said to be connected if they have the same value. Let V: Set of gray level values used to define connectivity; e.g., V={1}.
  • 4.
    Connectivity 4-adjacency: Two pixelsp and q with values in V are 4-adjacent if q is in the set N4(p). 8-adjacency: q is in the set N8(p).  A 4 (8)-path from p to q is a sequence of points p=p0, p1, …, pn=q such that each pn+1 is 4 (8)-adjacent to pn
  • 5.
    Connected components Let Srepresent a subset of pixels in an image. If p and q are in S, p is connected to q in S if there is a path from p to q entirely in S. A connected component is a maximal set of pixels in S that is connected. There can be more than one such set within a given S.
  • 6.
    We assume thatpoints r and t have been visited and labeled. Now we visit point p: p=0: no action; p=1: check r and t. – both r and t = 0; assign new label to p; – only one of r and t is a 1. assign its label to p; – both r and t are 1: • same label => assign it to p; • different label=> assign one of them to p and establish equivalence between labels (they are the same.) Second pass over the image to merge equivalent labels. r p t 4-connected component labeling for points
  • 7.
    Exercise Develop a similaralgorithm for 8-connectivity. Border following algorithm
  • 8.
    Problems with 4-and 8-connectivity Neither method is satisfactory. – Why? A simple closed curve divides a plane into two simply connected regions. – However, neither 4-connectivity nor 8-connectivity can achieve this for discrete labeled components. – Give some examples..
  • 10.
    Distance Measures Distance Metric Forpixels p,q, and z, with coordinates (x,y), (s,t), and (u,v), respectively:
  • 11.