Abstract
An iterative trimmed and truncated arithmetic mean (ITTM) algorithm is proposed, and the ITTM filters are developed. Here, trimming a sample means removing it and truncating a sample is to replace its value by a threshold. Simultaneously trimming and truncating enable the proposed filters to attenuate the mixed additive and exclusive noise in an effective way. The proposed trimming and truncating rules ensure that the output of the ITTM filter converges to the median. It offers an efficient method to estimate the median without time-consuming data sorting. Theoretical analysis shows that the ITTM filter of size n has a linear computational complexity O(n). Compared to the median filter and the iterative truncated arithmetic mean (ITM) filter, the proposed ITTM filter suppresses noise more effectively in some cases and has lower computational complexity. Experiments on synthetic data and real images verify the filter's properties.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
