Share Email Print

Proceedings Paper

Block median filters
Author(s): Qurban A. Memon; Takis Kasparis
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Rank and median filters (MFs) have become one of the standard techniques for suppressing noise of impulsive nature. A limitation of these filters is the high computational cost when implemented on general purpose computers. Several fast algorithms have been developed for specific types of signals. An alternative is computationally more efficient filters with MF-like performance. One proposed filter in this category with selectable trade-off between reduction of computation and MF-like performance is the block median filter (BMF). The BMF produces a median block at each window position, thus effectively reducing the total window steps and the computation. In this paper some statistical properties of the BMF and comparisons with the MF are presented. It is shown that for large window sized, the statistical properties of the BMF approach those of the MF.

Paper Details

Date Published: 16 June 1995
PDF: 10 pages
Proc. SPIE 2488, Visual Information Processing IV, (16 June 1995); doi: 10.1117/12.211993
Show Author Affiliations
Qurban A. Memon, Univ. of Central Florida (United States)
Takis Kasparis, Univ. of Central Florida (United States)

Published in SPIE Proceedings Vol. 2488:
Visual Information Processing IV
Friedrich O. Huck; Richard D. Juday, Editor(s)

© SPIE. Terms of Use
Back to Top