Compression Measures

Duration: 10 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-compression-measures 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 compression measures used to quantify the efficiency of data and image compression. The instructor begins by defining the Compression Ratio (CR) as the ratio of uncompressed file size to compressed file size, expressed as CR = N1/N2. Three compression cases are presented: no compression (CR = 1), significant compression (CR approaches infinity), and data explosion or reverse compression (CR approaches zero). A numerical example demonstrates how to calculate a 5:1 compression ratio. The lecture then transitions to Relative Redundancy (RD) and Saving Percentage (SP), defining RD as 1 - 1/CR or 1 - N2/N1, and SP as [1 - N2/N1] x 100. The instructor emphasizes that higher RD indicates greater compression, while RD = 0 means no compression and RD < 0 indicates data explosion. Bit Rate (BR) is introduced as the compressed data required per pixel. A worked example applies these formulas to a 256 x 256 pixel gray-scale image (8 bits/pixel) with an original size of 65,536 bytes compressed to 6,554 bytes. The example calculates CR approximately 10:1, RD approximately 0.90, SP approximately 90%, and BR approximately 0.80 bits/pixel.

Chapters

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

    The lecture opens with a slide titled 'Compression Measures' that defines the Compression Ratio (CR) as CR = Uncompressed file size / Compressed file size = N1/N2. The instructor annotates the formula with 'N1 (Original)' and 'N2 (Compressed)'. Three color-coded boxes illustrate compression cases: NO COMPRESSION with N1 = N2 and CR = 1, SIGNIFICANT COMPRESSION with N2 << N1 and CR approaching infinity, and DATA EXPLOSION / REVERSE COMPRESSION with N1 << N2 and CR approaching zero. A handwritten numerical example shows 10/2 = 5:1 to demonstrate ratio calculation.

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

    The instructor continues explaining the compression ratio formula and its three cases, drawing red circles around key values such as '2' in the example. The lecture then introduces Relative Redundancy (RD) with the formula RD = 1 - 1/CR or RD = 1 - N2/N1, noting that higher RD indicates greater compression. Saving Percentage (SP) is defined as SP(%) = [1 - N2/N1] x 100, representing the percentage of storage saved. Bit Rate (BR) is introduced as compressed data required per pixel. The instructor highlights that RD = 0 means no compression and RD < 0 indicates data explosion, using red boxes to emphasize these conditions.

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

    A worked example slide presents an image-compression problem: a 256 x 256 pixel gray-scale (8 bits/pixel) file of 65,536 bytes compressed to 6,554 bytes. A GIVEN box lists N1 = 65,536 bytes, N2 = 6,554 bytes, gray-scale = 8 bits/pixel, and Number of Pixels = 256 x 256. Four numbered panels compute the measures: CR approximately 10:1, RD approximately 0.90, SP approximately 90%, and BR approximately 0.80 bits/pixel. A FINAL ANSWERS bar repeats CR = 10:1, RD = 0.90, and SP = 90%. Red handwritten annotations include '1P = 8' and circled values for each computed measure.

  4. 10:00 – 10:02 10:00-10:02

    The final frames show the completed worked example slide with all four compression measures calculated and annotated. The instructor's red handwriting marks key values including CR = 10:1, RD = 0.90, SP = 90%, and BR = 0.80 bits/pixel. The GIVEN box and FINAL ANSWERS bar remain visible, providing a complete reference for the example problem.

The lecture systematically builds understanding of compression measures from basic definitions to applied calculations. The central concept is the Compression Ratio (CR = N1/N2), which establishes a baseline for measuring compression effectiveness. The three cases (no compression, significant compression, data explosion) provide a conceptual framework for interpreting CR values. Relative Redundancy (RD = 1 - 1/CR) and Saving Percentage (SP = [1 - N2/N1] x 100) extend this framework by expressing compression efficiency in normalized and percentage terms, respectively. The worked example demonstrates how to apply all four measures (CR, RD, SP, BR) to a realistic image-compression scenario, reinforcing the relationships between these formulas. Key exam-relevant points include: CR > 1 indicates compression, CR = 1 means no change, CR < 1 means data explosion; RD ranges from negative (data explosion) to approaching 1 (maximum compression); SP and RD are numerically equivalent when expressed as percentages; BR = N2 x 8 / number of pixels for byte-based data.

Loading lesson…