On fast running max-min filtering
Dinu Coltuc, Ioannis Pitas · IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing · 1997
The problem of fast running max/min filters for arbitrary size windows is addressed. The size of the filter window is increased to the least power of two greater than the given size and, the input sequence is expanded. The running max/min computation uses a fast algorithm for power of two window sizes. The computational complexity (comparisons per sample) of the proposed algorithm is very close to log/sub 2/ n, where n is the size of the given window. A flexible hardware implementation for n ranging between two consecutive powers of two is discussed.