Abstract

本文提出了一种基于分层滤波技术的图像随机值冲击噪声检测和去除算法。为了解决经典自适应中心加权中值滤波技术在较高噪声比率下漏检严重的问题,我们采取逐级设置由高到低的噪声值判决门限来层层筛选噪声,利用不同高度的门限甄别出不同信赖度的冲击噪点,同时更新已检测出的噪声点值。每一层均得到一幅中间去噪图像,并继续进行噪声点的判决,最终得到完整的噪声点空间以及终极去噪图像。通过对多幅不同噪声比率的噪声图进行图像恢复的仿真实验验证后,得出结论:本文所提算法无论在低噪声比率还是高噪声比率的情况下均能有效地检测出图像中的随机值冲击噪声,漏检和误检像素数相对较低,同时获得了较好的图像去噪效果,极大地扩展了原算法的应用范围。 In this paper, an algorithm about random-valued impulse noise detection and removal based on the hierarchical filter technology is proposed. In order to solve the problem of severe miss detection of classical adaptive center-weighted median filter in the situation of high noise ratios, we set the noise judgment thresholds from high values to low values to select noisy pixels hierarchically. The impulse noise with different reliable degrees is selected through different thresholds and at the same time the detected pixel values are updated. The interim denoised image is generated in each denoising layer and the noise detection continues in the next denoising layer. Lastly, we get all the locations of noisy pixels and the final denoised image is obtained. Extensive experimental results for different noisy images with different noise ratios show that our proposed algorithm can obtain the good performance of random-valued impulse noise detection in the situations of not only low noise ratios but also high noise ratios. The miss and false noise detection ratios are both low relatively. At the same time, the good denoised images can be obtained. Our algorithm expands the application range of the classical adaptive center-weighted median filter.

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

Disclaimer: 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.