A fast two-dimensional median filtering algorithm

1979/02/01 by T. Huang, Thomas S. Huang, Gang Yang +3 · 1,383 citations
Computer Science · #Advanced Data Compression Techniques #Algorithm #Artificial intelligence #Computer science #Data Management and Algorithms #Histogram #Image (mathematics) #Image Retrieval and Classification Techniques #Image processing #Median filter #Sorting #Sorting algorithm #Window (computing)

paper · doi:10.1109/tassp.1979.1163188

published in IEEE Transactions on Acoustics Speech and Signal Processing 27(1), 13-18 (Institute of Electrical and Electronics Engineers)

openalex publication_date 1979/02/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Abstract

We present a fast algorithm for two-dimensional median filtering. It is based on storing and updating the gray level histogram of the picture elements in the window. The algorithm is much faster than conventional sorting methods. For a window size of m × n, the computer time required is 0(n).

Cited by

• ImageNet-trained CNNs are not biased towards texture: Revisiting feature reliance through controlled suppression
• Rotation-Parameterized Graph Fractional Fourier Transform: Definition, Properties, and Optimal Filtering
• SDPA++: A General Framework for Self-Supervised Denoising with Patch Aggregation
• A Convergent Generalized Krylov Subspace Method for Compressed Sensing MRI Reconstruction with Gradient-Driven Denoisers
• Preemptive Hallucination Reduction: An Input-Level Approach for Multimodal Language Model
• Fast Isotropic Median Filtering
• Nash: Neural Adaptive Shrinkage for Structured High-Dimensional Regression
• Computational Microstructure Analysis of Sintered Ceramics
• A PCB Dataset for Defects Detection and Classification