SlideShare a Scribd company logo
Chapter-4
PART-2
Basic Pixel Relationships
Connectivity
• Two pixels are connected if:
• They are neighbors (i.e. adjacent in some sense -- e.g. N4(p), N8(p), …)
• Their gray levels satisfy a specified criterion of similarity (e.g. equality, …)
• V is the set of gray-level values used to define adjacency (e.g. V={1}
for adjacency of pixels of value 1)
Adjacency
• We consider three types of adjacency:
• V is the set of gray-level values used to define adjacency (e.g. V={1}
for adjacency of pixels of value 1)( the matrix considered for binary
image so it has 0 and 1)
• 4-adjacency: two pixels p and q with values from V are 4-adjacent if q is in the
set N4(p)
• 8-adjacency : p & q are 8- adjacent if q is in the set N8(p)
1
0
0
0
1
0
1
1
0
1
0
0
0
1
0
1
1
0
4-Adjacency 8-Adjacency
p
q
Adjacency
• The third type of adjacency:
• m-adjacency: p & q with values from V are m-adjacent if
• q should be in N4(p) or
• q should be in ND(p) and the set N4(p)N4(q) has no pixels with values from V
1
0
0
0
1
0
1
1
0
m-Adjacency
Adjacency
• Mixed adjacency is a modification of 8-adjacency and is used to
eliminate the multiple path connections that often arise when 8-
adjacency is used.
1
0
0
0
1
0
1
1
0
1
0
0
0
1
0
1
1
0
4-Adjacency 8-Adjacency m-Adjacency
1
0
0
0
1
0
1
1
0
Digital path
• Line connecting the pixel is called digital path
1
0
0
0
1
0
1
1
0
Digital path
Connectivity
• For any pixel p and q in in a set of pixels ,S(subset of pixels) , the set of
pixels in S that are connected to p and q through digital path is called
connectivity.
• If S has only one connected component then S is called a connected
set.
Digital path
• Connectivity in a subset S of an image
• – Two pixels are connected if there is a path between them that lies
completely within S
• Connected Component
• – The set of all pixels in S that are connected to a given pixel
• Connected Set
• – If S has only one connected component
Region
• The connectivity gives rise to another concept of
region (R ).
• Region is nothing but a subset of pixels which are
connected. Or connected set of pixels is called
region.
• Ri and Rj are two joint sets and they are adjacent
to each other. They are connected by 8-
adjacency marked(both diagonals are 1) in red
(fig-1). The joint set gives rise to back ground of
image.
• Ri and Rj are not connected marked in red arrow
(as there is 0 and 1 in diagonal )are called the
disjoint sets, This disjoint sets gives rise to fore
ground of image.
1
0
0
0
1
0
1
1
0
1
0
0
0
1
0
1
1
0
Ri
Rj
Boundary
• It is defined as that the boundary will be having at least one set of
pixels from back ground of the image or edge.
• Edge can be the region boundary (in binary images)
• Its boundary (border, contour) is the set of pixels in R that have at
least one neighbor not in R.
Back ground
Foreground
Edge boundary
chapter_4_1ST_PART_BASIC_RELATION_OF_PIXELSchapter_2_dip_5th_sem.pdf
• If a region corresponds to the whole image, 1st and last rows &
columns are treated as boundary
• Difference
• – Edges Intensity Discontinuities
• – Boundaries Closed Path
Distance Measures
• For pixels p,q,z with coordinates (x,y), (s,t), (u,v), D is a distance
function or metric if the three conditions satisfies:
• D(p,q) ≥ 0 [D(p,q)=0 iff p=q( if p and q are located at same position)]
• D(p,q) = D(q,p) (if distance between p and q are equal) and
• D(p,z) ≤ D(p,q) + D(q,z)
Distance Measures
• Euclidean distance:
• De(p,q) = [(x-s)2 + (y-t)2]1/2
• Points (pixels) having a distance less than or equal to r from (x,y) are
contained in a disk of radius r centered at (x,y).
Distance Measures
• D4 distance (city-block distance):
• D4(p,q) = |x-s| + |y-t|
• forms a diamond centered at (x,y)
• e.g. pixels with D4≤2 from p
2
2
1
2
2
1
0
1
2
2
1
2
2
D4 = 1 are the 4-neighbors of p
Distance Measures
• D8 distance (chessboard distance): ( Like a king moves 8-ways in chess
board)
• D8(p,q) = max(|x-s|,|y-t|)
• Forms a square centered at p
• e.g. pixels with D8≤2 from p
2
2
2
2
2
2
1
1
1
2
2
1
0
1
2
2
1
1
1
2
2
2
2
2
2
D8 = 1 are the 8-neighbors of p
Distance Measures
• D4 and D8 distances between p and q are independent of any paths
that exist between the points because these distances involve only
the coordinates of the points (regardless of whether a connected path
exists between them).
Distance Measures
• However, for m-connectivity the value of the distance (length of path)
between two pixels depends on the values of the pixels along the
path and those of their neighbors.
Interpolation
• Required in image resizing such as shrinking
and zooming
• Using known data to estimate data at
unknown points
chapter_4_1ST_PART_BASIC_RELATION_OF_PIXELSchapter_2_dip_5th_sem.pdf
Morphing
Images
Image formation
chapter_4_1ST_PART_BASIC_RELATION_OF_PIXELSchapter_2_dip_5th_sem.pdf
Electromagnetic (EM) energy spectrum
Weeks 1 & 2
Major uses
Gamma-ray imaging: nuclear medicine and astronomical observations
X-rays: medical diagnostics, industry, and astronomy, etc.
Ultraviolet: lithography, industrial inspection, microscopy, lasers, biological imaging,
and astronomical observations
Visible and infrared bands: light microscopy, astronomy, remote sensing, industry,
and law enforcement
Microwave band: radar
Radio band: medicine (such as MRI) and astronomy
First photograph
• First photograph due to Niepce,
• First on record shown - 1822
• Basic abstraction is the pinhole camera
• First successful commercial
photograph due to Eastman in late
19th
First digital picture
chapter_4_1ST_PART_BASIC_RELATION_OF_PIXELSchapter_2_dip_5th_sem.pdf

