Please use this identifier to cite or link to this item:
|Title:||Block median filters||Authors:||Kasparis, Takis
Memon, Qurban A.
|Keywords:||Algorithms;Statistical methods;Cost effectiveness;Filters and filtration||Issue Date:||1995||Publisher:||SPIE||Source:||Visual Information Processing IV, 1995, Orlando, Florida||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.||URI:||http://ktisis.cut.ac.cy/handle/10488/7196
|ISSN:||0277786X||DOI:||10.1117/12.211993||Rights:||© 1995 SPIE||Type:||Conference Papers|
|Appears in Collections:||Δημοσιεύσεις σε συνέδρια/Conference papers|
Show full item record
checked on Dec 16, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.