Abstract

In the paper, a family of switching filters designed for the impulsive noise removal in color images is analyzed. The framework of the proposed denoising techniques is based on the concept of cumulated distances between the processed pixel and its neighbors. To increase the filtering efficiency, a robust scheme, in which the sum of distances to only the most similar pixels of the neighborhood serves as a measure of impulsiveness, was elaborated. As this trimmed measure is dependent on the image local structure, an adaptive mechanism was also incorporated. Additionally, a very fast design, which enables image denoising in practical applications, is proposed and the choice of the filter output, which is used to replace the noisy pixels, is discussed. The described family of filters was evaluated on a large set of natural test images and compared with the state-of-the-art restoration methods. The analysis of the achieved results shows that the novel filters outperform the existing techniques in terms of both denoising accuracy and computational complexity. In this way, the proposed techniques can be recommended for the application in various image and video enhancement tasks.

Highlights

  • ORIGINAL RESEARCH PAPERFast adaptive switching technique of impulsive noise removal in color images Lukasz Malinski1 Bogdan Smolka

  • Noise reduction belongs to the most important image processing operations

  • The impulse detection step is based on the reduced ordering and computation of trimmed cumulative Euclidean distances. Both Arithmetic Mean Filter (AMF) and Vector Median Filter (VMF) will be considered as the filter providing the estimate of the corrupted pixels, to enable a comparison of these two competitive solutions

Read more

Summary

ORIGINAL RESEARCH PAPER

Fast adaptive switching technique of impulsive noise removal in color images Lukasz Malinski1 Bogdan Smolka. This article is published with open access at Springerlink.com

Introduction
Adaptive switching filtering design
Bold values represent the results obtained for our algorithms
Parameter selection
FOVMF FPGF
Computational complexity
STAMF ASTAMF FASTAMF ACWVMF FAPGF FFNRF FOVMF FPGF
STAMF FFNRF SVMFr
Conclusions
FASTAMF FFNRF
Full Text
Published version (Free)

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 call