New radix-2-based algorithm for fast median filtering
Date
1989
Authors
Karaman, M.
Onural, L.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
4
views
views
13
downloads
downloads
Citation Stats
Series
Abstract
A fast radi-2-based median filtering algorithm is proposed. The median is determined bit-by-bit successively by eliminating the samples whose previous bits are different to that of the median. The intermediate computations of the algorithm do not involve any array computation, nor any memory. The worst-case computational complexity of the algorithm is O(w) for w samples.
Source Title
Electronics Letters
Publisher
IEEE
Course
Other identifiers
Book Title
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English