Getting the Median Faster

✍ Scribed by Per-Erik Danielsson

• Book ID: 104290703
• Publisher: Elsevier Science
• Year: 1981
• Weight: 347 KB
• Volume: 17
• Category: Article
• ISSN: 0146-664X
• DOI: 10.1016/s0146-664x(81)80010-x

✦ Synopsis

Median filters and rank-order filters are generally considered to be more time consuming than, e.g., averaging filters. With the new algorithm presented in this report the opposite turns out to be true. The median (or any other rank-order value) is obtained by examining the bits of the arguments columnwise starting with the most significant bits. Hardware implementations suitable for parallel processing are presented.