Self-supervised Noise2noise Method Utilizing Corrupted Images with a Modular Network for LDCT Denoising

Yuting Zhu, Qiang He, Yudong Yao, Yueyang Teng
8/13/2023
eess.IVcs.CV

Official code: XYuan01/Self-supervised-Noise2Noise-for-LDCT (9 stars, last commit 2023-04-17).

Abstract

Deep learning is a very promising technique for low-dose computed tomography (LDCT) image denoising. However, traditional deep learning methods require paired noisy and clean datasets, which are often difficult to obtain. This paper proposes a new method for performing LDCT image denoising with only LDCT data, which means that normal-dose CT (NDCT) is not needed. We adopt a combination including the self-supervised noise2noise model and the noisy-as-clean strategy. First, we add a second yet similar type of noise to LDCT images multiple times. Note that we use LDCT images based on the noisy-as-clean strategy for corruption instead of NDCT images. Then, the noise2noise model is executed with only the secondary corrupted images for training. We select a modular U-Net structure from several candidates with shared parameters to perform the task, which increases the receptive field without increasing the parameter size. The experimental results obtained on the Mayo LDCT dataset show the effectiveness of the proposed method compared with that of state-of-the-art deep learning methods. The developed code is available at https://github.com/XYuan01/Self-supervised-Noise2Noise-for-LDCT.

View on arXivView PDF

Code Implementations(1)

Self-supervised Noise2Noise for LDCT denoising from corrupted images.

90PythonApr 17, 20233 years ago

Similar Papers

Cite this paper

@article{zhu2023selfsupervised,
  title  = {Self-supervised Noise2noise Method Utilizing Corrupted Images with a Modular Network for LDCT Denoising},
  author = {Yuting Zhu and Qiang He and Yudong Yao and Yueyang Teng},
  year   = {2023},
  eprint = {2308.06746},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2308.06746v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2308.06746.svg)](https://codeofpaper.com/paper/2308.06746)

Discussion