Relationship between Pixels
Duration: 38 min
This video lesson is available to enrolled students.
AI Summary
An AI-generated summary of this video lecture.
This lecture segment from Digital Image Fundamentals introduces the basic relationships between pixels, focusing on neighborhood definitions and adjacency concepts. The instructor begins by defining a digital image as f(x, y) and individual pixels as p and q. The core of the lesson covers three types of pixel neighborhoods: 4-neighbors (horizontal and vertical), diagonal neighbors, and the combined set of 8-neighbors. The mathematical notation for these neighborhoods is established as N4(p), Nd(p), and N8(p) respectively. The lecture then transitions to the concept of adjacency, which requires pixels to be neighbors and share intensity values belonging to a specified set V. Three types of adjacency are introduced: 4-adjacency, 8-adjacency, and m-adjacency (mixed adjacency). The instructor explains that while 4-adjacency is straightforward, 8-adjacency can create ambiguity in connectivity paths. To resolve this, m-adjacency is defined with specific conditions to ensure unique paths between pixels.
Chapters
0:00 – 2:00 00:00-02:00
The lecture opens with the title slide 'DIGITAL IMAGE FUNDAMENTALS' and the specific topic 'Basic Relationships Between Pixels'. The instructor introduces the section, setting the stage for discussing how pixels interact within a digital image structure. Visual focus remains on the title text, establishing the context for the upcoming definitions of pixel relationships and neighborhoods.
2:00 – 5:00 02:00-05:00
The instructor defines the concept of pixel neighbors using a central pixel p(x, y). The slide displays mathematical notation for 4-neighbors as (x+1, y), (x-1, y), (x, y+1), and (x, y-1), denoted by N4(p). Diagonal neighbors are defined as (x+1, y+1), (x+1, y-1), (x-1, y+1), and (x-1, y-1), denoted by Nd(p). The 8-neighbors are introduced as the combination of both sets, forming N8(p). Visual diagrams illustrate these spatial relationships on a grid.
5:00 – 10:00 05:00-10:00
The lecture continues with detailed visual aids showing the neighborhood coordinates. The instructor draws boxes around a central pixel to demonstrate 4-neighborhood, diagonal neighborhood, and 8-neighborhood relationships. The notation N4(p), Nd(p), and N8(p) is emphasized on screen. A key definition appears: 'The complete set of neighboring pixels is called the Neighborhood.' The concept of a Closed Neighborhood, which includes the center pixel p, is also introduced.
10:00 – 15:00 10:00-15:00
The topic shifts to Adjacency, defined as a relationship between neighbors that also share intensity values belonging to a specified set V. The instructor distinguishes between Binary images where pixel values are {0, 1} and commonly V = {1}, and Grayscale images where pixel values range from 0-255. Three types of adjacency are introduced: 4-Adjacency, 8-Adjacency, and m-Adjacency (Mixed Adjacency). Visual examples show pixel arrangements for 8-adjacency and m-adjacency.
15:00 – 20:00 15:00-20:00
The instructor provides a detailed breakdown of 4-adjacency rules. Two pixels p and q are 4-adjacent if both have intensity values in V, and q is a horizontal or vertical neighbor of p. The slide highlights the 'Key Rule for 4-Adjacency' box, emphasizing that q must be in N4(p) and both pixels must have values from the set V. Visual examples use checkmarks for correct cases and crosses for incorrect ones to illustrate the conditions.
20:00 – 25:00 20:00-25:00
The lecture introduces m-adjacency (mixed adjacency) as a solution for ambiguity in connectivity. The instructor explains that 8-adjacency can create multiple paths between pixels, leading to confusion. To resolve this, m-adjacency is defined with specific conditions involving 4-neighbors and diagonal neighbors. The slide shows the condition: 'q ∈ N4(p) OR q ∈ Nd(p) and the set N4(p) ∩ N4(q) has no pixels whose values are from V'. Case 1 is presented where two pixels are NOT m-adjacent.
25:00 – 30:00 25:00-30:00
A 4x4 pixel grid example is used to demonstrate when two pixels are not m-adjacent. The instructor highlights specific pixel values and neighborhoods, showing why conditions fail in Case 1. Given intensity set V = {1, 2, 3}, the center pixel p is 2 (yellow) and chosen pixel q is 0 (light blue). The instructor writes neighborhood sets N4(p) and N4(q) by hand, using arrows to connect conditions to conclusions. Both conditions are marked as False with red X marks.
30:00 – 35:00 30:00-35:00
The instructor continues the m-adjacency example, verifying conditions using a pixel grid. The set V is highlighted in red on the slide. The instructor checks condition (a) to see if q is in N4(p), and condition (b) for diagonal neighbors with common 4-neighbors. The slide text confirms: 'Two pixels p and q with values from V are m-adjacent if: q ∈ N4(p) or q ∈ Nd(p) and the set N4(p) ∩ N4(q) has no pixels whose values are from V'. The example concludes that p and q are NOT m-adjacent.
35:00 – 37:36 35:00-37:36
The lecture concludes the m-adjacency discussion by reinforcing that it is a modified form of 8-adjacency designed to prevent two diagonal pixels from being considered adjacent if they share a common 4-neighbor belonging to the intensity set V. The specific example worked through shows two pixels p and q determined to be NOT m-adjacent because the condition regarding shared diagonal neighbors with values in V is not met. The instructor marks failed conditions with red crosses to solidify the concept.
The lecture systematically builds from basic pixel definitions to complex adjacency rules. It starts with the fundamental concept of a digital image f(x, y) and defines pixel neighborhoods (N4, Nd, N8). The progression moves to adjacency, which adds the constraint of intensity values in set V. The instructor highlights that 4-adjacency is simple but limited, while 8-adjacency introduces ambiguity in connectivity paths. The solution provided is m-adjacency, which uses a logical OR condition to ensure unique paths by checking if common 4-neighbors exist in set V. The visual examples using grids and color-coded pixels (yellow for p, light blue for q) effectively demonstrate the application of these rules. The notation N4(p), Nd(p), and N8(p) is consistently used throughout to maintain technical precision.