Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element

Abstract

The running maximum-minimum (max-min) filter computes the maxima and minima over running windows of size w. This filter has numerous applications in signal processing and time series analysis. We present an easy-to-implement online algorithm requiring no more than 3 comparisons per element, in the worst case. Comparatively, no algorithm is known to compute the running maximum (or minimum) filter in 1.5 comparisons per element, in the worst case. Our algorithm has reduced latency and memory usage.

to appear in Nordic Journal of Computing

Cited by in corpus (3)

• Faster Retrieval with a Two-Pass Dynamic-Time-Warping Lower Bound
• Faster Sequential Search with a Two-Pass Dynamic-Time-Warping Lower Bound
• Time Robustness in MTL and Expressivity in Hybrid System Falsification (Extended Version)