Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element
<|reference_start|>Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element: 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.<|reference_end|>
@article{lemire2006streaming,
    title={Streaming Maximum-Minimum Filter Using No More than Three Comparisons
  per Element},
    author={Daniel Lemire},
    journal={Daniel Lemire, Streaming Maximum-Minimum Filter Using No More than
  Three Comparisons per Element, Nordic Journal of Computing, Volume 13, Number
  4, pages 328-339, 2006},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0610046},
    primaryClass={cs.DS}
}