More Related Content

PDF
Basic Relationship between pixels and adjacency
PPT
3.ppt
PPT
DIP7_Relationships_between_pixels.ppt
PPTX
Digital Image Processing
PPT
Lecture4.ppt
PPT
Relationship between adjacent pixels in an image
PPTX
Digital-Image-processing-fundamenntal.pptx
PDF
Digital image processing fundamental explanation
Basic Relationship between pixels and adjacency
3.ppt
DIP7_Relationships_between_pixels.ppt
Digital Image Processing
Lecture4.ppt
Relationship between adjacent pixels in an image
Digital-Image-processing-fundamenntal.pptx
Digital image processing fundamental explanation

Similar to chapter_4_1ST_PART_BASIC_RELATION_OF_PIXELSchapter_2_dip_5th_sem.pdf (20)

PPTX
digital image processing pixel relationships.pptx
PPT
digital image processing chapter two, fundamentals
PDF
2. IP Fundamentals.pdf
PPTX
Pixelrelationships
PPTX
pixelrelationships in image processing enhancement
PPTX
pixels arranged in a 2D grid, where each pixel carries intensity or color inf...
PPTX
Basic Relationships between Pixels- Digital Image Processing
PPT
Image_Processing-ch2surface r_part_2.ppt
PPT
Digital Image Fundamentals 1.ppt
PPT
chap2.ppt
PDF
Ip unit 1
PDF
bstract Point processing uses only the information in individual pixels to pr...
PPTX
Image Acquisition and Representation
PPT
pixelrelationships-m-1.pptx.ppt
PPT
03 digital image fundamentals DIP
PDF
Biomedical engineering 20230918-Fundamentals.pdf
PPTX
Basics of pixel neighbor.
PPT
Digital image processing for relationship of pixels
PPT
digTop.ppt
digital image processing pixel relationships.pptx
digital image processing chapter two, fundamentals
2. IP Fundamentals.pdf
Pixelrelationships
pixelrelationships in image processing enhancement
pixels arranged in a 2D grid, where each pixel carries intensity or color inf...
Basic Relationships between Pixels- Digital Image Processing
Image_Processing-ch2surface r_part_2.ppt
Digital Image Fundamentals 1.ppt
chap2.ppt
Ip unit 1
bstract Point processing uses only the information in individual pixels to pr...
Image Acquisition and Representation
pixelrelationships-m-1.pptx.ppt
03 digital image fundamentals DIP
Biomedical engineering 20230918-Fundamentals.pdf
Basics of pixel neighbor.
Digital image processing for relationship of pixels
digTop.ppt
Ad

Recently uploaded (20)

