Abstract
A fast and flexible median algorithm is presented which scales well with window size. It is based on the use of image histograming. Two accumulator arrays are used to determine the median value of a discrete sequence of numbers. Speed-up factors of 3 and 4 are achieved over conventional histograming methods (those using single accumulator arrays). Two approaches have been implemented with optimisation in mind. Worst- and best case machine performance boundaries are defined. Timings are given for both types of parallel architecture.
Sign-in/Register to access full text options 
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 callMore From: IEE Proceedings - Vision, Image, and Signal Processing
Disclaimer: 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.
