Cart (Loading....) | Create Account
Close category search window
 

Two-dimensional median filter algorithm for parallel reconfigurable computers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hayat, L. ; Dept. of Electron. Syst. Eng., Essex Univ., Colchester, UK ; Fleury, M. ; Clark, A.F.

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

Published in:

Vision, Image and Signal Processing, IEE Proceedings -  (Volume:142 ,  Issue: 6 )

Date of Publication:

Dec 1995

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.