About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Getting the Median Faster
Abstract
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. © 1981 Academic Press, Inc.