Key points are not available for this paper at this time.
A fast real-time algorithm is presented for median filtering of signals and images. The algorithm determines the kth bit of the median by inspecting the k most significant bits of the samples. The total number of full-word comparison steps is equal to the wordlength of the samples. Speed and hardware complexity of the algorithm is compared with two other fast methods for median filtering.
Ataman et al. (1980) studied this question.