After studying this chapter you will be able to understand: Pixel connectivity, what is adjacency, different types of adjacency, connected component labeling problem, component leveling algorithm, different distance measures, application of distance measures, arithmetic and logical operations on images, neighborhood operation on images. | Digital Image Processing CCS331 Relationships of Pixel 1 Summery of previous lecture Pixel connectivity What is adjacency Different types of adjacency Connected component labeling problem Component leveling algorithm 2 Todays lecture Different distance measures Application of distance measures Arithmetic and logical operations on images Neighborhood operation on images 3 Connected component We take a sub set S of an image I we take 2 point p and q which belong to this subset S of image I. Then p is connected to q in S. which means if there exists a path from p to q consisting entirely of pixels in S. For any such p belonging to S, the set of pixels in S that are connected to p is called a connected component of S. 4 Connected component labeling To extracting the region property we need to distinguish the components For the identification or group identification, we need identify a set of pixels which are connected; belonging to a particular group, assign a particular identification number. 5 Component labeling Once we identify group of pixels which belong particular region; then we can go for finding out some region properties Region properties may be shape up that particular region, area of that particular region, the boundary, the length of the boundary and many other features can be extracted 6 Algorithm for labeling The algorithm is called component leveling algorithm to assign an identification number to each of the connected pixels which will identify a particular region. 7 Component leveling algorithm 8 2nd level 9 10 11 2nd pass 12 Distance measures To find the distance between 2 points, we need the coordinate or the location of 2 different points There are various other distance measures which can be used in digital domain. city block distance chess board distance and so on. So, to see that if D is a distance function or a distance metric, then what is the property that should be followed by this distance function D? 13 Distance measures Three pixels . | Digital Image Processing CCS331 Relationships of Pixel 1 Summery of previous lecture Pixel connectivity What is adjacency Different types of adjacency Connected component labeling problem Component leveling algorithm 2 Todays lecture Different distance measures Application of distance measures Arithmetic and logical operations on images Neighborhood operation on images 3 Connected component We take a sub set S of an image I we take 2 point p and q which belong to this subset S of image I. Then p is connected to q in S. which means if there exists a path from p to q consisting entirely of pixels in S. For any such p belonging to S, the set of pixels in S that are connected to p is called a connected component of S. 4 Connected component labeling To extracting the region property we need to distinguish the components For the identification or group identification, we need identify a set of pixels which are connected; belonging to a particular group, assign a particular identification
