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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