PPTX
Foundation to blockchain - A guide to Blockchain Tech
PPTX
IOT PPTs Week 10 Lecture Material.pptx of NPTEL Smart Cities contd
PPTX
Geodesy 1.pptx...............................................
PPTX
KTU 2019 -S7-MCN 401 MODULE 2-VINAY.pptx
PPTX
CH1 Production IntroductoryConcepts.pptx
PPTX
additive manufacturing of ss316l using mig welding
PPT
CRASH COURSE IN ALTERNATIVE PLUMBING CLASS
PDF
Mitigating Risks through Effective Management for Enhancing Organizational Pe...
PDF
BMEC211 - INTRODUCTION TO MECHATRONICS-1.pdf
PDF
Enhancing Cyber Defense Against Zero-Day Attacks using Ensemble Neural Networks
PPTX
Infosys Presentation by1.Riyan Bagwan 2.Samadhan Naiknavare 3.Gaurav Shinde 4...
PDF
Evaluating the Democratization of the Turkish Armed Forces from a Normative P...
PPTX
Internet of Things (IOT) - A guide to understanding
PDF
PPT on Performance Review to get promotions
PPTX
FINAL REVIEW FOR COPD DIANOSIS FOR PULMONARY DISEASE.pptx
PDF
Operating System & Kernel Study Guide-1 - converted.pdf
PPTX
bas. eng. economics group 4 presentation 1.pptx
PPTX
MCN 401 KTU-2019-PPE KITS-MODULE 2.pptx
PDF
Mohammad Mahdi Farshadian CV - Prospective PhD Student 2026
PPTX
CARTOGRAPHY AND GEOINFORMATION VISUALIZATION chapter1 NPTE (2).pptx
Foundation to blockchain - A guide to Blockchain Tech
IOT PPTs Week 10 Lecture Material.pptx of NPTEL Smart Cities contd
Geodesy 1.pptx...............................................
KTU 2019 -S7-MCN 401 MODULE 2-VINAY.pptx
CH1 Production IntroductoryConcepts.pptx
additive manufacturing of ss316l using mig welding
CRASH COURSE IN ALTERNATIVE PLUMBING CLASS
Mitigating Risks through Effective Management for Enhancing Organizational Pe...
BMEC211 - INTRODUCTION TO MECHATRONICS-1.pdf
Enhancing Cyber Defense Against Zero-Day Attacks using Ensemble Neural Networks
Infosys Presentation by1.Riyan Bagwan 2.Samadhan Naiknavare 3.Gaurav Shinde 4...
Evaluating the Democratization of the Turkish Armed Forces from a Normative P...
Internet of Things (IOT) - A guide to understanding
PPT on Performance Review to get promotions
FINAL REVIEW FOR COPD DIANOSIS FOR PULMONARY DISEASE.pptx
Operating System & Kernel Study Guide-1 - converted.pdf
bas. eng. economics group 4 presentation 1.pptx
MCN 401 KTU-2019-PPE KITS-MODULE 2.pptx
Mohammad Mahdi Farshadian CV - Prospective PhD Student 2026
CARTOGRAPHY AND GEOINFORMATION VISUALIZATION chapter1 NPTE (2).pptx
Ad

