Mean Filters
Duration: 18 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: UPPSC Course Overview
- Interview Preparation & Guidance: Interview Preparation
- Paper 1 | General Hindi: हिन्दी की रूप रचना, वर्णमाला, समास, Multi-Topic Content (Cross-Concept Material), हिन्दी की ध्वनि और स्वनिम व्यवस्था, प्राचीन और मध्यकालीन भारतीय आर्यभाषाएँ, काव्य के लक्षण, हेतु और प्रयोजन, हिन्दी शब्द रचना, हिन्दी साहित्येतिहास दर्शन, भक्तिकालीन काव्यधाराएँ, भारतीय काव्यशास्त्र की परंपरा, भारतीय नवजागरण और स्वाधीनता आंदोलन, अन्य गद्य विधाएँ एवं प्रवासी साहित्य, निर्धारित उपन्यासों का तुलनात्मक अध्ययन, गोदान, हिन्दी कहानी का विकास, स्वातंत्र्योत्तर और नयी कहानी, हिन्दी निबंध का विकास, शुक्लोत्तर निबंध, द्विवेदी और शुक्ल युग के निबंध, हिन्दी की संवैधानिक स्थिति, आधुनिक भारतीय आर्यभाषाएँ और हिन्दी का उद्भव, हिन्दी भाषा प्रयोग के विविध रूप, रीतिकाल, जीवनी, द्विवेदी युग और छायावाद, रीति, वक्रोक्ति और औचित्य सिद्धान्त, शब्दशक्ति और ध्वनि सिद्धान्त, रस सिद्धान्त और साधारणीकरण, उत्तर आधुनिकतावाद, लोहिया दर्शन, हिन्दी उपन्यास का विकास, हिन्दी नवजागरण, अंबेडकर दर्शन, आदिकाल, प्रयोगवाद और नयी कविता, छायावादी काव्य: प्रसाद और निराला, प्रगतिवाद से समकालीन कविता, निर्गुण भक्ति काव्य, द्विवेदीयुगीन काव्य, रीतिकालीन काव्य, आरंभिक हिन्दी उपन्यास, स्वातंत्र्योत्तर उपन्यास, आत्मकथा, स्वाधीनता-पूर्व प्रेमचंदोत्तर उपन्यास, निर्धारित कहानियों का तुलनात्मक अध्ययन, साठोत्तरी नाटक, प्रसाद और प्रसादोत्तर युग के नाटक, भारतेन्दु युगीन नाटक, स्वातंत्र्योत्तर नाटक, भारतेन्दु युगीन निबंध, संस्मरण और रेखाचित्र, व्यंग्य, एक साहित्यिक की डायरी, संस्कृति के चार अध्याय, सगुण भक्ति काव्य, हिन्दी नाटक, एकांकी और रंगमंच, आधुनिक गद्य और हिन्दी नवजागरण, अलंकार सिद्धान्त, हिन्दी आलोचना का विकास, भक्ति आंदोलन, कल्पना, बिम्ब, प्रतीक, मिथक और फंतासी, नयी कविता का विस्तार और साठोत्तरी कविता, उत्तर-छायावादी और प्रगतिवादी काव्य, काव्यगुण और काव्यदोष, प्लेटो, अरस्तू और पाश्चात्य परंपरा, मार्क्सवाद, स्वच्छन्दतावादी काव्यशास्त्र, आधुनिक पाश्चात्य आलोचना, भाषा और भाषा परिवार, देवनागरी लिपि
- Paper 2 | General Studies: State Wise GK, Polity, Geography, History, GK- Current Affairs
- 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++
- 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
- 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
- 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
- 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
- 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
- Paper 1 | Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
- Paper 1 | Discrete Structures and Theory of Logic: क्रमचय, संचय एवं प्रायिकता / Permutation, Combination and Probability, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
- Paper 1 | Software Project Management: Software Project Management
- 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
- 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
- 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
- Paper 2 | Image Processing: Digital Image Fundamentals, Image Enhancement, Image Restoration, Color Image Processing, Image Compression
- 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
- Paper 2 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
- 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
- Paper 2 | Soft Computing: Fuzzy Sets, Artificial Neural Networks, Genetic Algorithms
- Paper 2 | Distributed System: Distributed Systems
- UPPSC Live Class Recordings: UPPSC Polytechnic Lecturer 2025 (CS)
- Previous Year Papers:
- Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces spatial-domain image restoration for additive noise, focusing on mean filters. It begins with the degradation model g(x,y) = f(x,y) + η(x,y), where the original image is corrupted by unknown additive noise. Because the noise cannot be directly subtracted, spatial filtering is used to reduce it. The lecture categorizes de-noising filters into mean filters, order-statistics filters, and adaptive filters. The main focus is on four mean filters: arithmetic, geometric, harmonic, and contraharmonic. Each filter is defined by a formula and demonstrated on a 3×3 neighborhood containing a bright noisy pixel value of 200. The arithmetic mean replaces the center with approximately 65, the geometric mean with approximately 59, and the harmonic mean with 46. The contraharmonic filter is introduced with parameter Q, where positive Q removes pepper noise and negative Q removes salt noise. A comparison table summarizes the idea, formula, usefulness, image effect, and notes for each filter. The lecture concludes with X-ray circuit-board examples showing arithmetic, geometric, and contraharmonic filtering at Q = 15 and Q = -15.
Chapters
0:00 – 2:00 00:00-02:00
The lecture opens with a title slide reading “IMAGE RESTORATION” and the subtitle “Spatial Domain Restoration.” The instructor introduces restoration in the presence of noise, showing the degradation model g(x,y) = f(x,y) + η(x,y). A red box and underline are drawn around the equation to emphasize it. The slide explains that when additive noise is the only degradation, the degraded image consists of the original image plus unknown noise. Because the noise term is unknown and cannot be directly subtracted, spatial filtering is used to reduce it. A flowchart titled “SPATIAL FILTERS FOR DE-NOISING ADDITIVE NOISE” branches into three categories: MEAN FILTERS, ORDER-STATISTICS FILTERS, and ADAPTIVE FILTERS. The mean filters listed are Arithmetic, Geometric, Harmonic, and Contraharmonic Mean Filter; order-statistics filters include Median, Max, Min, and Midpoint.
2:00 – 5:00 02:00-05:00
The instructor continues explaining the spatial filtering approach, with red underlines highlighting phrases such as “the only degradation” and “unknown.” Red arrows point to the noise term in the formula g(x,y) = f(x,y) + η(x,y), reinforcing that the noise is additive and unknown. The flowchart under “SPATIAL FILTERS FOR DE-NOISING ADDITIVE NOISE” is revisited, and red checkmark arrows are drawn pointing down to each of the three filter category boxes: MEAN FILTERS, ORDER-STATISTICS FILTERS, and ADAPTIVE FILTERS. The slide emphasizes that spatial filters are mainly used to reduce additive noise, and the concept of replacing a noisy pixel alone is introduced. The transition leads into the detailed treatment of mean filters, with the four types listed: Arithmetic Mean Filter, Geometric Mean Filter, Harmonic Mean Filter, and Contraharmonic Mean Filter.
5:00 – 10:00 05:00-10:00
The lecture moves to the arithmetic mean filter, defined by the formula “Arithmetic Mean = Sum of pixel values / Number of pixels.” A 3×3 grid is shown with the center value “200” highlighted in red as a noisy pixel. The calculation box shows Sum = 588, Number of pixels = 9, and Arithmetic Mean = 588 / 9 ≈ 65.33 ≈ 65. A key point line reads “Arithmetic Mean → Normal Average → Noise Reduction → Possible Blurring.” Red hand-drawn circles and brackets are added around the grid and around the “9” and “65” in the calculation box. The slide then switches to the geometric mean filter, defined by “Geometric Mean = (Product of all pixel values)^(1/N).” A product line is shown ending in ≈ 59.15 ≈ 59, and the filtered center cell displays 59. Bottom rows on each slide show three small grids labeled “NOISY IMAGE (PART),” “APPLY ... FILTER,” and “FILTERED IMAGE (PART)” to illustrate the filtering steps.
10:00 – 15:00 10:00-15:00
The harmonic mean filter is introduced with the formula “Harmonic Mean = N / Σ(1/xi).” The same 3×3 neighborhood with center value “200” marked red as a very bright noisy pixel is used. Red hand-drawn annotations accumulate, including a box around the formula and a boxed “46” in the SOLUTION panel with an arrow. A bottom workflow reads “1. NOISY IMAGE (PART),” “2. APPLY HARMONIC MEAN FILTER,” and “FILTERED IMAGE (PART),” with the center replaced by 46. The lecture then transitions to the contraharmonic mean filter, listing “Q > 0 → Removes pepper noise (dark spots)” and “Q < 0 → Removes salt noise (bright spots).” This establishes the role of the parameter Q in controlling which type of impulse noise is reduced.
15:00 – 17:55 15:00-17:55
A comparison table titled “COMPARISON OF MEAN FILTERS” is displayed with four columns: Arithmetic, Geometric, Harmonic, and Contraharmonic Mean Filter. The rows are organized for Idea, How it works, Formula, Useful for, Effect on Image, and Note. The lecture then shows a slide headed “Example of all mean filters :” containing X-ray circuit-board images with captions referencing an arithmetic mean filter, a geometric mean filter, and contraharmonic filtering at Q = 15 and Q = -15. Red handwritten annotations appear at the top reading “+15,” “Q>0,” “Q<0,” and “-15” with checkmarks, plus red arrows pointing to specific image regions. The final frame returns to the initial slide with the equation g(x,y) = f(x,y) + η(x,y) and the flowchart under “SPATIAL FILTERS FOR DE-NOISING ADDITIVE NOISE,” closing the lecture on mean filters.
The lecture follows a clear pedagogical progression from the general noise model to specific filter implementations. It starts by establishing that additive noise is unknown and cannot be subtracted directly, motivating spatial filtering as the solution. The three broad categories of de-noising filters are introduced, with mean filters receiving detailed treatment. Each mean filter is presented with its formula, a worked example on a 3×3 neighborhood containing a bright noisy pixel of value 200, and the resulting filtered center value. The arithmetic mean yields approximately 65, the geometric mean approximately 59, and the harmonic mean 46, demonstrating that different means produce different levels of noise reduction. The contraharmonic filter is distinguished by its parameter Q, which controls whether pepper or salt noise is removed. The comparison table consolidates the four filters by idea, formula, usefulness, and effect on image quality. The final X-ray circuit-board examples provide practical visual evidence of each filter’s performance, with contraharmonic filtering shown at both Q = 15 and Q = -15 to illustrate the effect of sign choice. The lecture emphasizes that mean filters reduce additive noise but may introduce blurring, and that the choice of filter depends on the type of noise present.