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

@article{citeulike:4184921, 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.}, archivePrefix = {arXiv}, author = {Lemire, Daniel}, citeulike-article-id = {4184921}, citeulike-linkout-0 = {http://arxiv.org/abs/cs/0610046}, citeulike-linkout-1 = {http://arxiv.org/pdf/cs/0610046}, day = {22}, eprint = {cs/0610046}, keywords = {timeseries}, month = {Mar}, posted-at = {2009-03-17 01:17:56}, priority = {2}, title = {Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element}, url = {http://arxiv.org/abs/cs/0610046}, year = {2007} }

TY - JOUR ID - citeulike:4184921 L3 - citeulike-article-id:4184921 N2 - 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. TI - Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element KW - timeseries AU - Lemire, Daniel PY - 2007/Mar/22/ UR - http://arxiv.org/abs/cs/0610046 ER -