A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels
Pattern Recognition Letters
Introduction to Algorithms
Computing 2-D Min, Median, and Max Filters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Dilation, Erosion, Opening, and Closing Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Asynchronous Implementation of the MAXLIST Algorithm
ICASSP '97 Proceedings of the 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '97) -Volume 1 - Volume 1
Warping indexes with envelope transforms for query by humming
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Defending Against Low-Rate TCP Attacks: Dynamic Detection and Protection
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Exact indexing of dynamic time warping
Knowledge and Information Systems
Morphological Erosions and Openings: Fast Algorithms Based on Anchors
Journal of Mathematical Imaging and Vision
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Running max/min calculation using a pruned ordered list
IEEE Transactions on Signal Processing
Stroke-model-based character extraction from gray-level document images
IEEE Transactions on Image Processing
Faster retrieval with a two-pass dynamic-time-warping lower bound
Pattern Recognition
Computationally efficient, one-pass algorithm for morphological filters
Journal of Visual Communication and Image Representation
Fast streaming algorithm for 1-D morphological opening and closing on 2-D support
ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
| Hi-index | 0.00 |
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.