Efficient Serial and Parallel Algorithms for Median Filtering

We develop a serial algorithm for separable median filtering that requires only two comparisons per element when the window size is three. In addition, fast parallel CREW PRAM algorithms with good processor-time product are developed for separable median filtering and two dimensional median filtering. Keywords and Phrases Median filtering, separable median filtering, complexity, CREW PRAM algorithms 1 

• Type: Conference
• Year: 1989
• Where: ICPP
• Authors: Sanjay Ranka, Sartaj Sahni
• Keywords: CREW PRAM Algorithms, Distributed And Parallel Computing, ICPP 1989, Parallel Crew Pram, Serial Algorithm