z-logo
open-access-imgOpen Access
An effective weighted vector median filter for impulse noise reduction based on minimizing the degree of aggregation
Author(s) -
Meng Xiangxi,
Lu Tongwei,
Min Feng,
Lu Tao
Publication year - 2021
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/ipr2.12023
Subject(s) - impulse noise , pixel , artificial intelligence , mathematics , noise (video) , outlier , pattern recognition (psychology) , noise reduction , weighting , median filter , computer science , image (mathematics) , image processing , medicine , radiology
Impulse noise is regarded as an outlier in the local window of an image. To detect noise, many proposed methods are based on aggregated distance, including spatially weighted aggregated distance, n nearest neighbour distance, local density, and angle‐weighted quaternion aggregated distance. However, these methods ignore the weight of each pixel or have limited adaptability. This study introduces the concept of degree of aggregation and proposes a weighting method to obtain the weight vector of the pixels by minimizing the degree of aggregation. The weight vector obtained gives larger components on the signal pixels than on the noisy pixels. Then it is fused with the aggregated distance to form a weighted aggregated distance that can reasonably characterise the noise and signal. The weighted aggregated distance, along with an adaptive segmentation method, can effectively detect the noise. To further enhance the effect of noise detection and removal, an adaptive selection strategy is incorporated to reduce the noise density in the local window. At last, noisy pixels detected are replaced with the weighted channel combination optimization values. The experimental results exhibit the validity of the proposed method by showing better performance in terms of both objective criteria and visual effects.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here