Open access research
publication repository
publication repository
Lemire, Daniel (2006). Streaming maximum-minimum filter using no more than three comparisons per element. Nordic Journal of Computing, 13 (4), 328-339.
File(s) available for this item:| PDF - webmaximinalgo.pdf |
|
| Item Type: | Journal Articles |
|---|---|
| Refereed: | Yes |
| Status: | Published |
| 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. |
| Depositor: | Lemire, Daniel |
| Owner / Manager: | Daniel Lemire |
| Deposited: | 05 Jun 2007 |
| Last Modified: | 16 Jul 2015 00:47 |
|
RÉVISER |
