Further Properties and a Fast Realization of the Iterative Truncated Arithmetic Mean Filter
The iterative truncated arithmetic mean (ITM) filter has been recently proposed. It possesses merits of both the mean and median filters. In this brief, the Cramer-Rao lower bound is employed to further analyze the ITM filter. It shows that this filter outperforms the median filter in attenuating no...
Saved in:
Published in | IEEE transactions on circuits and systems. II, Express briefs Vol. 59; no. 11; pp. 810 - 814 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
New York
IEEE
01.11.2012
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The iterative truncated arithmetic mean (ITM) filter has been recently proposed. It possesses merits of both the mean and median filters. In this brief, the Cramer-Rao lower bound is employed to further analyze the ITM filter. It shows that this filter outperforms the median filter in attenuating not only the short-tailed Gaussian noise but also the long-tailed Laplacian noise. A fast realization of the ITM filter is proposed. Its computational complexity is studied. Experimental results demonstrate that the proposed algorithm is faster than the standard median filter. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 1549-7747 1558-3791 |
DOI: | 10.1109/TCSII.2012.2218473 |