2021
DOI: 10.1016/j.patcog.2021.108124
|View full text |Cite
|
Sign up to set email alerts
|

Meta-learning based relation and representation learning networks for single-image deraining

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 18 publications
(5 citation statements)
references
References 23 publications
0
5
0
Order By: Relevance
“…PDAG-Net [21] is the end-to-end progressive downsampling and adaptive guidance network to handle the shortcoming of existing downsampling methods. In the image deraining task, Gao et al [22] improve the deraining performance with a meta-learning based representation learning network. One of the generative and adversarial based approaches, DANet [23] applies the U-Net as the baseline of noise generator and denoiser.…”
Section: Related Work a Image Restorationmentioning
confidence: 99%
“…PDAG-Net [21] is the end-to-end progressive downsampling and adaptive guidance network to handle the shortcoming of existing downsampling methods. In the image deraining task, Gao et al [22] improve the deraining performance with a meta-learning based representation learning network. One of the generative and adversarial based approaches, DANet [23] applies the U-Net as the baseline of noise generator and denoiser.…”
Section: Related Work a Image Restorationmentioning
confidence: 99%
“…In Eqn. (27), the first and second expressions are the dichotomous and multiple classification expressions, respectively. In Eqn.…”
Section: Objective Functionmentioning
confidence: 99%
“…(34), the input is a triplet, including the anchoring example ( ), positive example ( ), and negative example ( ). Deng et al [27] use a triplet loss by optimizing the distance between the anchoring example and the positive example to be smaller than the distance between the anchoring example and the negative example, the similarity calculation between the samples is realized. In Eqn.…”
Section: Objective Functionmentioning
confidence: 99%
“…The local linear embedding method describes the reconstruction relationship between local neighbor nodes with a graph, and maintains this local reconstruction relationship in a low-dimensional space. The Laplacian feature mapping method enables the latent low-dimensional space to still maintain the data similarity relationship in the original space, which is used to preserve the nonlinear structure of the data (Gao et al, 2021). However, when such methods are applied to large-scale networks, the computational complexity is greatly affected by the number of vertices, and the scalability is limited.…”
Section: Literature Reviewmentioning
confidence: 99%