chapter_4_1ST_PART_BASIC_RELATION_OF_PIXELSchapter_2_dip_5th_sem.pdf

  • 3. Connectivity • Two pixels are connected if: • They are neighbors (i.e. adjacent in some sense -- e.g. N4(p), N8(p), …) • Their gray levels satisfy a specified criterion of similarity (e.g. equality, …) • V is the set of gray-level values used to define adjacency (e.g. V={1} for adjacency of pixels of value 1)
  • 4. Adjacency • We consider three types of adjacency: • V is the set of gray-level values used to define adjacency (e.g. V={1} for adjacency of pixels of value 1)( the matrix considered for binary image so it has 0 and 1) • 4-adjacency: two pixels p and q with values from V are 4-adjacent if q is in the set N4(p) • 8-adjacency : p & q are 8- adjacent if q is in the set N8(p) 1 0 0 0 1 0 1 1 0 1 0 0 0 1 0 1 1 0 4-Adjacency 8-Adjacency p q
  • 5. Adjacency • The third type of adjacency: • m-adjacency: p & q with values from V are m-adjacent if • q should be in N4(p) or • q should be in ND(p) and the set N4(p)N4(q) has no pixels with values from V 1 0 0 0 1 0 1 1 0 m-Adjacency
  • 6. Adjacency • Mixed adjacency is a modification of 8-adjacency and is used to eliminate the multiple path connections that often arise when 8- adjacency is used. 1 0 0 0 1 0 1 1 0 1 0 0 0 1 0 1 1 0 4-Adjacency 8-Adjacency m-Adjacency 1 0 0 0 1 0 1 1 0
  • 7. Digital path • Line connecting the pixel is called digital path 1 0 0 0 1 0 1 1 0 Digital path
  • 8. Connectivity • For any pixel p and q in in a set of pixels ,S(subset of pixels) , the set of pixels in S that are connected to p and q through digital path is called connectivity. • If S has only one connected component then S is called a connected set. Digital path
  • 9. • Connectivity in a subset S of an image • – Two pixels are connected if there is a path between them that lies completely within S • Connected Component • – The set of all pixels in S that are connected to a given pixel • Connected Set • – If S has only one connected component
  • 10. Region • The connectivity gives rise to another concept of region (R ). • Region is nothing but a subset of pixels which are connected. Or connected set of pixels is called region. • Ri and Rj are two joint sets and they are adjacent to each other. They are connected by 8- adjacency marked(both diagonals are 1) in red (fig-1). The joint set gives rise to back ground of image. • Ri and Rj are not connected marked in red arrow (as there is 0 and 1 in diagonal )are called the disjoint sets, This disjoint sets gives rise to fore ground of image. 1 0 0 0 1 0 1 1 0 1 0 0 0 1 0 1 1 0 Ri Rj
  • 11. Boundary • It is defined as that the boundary will be having at least one set of pixels from back ground of the image or edge. • Edge can be the region boundary (in binary images) • Its boundary (border, contour) is the set of pixels in R that have at least one neighbor not in R. Back ground Foreground Edge boundary
  • 13. • If a region corresponds to the whole image, 1st and last rows & columns are treated as boundary • Difference • – Edges Intensity Discontinuities • – Boundaries Closed Path
  • 14. Distance Measures • For pixels p,q,z with coordinates (x,y), (s,t), (u,v), D is a distance function or metric if the three conditions satisfies: • D(p,q) ≥ 0 [D(p,q)=0 iff p=q( if p and q are located at same position)] • D(p,q) = D(q,p) (if distance between p and q are equal) and • D(p,z) ≤ D(p,q) + D(q,z)
  • 15. Distance Measures • Euclidean distance: • De(p,q) = [(x-s)2 + (y-t)2]1/2 • Points (pixels) having a distance less than or equal to r from (x,y) are contained in a disk of radius r centered at (x,y).
  • 16. Distance Measures • D4 distance (city-block distance): • D4(p,q) = |x-s| + |y-t| • forms a diamond centered at (x,y) • e.g. pixels with D4≤2 from p 2 2 1 2 2 1 0 1 2 2 1 2 2 D4 = 1 are the 4-neighbors of p
  • 17. Distance Measures • D8 distance (chessboard distance): ( Like a king moves 8-ways in chess board) • D8(p,q) = max(|x-s|,|y-t|) • Forms a square centered at p • e.g. pixels with D8≤2 from p 2 2 2 2 2 2 1 1 1 2 2 1 0 1 2 2 1 1 1 2 2 2 2 2 2 D8 = 1 are the 8-neighbors of p
  • 18. Distance Measures • D4 and D8 distances between p and q are independent of any paths that exist between the points because these distances involve only the coordinates of the points (regardless of whether a connected path exists between them).
  • 19. Distance Measures • However, for m-connectivity the value of the distance (length of path) between two pixels depends on the values of the pixels along the path and those of their neighbors.
  • 20. Interpolation • Required in image resizing such as shrinking and zooming • Using known data to estimate data at unknown points
  • 26. Electromagnetic (EM) energy spectrum Weeks 1 & 2 Major uses Gamma-ray imaging: nuclear medicine and astronomical observations X-rays: medical diagnostics, industry, and astronomy, etc. Ultraviolet: lithography, industrial inspection, microscopy, lasers, biological imaging, and astronomical observations Visible and infrared bands: light microscopy, astronomy, remote sensing, industry, and law enforcement Microwave band: radar Radio band: medicine (such as MRI) and astronomy
  • 27. First photograph • First photograph due to Niepce, • First on record shown - 1822 • Basic abstraction is the pinhole camera • First successful commercial photograph due to Eastman in late 19th