Residual Correlation Regularization Based Image Denoising

Patch-based denoising algorithms aim to reconstruct the clean image patch leaving behind the residual as contaminating noise. The residual should possess statistical properties of contaminating noise. However, it is very likely that the residual patch contains remnants from the clean image patch. In...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE signal processing letters 2018-02, Vol.25 (2), p.298-302
Hauptverfasser: Baloch, Gulsher, Ozkaramanli, Huseyin, Yu, Runyi
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Patch-based denoising algorithms aim to reconstruct the clean image patch leaving behind the residual as contaminating noise. The residual should possess statistical properties of contaminating noise. However, it is very likely that the residual patch contains remnants from the clean image patch. In this letter, we propose a new residual correlation based regularization for image denoising. The regularization can effectively render residual patches as uncorrelated as possible. It allows us to derive an analytical solution for sparse coding (atom selection and coefficient calculation). It also leads to a new online dictionary learning update. The clean image is obtained through alternating between the two stages of sparse coding and dictionary updating. The performance of the proposed algorithm is compared with state-of-the-art denoising algorithms in terms of peak signal-to-noise ratio (PSNR), structural similarity index (SSIM), and feature similarity index (FSIM), as well as through visual comparison. Experimental results show that the proposed algorithm is highly competitive and often better than leading denoising algorithms. The proposed algorithm is also shown to offer an efficient complement to the benchmark algorithm of block-matching and 3D filtering (BM3D) especially.
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2017.2789018