Redundancy

Duration: 23 min

This video lesson is available to enrolled students.

Return to /learn/UPPSC-POLYTECHNIC-LECTURER-2025-CS/paper-2-image-processing/image-compression/image-compression-fundamentals/asset-redundancy 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: कंप्यूटर की मूल बातें और हार्डवेयर / Computer Fundamentals and Hardware, प्रत्यक्ष बोध / Literal Comprehension, कंप्यूटर सॉफ्टवेयर / Computer Software, निष्कर्षात्मक बोध / Inferential Comprehension, आलोचनात्मक बोध / Critical Comprehension, इंटरनेट और वर्ल्ड वाइड वेब / Internet and World Wide Web, ई-मेल और ऑनलाइन संचार / Email and Online Communication, साइबर सुरक्षा / Cyber Security, अपशिष्ट प्रबंधन / Waste Management, डिजिटल नैतिकता, बौद्धिक संपदा और समाज / Digital Ethics, IPR and Society, डिजिटल एवं नव माध्यम / Digital and New Media, शोध नैतिकता / Research Ethics, उभरती प्रौद्योगिकियाँ / Emerging Technologies, शिक्षा और शासन में ICT / ICT in Education and Governance, 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, भौगोलिक संकेतों का संरक्षण / Protection of Geographical Indications
  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, Combination and Probability, 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, क्लाउड और वितरित कंप्यूटिंग / Cloud and Distributed Computing
  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 redundancy in image data, defining it as repetitive or unnecessary information arising from repeated values or correlations. It distinguishes explicit redundancy, where identical symbols occur multiple times and can be reduced by Run-Length Coding (RLC), from implicit redundancy, which is present indirectly through relationships or correlations and can be addressed by predictive coding. Worked examples include the sequence A A A A B B encoded as (A,4)(B,2) and a 3x3 pixel matrix scanned column-wise to produce (10,1)(20,2)(10,1)(20,2). A flowchart classifies redundancy into coding, inter-pixel, psycho-visual, and chromatic types. Coding redundancy is quantified using information I = log2(1/P) = -log2(P) bits, with coding redundancy equal to average bits used minus entropy, totaling M x N x L_avg. Inter-pixel (spatial/geometrical) redundancy is illustrated with pixel blocks and moving-car frames, distinguishing intra-frame spatial from inter-frame temporal correlation; reduction techniques include predictive coding, bit-plane coding, RLC, and dictionary-based algorithms. Psycho-visual redundancy exploits human visual system limitations via quantization (e.g., reducing 256 gray levels to 16), while chromatic redundancy exploits color-channel correlation. The lesson concludes with fidelity and distortion, listing objective measures (error, SNR, PSNR) and a subjective 1-to-5 rating scale from Poor to Excellent.

Chapters

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

    The lecture opens with the slide 'Introduction to Redundancy,' defining redundancy as repetitive or unnecessary information in image data that occurs when values are repeated or correlated. It states 'Redundancy can be Explicit or Implicit' and focuses on explicit redundancy, where redundant information is directly and repeatedly present. A data sequence example shows 'A A A A B B' converting to the Run-Length Representation '(A, 4) (B, 2),' and an image example shows a pixel matrix scanned column-wise to produce '(10,1) (20,2) (10,1) (20,2),' demonstrating Run-Length Coding (RLC).

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

    The instructor continues the explicit redundancy examples, reinforcing that 'the same information or symbols occur multiple times.' The data sequence (A, A, A, A, B, B) and the image pixel matrix are revisited with arrows showing the conversion to Run-Length Representation. The slide underlines key terms like 'repetitive or unnecessary information' and 'directly and repeatedly present,' using tables and step-by-step column-wise scanning to illustrate how RLC compresses repetitive data.

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

    The topic shifts to '2. Implicit Redundancy,' with red underlines over 'indirectly' and 'through relationships or correlations,' noting Predictive Coding as a reduction technique. Example 1 shows a 2x2 grid (00, 11, 00, 10) labeled 'Original' mapping to a 'Pattern 1' grid (0,1,0,1) and a green 'Pattern 2' grid. A flowchart under 'Types of Redundancy:' branches from a top 'REDUNDANCY' box into Coding, Inter-Pixel, Psycho-Visual, and Chromatic Redundancy. A legend defines P(y_k), y_k, l_k, with a box stating total bits = M x N x L_avg and the formula I = log2(1/P) circled.

  4. 10:00 – 15:00 10:00-15:00

    The slide '1. Coding Redundancy' appears with a red checkmark, bullets on extra/unnecessary bits, and the formula 'I = log(1/P) = -log2(P) bits.' Green boxes state 'Coding Redundancy = Average bits used to Code - Entropy' and end with '= M x N x L_avg.' The next slide, '2. Inter-Pixel Redundancy,' lists reduction techniques: Predictive Coding, Bit Plane Coding, Run-Length Coding (RLC), and Dictionary-Based Algorithms. A right-hand diagram titled '2. INTER-PIXEL REDUNDANCY' displays a soft pixel block and three moving-car frames illustrating spatial versus temporal redundancy.

  5. 15:00 – 20:00 15:00-20:00

    Inter-pixel redundancy is explained as caused by 'correlation between neighboring pixels,' also called spatial or geometrical redundancy, distinguishing intra-frame (spatial) from inter-frame (temporal) redundancy with examples of constant backgrounds and successive video frames. The lesson transitions to psycho-visual redundancy, noting the human eye is not equally sensitive to all visual information, and chromatic redundancy based on color channel correlation. Fidelity and distortion are defined, listing objective measures like error, SNR, and PSNR alongside a subjective 1 to 5 rating scale.

  6. 20:00 – 22:59 20:00-22:59

    The segment covers psycho-visual and chromatic redundancy in image compression, explaining how human visual system limitations allow data reduction. Quantization is highlighted as a common technique, with an example reducing 256 gray levels to 16. Chromatic redundancy exploits correlation between color channels. The lesson concludes by defining fidelity and distortion, distinguishing objective metrics (Error, SNR, PSNR) from subjective perception scales rated Poor to Excellent.

The lecture builds a coherent taxonomy of image redundancy. It begins with the core definition and the explicit/implicit distinction, using RLC examples to make explicit redundancy concrete. It then generalizes into a four-type flowchart (coding, inter-pixel, psycho-visual, chromatic) and quantifies coding redundancy via information theory (I = -log2(P), total bits M x N x L_avg). Inter-pixel redundancy is tied to spatial and temporal correlation with visual diagrams, while psycho-visual and chromatic types exploit human perception and color-channel correlation. The closing fidelity/distortion section connects compression to quality assessment through objective (SNR, PSNR) and subjective (1-5 scale) measures. Central ideas are the redundancy taxonomy and reduction techniques; minor details include specific example values and slide annotations.

Loading lesson…