Distance Measures

Duration: 12 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-distance-measures-21117 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 introduces distance measures in image processing, which are mathematical functions used to calculate the distance between two pixels. The instructor establishes that a valid distance metric must satisfy three fundamental properties: non-negativity, symmetry, and the triangle rule. Non-negativity ensures distance is always greater than or equal to zero, being zero only for the same pixel. Symmetry dictates that the distance from point p to q equals the distance from q to p. The triangle rule states that the direct distance between two points is never greater than the path going through a third point. The lecture then categorizes four common distance measures: Euclidean Distance (De), City-Block Distance (D4), Chessboard Distance (D8), and m-Distance (Dm). Euclidean distance represents the straight-line path, while City-Block measures horizontal and vertical movement only. Chessboard distance allows diagonal movement as well, defined by the maximum of coordinate differences. Finally, m-Distance is introduced as a value-dependent metric where the shortest path length relies on m-adjacency and specific pixel values rather than just geometric coordinates.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The lecture begins by defining distance measures as tools to calculate the separation between two pixels in image processing. The instructor presents a slide titled '3. Distance Measures' which lists the three essential properties of any distance metric: non-negativity, symmetry, and the triangle rule. On-screen text explicitly states that distance is always greater than or equal to zero, and equals zero only when comparing a pixel to itself. The symmetry property is defined as the distance from p to q being equal to the distance from q to p. The triangle rule is described as the principle that direct distance is never greater than going through another pixel. This section establishes the theoretical foundation required before introducing specific calculation methods.

  2. 2:00 – 5:00 02:00-05:00

    The instructor transitions to listing the four common types of distance measures used in image analysis. The slide displays 'Common Distance Measures' followed by Euclidean Distance (De), City-Block Distance (D4), Chessboard Distance (D8), and m-Distance (Dm). The lecture provides the mathematical formula for Euclidean Distance as De(p, q) = sqrt((x - s)^2 + (y - t)^2), identifying it as the straight-line distance between two points. City-Block Distance is introduced next, defined by horizontal and vertical movement only, often referred to as Manhattan distance. The instructor highlights these formulas in black boxes on the slide, emphasizing their geometric interpretations where Euclidean represents a direct line and City-Block represents movement along grid axes.

  3. 5:00 – 10:00 05:00-10:00

    The lecture details Chessboard Distance (D8) and m-Distance (Dm). The formula for D8 is shown as max(|x - s|, |y - t|), allowing movement in horizontal, vertical, and diagonal directions. This creates a square shape for pixels at the same distance from a center point. The instructor explains that D8 considers 8-neighbors of a pixel. A significant distinction is made for m-Distance, where the slide notes that unlike D4 and D8 which depend only on coordinates, Dm depends on m-adjacency. The definition states that the Dm distance is the length of the shortest m-path between points, which requires checking intermediate pixel values to determine valid paths rather than just calculating geometric coordinates.

  4. 10:00 – 11:31 10:00-11:31

    The final segment provides a concrete example of m-Distance using a 3x3 grid to demonstrate path dependency. The slide shows four cases analyzing the distance between pixels P and P4 based on whether intermediate pixels p2 and p3 are 0 or 1. The text highlights that Dm depends on the valid m-path between pixels, not just their positions. Case (1) is shown where if p3 = 0 and p2 = 0, the path length changes. The instructor contrasts this value-based dependency with the coordinate-only nature of Euclidean and City-Block distances. The lecture concludes by reiterating the formulas for De and D4, reinforcing that while Euclidean measures straight lines and City-Block measures grid-aligned paths, m-Distance is unique in its reliance on pixel values for path validity.

The lecture systematically builds the concept of distance measures starting from abstract properties to concrete formulas. The progression moves from defining non-negativity, symmetry, and the triangle rule as mandatory conditions for any metric. It then introduces geometric metrics like Euclidean (De) and City-Block (D4), which rely solely on pixel coordinates. The complexity increases with Chessboard Distance (D8) and m-Distance (Dm). D8 expands movement to include diagonals, while Dm introduces a critical distinction: it is not purely geometric but depends on m-adjacency and pixel values. The example of the 3x3 grid illustrates that valid paths in m-Distance are constrained by intermediate pixel states, making it a value-dependent metric unlike the coordinate-only Euclidean or City-Block measures. This distinction is vital for image processing tasks where connectivity and pixel values influence distance calculations.

Loading lesson…