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

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

2006-10-09

arxiv.org/abs/cs/0610046v5

Daniel Lemire, Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element, Nordic Journal of Computing,

Computer Science

Data Structures and Algorithms

to appear in Nordic Journal of Computing

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-437643