Fast averaging peer group filter for the impulsive noise removal in color images

68Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In the paper, a new approach to the impulsive noise removal in color images is presented. The new filtering design is based on the peer group concept, which determines the membership of a central pixel of the filtering window to its local neighborhood, in terms of the number of close pixels. Two pixels are declared as close if their distance in a given color space does not exceed a predefined threshold value. A pixel is treated as not corrupted by the impulsive noise process, if its peer group consists of at least two close pixels, otherwise this pixel is replaced by a weighted average of uncorrupted samples from the local neighborhood. The peer group size assigned to each pixel is used for the averaging operation, so that pixels which have many peers are taken with higher weight. The new filtering design proved to restore efficiently color images corrupted by even strong impulsive noise, while preserving tiny image details. The beneficial property of the proposed filter is its very low computational complexity, which allows its application in real-time image processing tasks.

Cite

CITATION STYLE

APA

Malinski, L., & Smolka, B. (2016). Fast averaging peer group filter for the impulsive noise removal in color images. Journal of Real-Time Image Processing, 11(3), 427–444. https://doi.org/10.1007/s11554-015-0500-z

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free