Relationship between Pixels

Duration: 38 min

This video lesson is available to enrolled students.

Return to /learn/UPPSC-POLYTECHNIC-LECTURER-2025-CS/paper-2-image-processing/digital-image-fundamentals/basic-relationships-between-pixels/asset-relationship-between-pixels after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: UPPSC Course Overview
  2. Interview Preparation & Guidance: Interview Preparation
  3. Paper 1 | General Hindi: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, वर्णमाला, समास, संधि, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), शब्द-भंडार, वर्ण-विचार, हिन्दी की ध्वनि और स्वनिम व्यवस्था, प्राचीन और मध्यकालीन भारतीय आर्यभाषाएँ, काव्य के लक्षण, हेतु और प्रयोजन, अशुद्धि-शोधन, शब्द-रचना, शब्द-भेद, हिन्दी की रूप रचना, रूप-रचना, हिन्दी शब्द रचना, हिन्दी साहित्येतिहास दर्शन, भक्तिकालीन काव्यधाराएँ, भारतीय काव्यशास्त्र की परंपरा, भारतीय नवजागरण और स्वाधीनता आंदोलन, अन्य गद्य विधाएँ एवं प्रवासी साहित्य, निर्धारित उपन्यासों का तुलनात्मक अध्ययन, गोदान, हिन्दी कहानी का विकास, स्वातंत्र्योत्तर और नयी कहानी, हिन्दी निबंध का विकास, शुक्लोत्तर निबंध, द्विवेदी और शुक्ल युग के निबंध, हिन्दी की संवैधानिक स्थिति, आधुनिक भारतीय आर्यभाषाएँ और हिन्दी का उद्भव, हिन्दी भाषा प्रयोग के विविध रूप, रीतिकाल, जीवनी, द्विवेदी युग और छायावाद, रीति, वक्रोक्ति और औचित्य सिद्धान्त, शब्दशक्ति और ध्वनि सिद्धान्त, रस सिद्धान्त और साधारणीकरण, उत्तर आधुनिकतावाद, लोहिया दर्शन, हिन्दी उपन्यास का विकास, हिन्दी नवजागरण, अंबेडकर दर्शन, आदिकाल, प्रयोगवाद और नयी कविता, छायावादी काव्य: प्रसाद और निराला, प्रगतिवाद से समकालीन कविता, निर्गुण भक्ति काव्य, द्विवेदीयुगीन काव्य, रीतिकालीन काव्य, आरंभिक हिन्दी उपन्यास, स्वातंत्र्योत्तर उपन्यास, आत्मकथा, स्वाधीनता-पूर्व प्रेमचंदोत्तर उपन्यास, निर्धारित कहानियों का तुलनात्मक अध्ययन, साठोत्तरी नाटक, प्रसाद और प्रसादोत्तर युग के नाटक, भारतेन्दु युगीन नाटक, स्वातंत्र्योत्तर नाटक, भारतेन्दु युगीन निबंध, संस्मरण और रेखाचित्र, व्यंग्य, एक साहित्यिक की डायरी, संस्कृति के चार अध्याय, सगुण भक्ति काव्य, हिन्दी नाटक, एकांकी और रंगमंच, आधुनिक गद्य और हिन्दी नवजागरण, अलंकार सिद्धान्त, हिन्दी आलोचना का विकास, भक्ति आंदोलन, कल्पना, बिम्ब, प्रतीक, मिथक और फंतासी, नयी कविता का विस्तार और साठोत्तरी कविता, उत्तर-छायावादी और प्रगतिवादी काव्य, काव्यगुण और काव्यदोष, प्लेटो, अरस्तू और पाश्चात्य परंपरा, मार्क्सवाद, स्वच्छन्दतावादी काव्यशास्त्र, आधुनिक पाश्चात्य आलोचना, भाषा और भाषा परिवार, देवनागरी लिपि
  4. Paper 2 | General Studies: State Wise GK, Polity, Geography, History, GK- Current Affairs
  5. Paper 1 | Programming Language: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  6. Paper 1 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, ORDBMS, NoSQL
  7. Paper 1 | Cyber Security: Society, Law & Ethics, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security, Ethical Hacking
  8. Paper 1 | Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design
  9. Paper 1 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
  10. Paper 1 | Design and Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  11. Paper 1 | Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  12. Paper 1 | Discrete Structures and Theory of Logic: Permutation and Combination, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  13. Paper 1 | Software Project Management: Software Project Management
  14. Paper 2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  15. Paper 2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  16. Paper 2 | Artificial Intelligence & High Performance Computing: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Natural Language Processing, Emerging Tech Trends
  17. Paper 2 | Image Processing: Digital Image Fundamentals, Image Enhancement, Image Restoration, Color Image Processing, Image Compression
  18. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  19. Paper 2 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  20. Paper 2 | Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, Java
  21. Paper 2 | Soft Computing: Fuzzy Sets, Artificial Neural Networks, Genetic Algorithms
  22. Paper 2 | Distributed System: Distributed Systems
  23. UPPSC Live Class Recordings: UPPSC Polytechnic Lecturer 2025 (CS)
  24. Previous Year Papers:
  25. Mock Test:
AI summary & chapters

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

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

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

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

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

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

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

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

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

Loading lesson…