Abstract
A novel algorithm is proposed to compute the median of a running window of m integers in O(lg lg m) time. For a new window, the new median value is computed as a simple decision based on the previous median and the values removed and inserted into the window. This facilitates implementations based on data structures that support fast ordinal predecessor/successor operations. The results show accelerations of up to factors of six for integer data streaming in typical embedded processors.
Original language | English |
---|---|
Article number | 8453865 |
Pages (from-to) | 58-61 |
Number of pages | 4 |
Journal | IEEE Embedded Systems Letters |
Volume | 11 |
Issue number | 2 |
DOIs | |
Publication status | Published - 3 Sept 2018 |
Bibliographical note
Publisher Copyright:© 2018 IEEE.
Keywords
- Embedded processors
- median
- median filter
- running median
- streaming algorithms