Relationship between Pixels

Duration: 38 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/part-3-multimedia/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 the Course: About the Course
  2. Section 1 | भाषा (हिंदी) / Language (Hindi): भाषा, लिपि और वर्ण, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, संज्ञा और सर्वनाम, पद-भेद और रूप-विकार, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, शब्द-भंडार, अपठित बोध, संज्ञानात्मक और रचनावादी अधिगम / Cognitive and Constructivist Learning, वर्णमाला, शब्द-विचार और शब्द-रचना, वाक्य-विचार, काव्यशास्त्र, आधुनिक हिंदी कविता
  3. Section 1 | اردو زبان / Language (Urdu) — 22 Questions (Fixed): رسم الخط، حروفِ تہجی اور املا, اسم، ضمیر اور صفت, الفاظ، محاورے اور ضرب الامثال, تفہیمِ عبارت، انشا اور ترجمہ, فعل اور متعلقِ فعل, حرف، جملہ اور رموزِ اوقاف, علمِ بیان، بدیع اور عروض, اردو زبان و ادب کی تاریخ, اردو غزل, ڈراما اور غیر افسانوی نثر, اردو کی تدریس, Health Education and Nutrition / स्वास्थ्य शिक्षा एवं पोषण
  4. Section 1 | বাংলা ভাষা / Language (Bengali) — 22 Questions (Fixed): শব্দার্থ, বাগধারা ও ভাষাশুদ্ধি, বাক্য ও বাচ্য, শব্দগঠন ও শব্দভান্ডার, অনুবাদ, বোধপরীক্ষণ ও রচনা, ধ্বনি, ধ্বনিপরিবর্তন ও সন্ধি, পদপ্রকরণ, কারক ও বিভক্তি, সমাস, বাংলা ভাষার ইতিহাস ও উপভাষা, আধুনিক বাংলা কবিতা, বাংলা কথাসাহিত্য, বাংলা গদ্য, প্রবন্ধ ও নাটক
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Verbs and Tenses, Pronoun, Verb, Adverb, Prepositions and Conjunctions, Parts of Speech, Determiner, Conjunction, Modals, Transformation of Sentences, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Structure and Common Errors, Reading Comprehension, Cloze Test (Cloze Passage), Phonetics and Linguistics
  6. Section 2 | Primary Maths & Reasoning / प्राथमिक गणित एवं तर्कशक्ति: Ratio and Proportion / अनुपात और समानुपात, Divisibility Rules / विभाज्यता के नियम, Mixture and Alligation / मिश्रण और एलिगेशन, Permutation and Combination / क्रमचय और संचय, Percentage / प्रतिशत, Number System / संख्या पद्धति, HCF and LCM / महत्तम समापवर्तक और लघुत्तम समापवर्त्य, अनुक्रम, श्रेणी और संयोजन / Sequences, Series and Combinatorics, Simplification, Indices and Surds / सरलीकरण, घातांक और करणी, Algebra / बीजगणित, Probability / प्रायिकता, Profit, Loss and Discount / लाभ, हानि और बट्टा, Simple and Compound Interest / साधारण और चक्रवृद्धि ब्याज, Average / औसत, Time and Work / समय और कार्य, Time, Speed and Distance / समय, चाल और दूरी, Solid Mensuration / घन क्षेत्रमिति, Age Problems / आयु संबंधी प्रश्न, Arithmetic / अंकगणित, Mathematical Operations and Missing Numbers / गणितीय संक्रियाएँ एवं लुप्त संख्या, Series / श्रेणी, Coding-Decoding / कूट लेखन एवं कूट वाचन, Syllogisms / न्यायवाक्य, Blood Relations / रक्त संबंध, Direction and Distance / दिशा एवं दूरी, Venn Diagrams, Syllogism and Inequalities / वेन आरेख, न्याय वाक्य एवं असमानता, Analogy and Classification / सादृश्यता एवं वर्गीकरण, Order and Ranking / क्रम एवं रैंकिंग, Non-Verbal Reasoning / अशाब्दिक तर्क, Trigonometry / त्रिकोणमिति, Seating Arrangement and Puzzles / बैठक व्यवस्था एवं पहेलियाँ, Analytical Reasoning (Counting Figures Reasoning) / विश्लेषणात्मक तर्क (आकृति गणना तर्क), Calendar and Clock / कैलेंडर एवं घड़ी, Clock / घड़ी, Cubes, Dice and Figure Counting / घन, पासा एवं आकृतियों की गिनती, Inequality / असमानता, Polynomials, Equations and Complex Numbers / बहुपद, समीकरण और सम्मिश्र संख्याएँ, वास्तविक और सम्मिश्र विश्लेषण / Real and Complex Analysis, Alphabet and Number Test / वर्णमाला एवं संख्या परीक्षण, Data Sufficiency and Decision Making / आँकड़ों की पर्याप्तता एवं निर्णय क्षमता, Data Interpretation / आँकड़ा निर्वचन, Trigonometry / त्रिकोणमिति, Plane Mensuration / समतल क्षेत्रमिति
  7. Section 2 | General Awareness (GK + Current Affairs) / सामान्य जागरूकता (GK + समसामयिकी): भारतीय संविधान / Indian Constitution, Scientific Achievements and Research / वैज्ञानिक उपलब्धियाँ और अनुसंधान, कोशिका: संरचना एवं कार्य / Cell: Structure and Function, State-Specific General Knowledge / राज्य विशेष सामान्य ज्ञान, ऊष्मागतिकी एवं साम्यावस्था / Thermodynamics and Equilibrium, भारतीय राष्ट्रीय आंदोलन एवं स्वतंत्र भारत / Indian National Movement and Independent India, भारत का भौतिक पर्यावरण / India: Physical Environment, भारतीय अर्थव्यवस्था / Indian Economy, Environment / पर्यावरण, Current Affairs / समसामयिकी, खेल एवं क्रीड़ाएँ / Games and Sports, Teaching Aids and Educational Technology / शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी, Assessment and Evaluation / आकलन एवं मूल्यांकन, Geography as a Discipline and Geographical Thought / भूगोल: एक विषय एवं भौगोलिक चिंतन, Atmosphere and Climate / वायुमंडल एवं जलवायु, जैवमंडल, मृदा एवं पर्यावरण / Biosphere, Soils and Environment, Natural Hazards and Disasters / प्राकृतिक संकट एवं आपदाएँ, जनसंख्या, मानव विकास एवं सांस्कृतिक भूगोल / Population, Human Development and Cultural Geography, Human Settlements / मानव बस्तियाँ, संसाधन, कृषि, खनिज एवं ऊर्जा / Resources, Agriculture, Minerals and Energy, Consumer Behaviour and Demand / उपभोक्ता व्यवहार एवं माँग, National Income Accounting / राष्ट्रीय आय लेखांकन, मुद्रा एवं बैंकिंग / Money and Banking, Public Finance and Government Budget / लोक वित्त एवं सरकारी बजट, Periodic Classification and Chemical Bonding / आवर्त वर्गीकरण एवं रासायनिक आबंधन, d- and f-Block Elements and Coordination Compounds / d- एवं f-ब्लॉक तत्व तथा उपसहसंयोजन यौगिक, Organic Chemistry: Basic Principles and Isomerism / कार्बनिक रसायन: मूल सिद्धांत एवं समावयवता, Organic Compounds Containing Oxygen and Nitrogen / ऑक्सीजन एवं नाइट्रोजन युक्त कार्बनिक यौगिक, Biomolecules, Polymers and Everyday Chemistry / जैव-अणु, बहुलक एवं दैनिक जीवन में रसायन, Mechanical Properties of Matter / पदार्थ के यांत्रिक गुण, संघ सरकार / Union Government, Public Administration and Governance / लोक प्रशासन और सुशासन, Evolution / विकास, Biotechnology / जैव प्रौद्योगिकी, पारिस्थितिकी एवं पर्यावरण / Ecology and Environment, भक्ति एवं सूफी आंदोलन / Bhakti and Sufi Movements, Mughal Empire and the Marathas / मुगल साम्राज्य एवं मराठा, Society, Community and Social Groups / समाज, समुदाय और सामाजिक समूह, Culture, Socialisation and Social Control / संस्कृति, समाजीकरण और सामाजिक नियंत्रण, Agronomy and Farming Systems / शस्य विज्ञान एवं कृषि प्रणालियाँ, Fruit Science and Orchard Management / फल विज्ञान एवं बाग प्रबंधन, Plant Protection / पादप संरक्षण, Indian Mural Painting / भारतीय भित्ति चित्रण, Books and Publications / पुस्तकें और प्रकाशन, Awards and Personalities / पुरस्कार और व्यक्तित्व, Defence and Security Awareness / रक्षा और सुरक्षा परिचय, राष्ट्रीय पहचान और महत्वपूर्ण दिवस / National Identity and Important Days
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Emerging Trends and AI, Society, Law & Ethics, MS Office Applications, Trade, Marketing and Consumer Protection / व्यापार, विपणन एवं उपभोक्ता संरक्षण, Operating System, Terms & Abbreviations, Internet of Things, Cloud Computing, Computer Hardware, Digital India and Online Services, Language Design, Web Publishing & Hosting, Network Access Technologies
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References, OOPS with Java
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia, Digital Image Fundamentals, Color Image Processing
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
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…