A Fast Algorithm for Running Computation of Center Weighted Rank Order Filters
- 25 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. P_8.1-P_8.5
- https://doi.org/10.1109/ndsp.1993.767767
Abstract
This paper presents a fast center weighted rank order filtering algorithm with logarithmic worst case time complexity with respect to the window size. The method is based on a data structure, called an unbalanced "double heap" which naturally supports partition of the window samples into two different "heaps", greater and smaller than the rth sample. The algorithm is designed for any window size and any weight of the center point and needs linear memory dependent only on the window width. There are no restrictions here with respect to the window size, which may be any odd or even number.Keywords
This publication has 3 references indexed in Scilit:
- MEDIAN BASED IDEMPOTENT FILTERSJournal of Circuits, Systems and Computers, 1991
- On computation of the running medianIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- A theoretical analysis of the properties of median filtersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1981