Papers › Neighbor2Neighbor: Self-Supervised Denoising from Single Noisy Images

Neighbor2Neighbor: Self-Supervised Denoising from Single Noisy Images

8 Jan 2021CVPR 2021 1arXiv:2101.02824archive 2025-07-28

Tao Huang, Songjiang Li, Xu Jia, Huchuan Lu, Jianzhuang Liu

In the last few years, image denoising has benefited a lot from the fast development of neural networks. However, the requirement of large amounts of noisy-clean image pairs for supervision limits the wide use of these models. Although there have been a few attempts in training an image denoising model with only single noisy images, existing self-supervised denoising approaches suffer from inefficient network training, loss of useful information, or dependence on noise modeling. In this paper, we present a very simple yet effective method named Neighbor2Neighbor to train an effective image denoising model with only noisy images. Firstly, a random neighbor sub-sampler is proposed for the generation of training image pairs. In detail, input and target used to train a network are images sub-sampled from the same noisy image, satisfying the requirement that paired pixels of paired images are neighbors and have very similar appearance with each other. Secondly, a denoising network is trained on sub-sampled training pairs generated in the first stage, with a proposed regularizer as additional loss for better performance. The proposed Neighbor2Neighbor framework is able to enjoy the progress of state-of-the-art supervised denoising networks in network architecture design. Moreover, it avoids heavy dependence on the assumption of the noise distribution. We explain our approach from a theoretical perspective and further validate it through extensive experiments, including synthetic experiments with different noise distributions in sRGB space and real-world experiments on a denoising benchmark dataset in raw-RGB space.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2101.02824")

Code

Syntology Ran 12 of 13 code samples harvested from 4 repositories linked to this paper; 1 has no recorded run. Of those that ran: 1 ran · our draft was wrong; 3 ran · fixture could not drive it; 8 ran with no contract checked.

By repository: official repository: 6 samples from 1 repository, 5 ran; community (archive-listed): 7 samples from 3 repositories, 7 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

TaoHuang2018/Neighbor2Neighbor officialmentioned in papermentioned on GitHubpytorch report
Wenchao-Du/Neighbor2Neighbor_Pytorch mentioned on GitHubpytorch report
neeraj3029/Ne2Ne-Image-Denoising mentioned on GitHubpytorch report
pminhtam/Neigh2Neigh mentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

13 samples harvested; 12 ran; 0 honoured the contract we drafted; 1 has no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
3ran · fixture could not drive it
8ran
1unverified

Licence: 7 of the 13 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 4 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

UNet TaoHuang2018/Neighbor2Neighbor/arch_unet.py official repository ran · metamorphic tier: deterministic BSD-3-Clause (permissive) · 50e8e32ad310c881 · report
UpsampleCat TaoHuang2018/Neighbor2Neighbor/arch_unet.py official repository ran · metamorphic tier: deterministic BSD-3-Clause (permissive) · 5c84351023118bb3 · report
conv_func TaoHuang2018/Neighbor2Neighbor/arch_unet.py official repository ran · our draft was wrong BSD-3-Clause (permissive) · f844c4029b596c7d · report
pool_func TaoHuang2018/Neighbor2Neighbor/arch_unet.py official repository ran · fixture could not drive it BSD-3-Clause (permissive) · d0e74e91b0b81520 · report
rotate TaoHuang2018/Neighbor2Neighbor/arch_unet.py official repository ran · fixture could not drive it BSD-3-Clause (permissive) · 619d574c900357ee · report
initialize_weights TaoHuang2018/Neighbor2Neighbor/arch_unet.py official repository unverified BSD-3-Clause (permissive) · 4f766d82438d4198 · report
Crop2d pminhtam/Neigh2Neigh/ssdn/network.py community (archive-listed) ran fingerprinted no licence file found · pointer only · c9ef6c33ec47630e · report
Multi_MSE_Loss Wenchao-Du/Neighbor2Neighbor_Pytorch/libs/loss.py community (archive-listed) ran · metamorphic tier: invariant fingerprinted no licence file found · pointer only · f249185d6b91104c · report
NoiseNetwork pminhtam/Neigh2Neigh/ssdn/network.py community (archive-listed) ran no licence file found · pointer only · c8bfe7ded4cad667 · report
Shift2d pminhtam/Neigh2Neigh/ssdn/network.py community (archive-listed) ran fingerprinted no licence file found · pointer only · a6334958a9565f52 · report
ShiftConv2d pminhtam/Neigh2Neigh/ssdn/network.py community (archive-listed) ran fingerprinted no licence file found · pointer only · b05820d71c37ef68 · report
UNet neeraj3029/Ne2Ne-Image-Denoising/UNet.py community (archive-listed) ran · metamorphic tier: deterministic no licence file found · pointer only · 0224deb6ef909d03 · report
rotate pminhtam/Neigh2Neigh/ssdn/network.py community (archive-listed) ran · fixture could not drive it fingerprinted no licence file found · pointer only · c0c224ec3f6201e6 · report

Tasks

DenoisingImage DenoisingSelf-Supervised Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections