Efficient serial and parallel algorithms for median filtering

摘要

A serial algorithm for separable median filtering is developed that requires only two comparisons per element when the window size is three. In addition, fast parallel concurrent-read-exclusive-write parallel random-access machine (CREW PRAM) algorithms with good processor-time product are developed for separable median filtering and two-dimensional median filtering.