2018
DOI: 10.1016/j.apm.2018.03.001
|View full text |Cite
|
Sign up to set email alerts
|

A directional global sparse model for single image rain removal

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
100
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
4

Relationship

1
7

Authors

Journals

citations
Cited by 134 publications
(101 citation statements)
references
References 23 publications
1
100
0
Order By: Relevance
“…As shown in Figure , the identification algorithm is robust when the rain streaks are within ±15° from vertical. This tolerance range is consistent with a previous finding (Deng et al, ) and implies that the effectiveness of employing the Y‐direction total variance (i.e., the vertical smoothness of rain streaks) is not significantly impaired when the angle of rain streaks is within a certain range. One possible reason is that the Y direction total variance regularization term (the second term) merely controls part of the objective function equation and is insensitive to identification as discussed in section .…”
Section: The Effectiveness and Efficiency Of Rain‐streak Identificationsupporting
confidence: 92%
See 1 more Smart Citation
“…As shown in Figure , the identification algorithm is robust when the rain streaks are within ±15° from vertical. This tolerance range is consistent with a previous finding (Deng et al, ) and implies that the effectiveness of employing the Y‐direction total variance (i.e., the vertical smoothness of rain streaks) is not significantly impaired when the angle of rain streaks is within a certain range. One possible reason is that the Y direction total variance regularization term (the second term) merely controls part of the objective function equation and is insensitive to identification as discussed in section .…”
Section: The Effectiveness and Efficiency Of Rain‐streak Identificationsupporting
confidence: 92%
“…In contrast, the single‐image‐based algorithms rely more on the properties of rain streaks (Deng et al, ), making such algorithms more robust for complex applications (e.g., those with nonstatic backgrounds with moving pedestrians or vehicles). The main idea behind single image‐based algorithms is to decompose a rain‐contained image into a rain‐free layer and a rain‐streak layer through photographic analyses of rain streaks (Deng et al, ; Jiang et al, ; Li et al, ). In general, a grayscale rain‐containing image can be mathematically characterized by a two‐dimensional matrix scriptOm×n (where m and n are the image height and width, respectively) whose elements are grayscale values.…”
Section: Methodsmentioning
confidence: 99%
“…However, the effects of the rain streaks on the vertical gradient and horizontal gradient are different. This phenomenon was likewise noticed in [19][20][21]. Initially, for the sake of convenience, we assume that rain streaks are approximately vertical.…”
Section: Introductionmentioning
confidence: 59%
“…Zhu et al [16] proposed a joint bi-layer optimization method progressively separate rain streaks from background details, in which the gradient statistics are analyzed. Meanwhile, the directional property of rain streaks received a lot of attention in [19][20][21] and these methods achieved promising performances. Ren et al [23] removed the rain streaks from the image recovery perspective.…”
Section: Introductionmentioning
confidence: 99%
“…The de-raining algorithms investigated in this paper cover a wide variety of techniques, which include the guided filter, dictionary learning, low-rank approximation, maximum posteriori, directional regularization and deep neural network. For short, we denote them by Ding16 [7], Kang12 [10], Luo15 [11], Li16 [12], Deng17 [24], and Fu17 [14]. In our investigation, all codes are provided by authors and the default parameters are used without additional fine-tuning procedure.…”
Section: A Image Collectionmentioning
confidence: 99%