3 research outputs found

    Improved Iterative Truncated Arithmetic Mean Filter

    Get PDF
    This thesis discusses image processing and ļ¬ltering techniques with emphasis on Mean ļ¬lter, Median ļ¬lter, and diļ¬€erent versions of the Iterative Truncated Arithmetic Mean (ITM) ļ¬lter. Speciļ¬cally, we review in detail the ITM algorithms (ITM1 and ITM2) proposed by Xudong Jiang. Although ļ¬ltering is capable of reducing noise in an image, it usually also results in smoothening or some other form of distortion of image edges and ļ¬le details. Therefore, maintaining a proper trade oļ¬€ between noise reduction and edge/detail distortion is key. In this thesis, an improvement over Xudong Jiangā€™s ITM ļ¬lters, namely ITM3, has been proposed and tested for diļ¬€erent types of noise and for diļ¬€erent images. Each of the two original ITM ļ¬lters performs better than the other under diļ¬€erent conditions. Experimental results demonstrate that the proposed ļ¬lter, ITM3, provides a better trade oļ¬€ than ITM1 and ITM2 in terms of attenuating diļ¬€erent types of noise and preserving ļ¬ne image details and edges

    Further properties and a fast realization of the iterative truncated arithmetic mean filter

    No full text
    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
    corecore