Papers › Explore Internal and External Similarity for Single Image Deraining with Graph Neural Networks
Explore Internal and External Similarity for Single Image Deraining with Graph Neural Networks
Cong Wang, Wei Wang, Chengjin Yu, Jie Mu
Patch-level non-local self-similarity is an important property of natural images. However, most existing methods do not consider this property into neural networks for image deraining, thus affecting recovery performance. Motivated by this property, we find that there exists significant patch recurrence property of a rainy image, that is, similar patches tend to recur many times in one image and its multi-scale images and external images. To better model this property for image detaining, we develop a multi-scale graph network with exemplars, called MSGNN, that contains two branches: 1) internal data-based supervised branch is used to model the internal relations of similar patches from the rainy image itself and its multi-scale images and 2) external data-participated unsupervised branch is used to model the external relations of the similar patches in the rainy image and exemplar. Specifically, we construct a graph model by searching the k-nearest neighboring patches from both the rainy images in a multi-scale framework and the exemplar. After obtaining the corresponding k neighboring patches from the multi-scale images and exemplar, we build a graph and aggregate them in an attentional manner so that the graph can provide more information from similar patches for image deraining. We embed the proposed graph in a deep neural network and train it in an end-to-end manner. Extensive experiments demonstrate that the proposed algorithm performs favorably against eight state-of-the-art methods on five public synthetic datasets and one real-world dataset. The source codes will be available at https://github.com/supersupercong/MSGNN.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, on Syntology's MCP service (how to connect):
get_harvested_code_for_paper(arxiv_id="2406.00721")get_code(code_sha256="…")with a sample'scode_sha256from the list belowget_citation_path(paper_1="2406.00721", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2406.00721")
Code
Syntology 17 code samples harvested from 1 repository linked to this paper: 8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 2 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 9 unverified. Where Syntology's instrument failed: 4 where our contract draft was wrong; failures of Syntology's instrument, not of the code.
By repository: official repository: 17 samples from 1 repository, 8 ran (4 with no instrument failure; 4 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Levels written between 2026-09-22 and 2026-09-26 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 3 of the 8 samples that ran have no recorded date.
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
17 samples harvested: 8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 2 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 9 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.
Licence: 17 of the 17 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 supersupercong/msgnn. “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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.
Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.
A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.
26c1bb4e9381e4ba · report
fixture: signature in_channels:int/0/int, out_channels:int/0/int, kernel_size:int/0/int, act:bool/0/bool, stride:int/0/int, groups:int/0/int, bias:bool/0/bool · returned Sequential · level recorded 2026-09-22 6154e3744ece5728 · report
fixture: signature window_size:int/0/int, channel:int/0/int · returned Tensor · level recorded 2026-09-22 60fff7c3c400d7ff · report
fixture: signature val:int/0/int, d:int/0/int · returned int · level recorded, date not recorded 8b0e794d4d8f9b13 · report
fixture: signature in_channels:int/0/int, out_channels:int/0/int, kernel_size:int/0/int, bias:bool/0/bool · returned Conv2d · level recorded 2026-09-22 census: 5 implementations from 103 papers, 1 distinct output on one shared input this sample: bucket 1 of 1, arg 1: rank 1, kind int, dtype int64 msgnn/config/model.py ran · violated contract no licence file found · pointer only ·
aa5486a3650902d8 · report
fixture: signature val:Tensor/1/int · returned bool · level recorded, date not recorded census: 8 implementations from 9 papers, 8 distinct outputs across 4 buckets, one shared input per bucket msgnn/config/cal_ssim.py ran · honoured contract fingerprinted no licence file found · pointer only ·
c56b7ef16f309a45 · report
fixture: signature window_size:int/0/int, sigma:float/0/float · returned Tensor · level recorded, date not recorded 6427f82248a8abb5 · report
fixture: signature D:Tensor/3/float, k:int/0/int, I:Tensor/3/int · returned tuple · level recorded 2026-09-22 9151c793f90473f0 · report
fixture: signature img1:Tensor/4/float, img2:Tensor/4/float, window_size:int/0/int, size_average:bool/0/bool · returned Tensor · level recorded 2026-09-26 368449386e495711 · report
ffe5a3abf305339d · report
census: 4 implementations from 5 papers, 3 distinct outputs across 2 buckets, one shared input per bucket msgnn/config/show.py unverified no licence file found · pointer only ·
0f60b3b109b79d11 · report
053a40727da7d7d6 · report
6235338c52d1b7e2 · report
cad60b1ce9a189ff · report
9cbb1788573756ac · report
f0d617e4aff44069 · report
9ab0226b39401b47 · report
Method as code Syntology
What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.
1 assembly on this paper: 1 harvested, 0 generated.
harvested Assembly for MSGNN (graph method: MSGNN). 6 bricks; individually on a fixture: 2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified. The assembly has not been run end-to-end.
- Graph entry · level 0 · unverified ·
368449386e495711 - GraphConstruct model · level 0 · unverified ·
ffe5a3abf305339d - conv helper · level 1 · ran · our draft was wrong ·
26c1bb4e9381e4ba - index_neighbours helper · level 0 · unverified ·
9cbb1788573756ac - compute_distances helper · level 0 · unverified ·
053a40727da7d7d6 - hard_knn helper · level 1 · ran · our draft was wrong ·
6427f82248a8abb5
Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2406.00721") returns these assemblies with each brick's role and wiring (how to connect).
Tasks
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