New radix-2-based algorithm for fast median filtering

A fast radix-2-based median filtering algorithm is proposed. The median is determined bit-by-bit successively by eliminating the samples whose previous bits are different to that of the median. The intermediate computations of the algorithm do not involve any array computation, nor any memory. The worst-case computational complexity of the algorithm is O(w) for w samples.