2020
DOI: 10.1109/tip.2020.2975909
|View full text |Cite
|
Sign up to set email alerts
|

Lower Bound on Transmission Using Non-Linear Bounding Function in Single Image Dehazing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
21
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 61 publications
(21 citation statements)
references
References 45 publications
0
21
0
Order By: Relevance
“…Despite the good results and broad applicability, the assumption on the linear relationship was easily broken, resulting in failures for images with heterogeneous lighting conditions. Recently, Raikwar and Tapaswi [60] estimated the medium transmittance using the difference of minimum color channels, which was modeled by the bounding function. Next, they adopted a supervised learning method that was fundamentally similar to MLE to estimate this function.…”
Section: Machine Learningmentioning
confidence: 99%
See 1 more Smart Citation
“…Despite the good results and broad applicability, the assumption on the linear relationship was easily broken, resulting in failures for images with heterogeneous lighting conditions. Recently, Raikwar and Tapaswi [60] estimated the medium transmittance using the difference of minimum color channels, which was modeled by the bounding function. Next, they adopted a supervised learning method that was fundamentally similar to MLE to estimate this function.…”
Section: Machine Learningmentioning
confidence: 99%
“…Similar to the previous subsection, a branching diagram shown in Figure 10 provides a quick overview of the aforementioned introduction of dehazing algorithms utilizing machine learning techniques. Random forest regression [54] Least squares regression [55][56][57][58] Adaptive regularization [60] Total variation regularization [61,62,64,65] L2 regularization [63] Sparsity regularization [65] Information loss [67] Bayesian framework [69] Inhomogeneous Laplacian-Markov random field [70] Local consistent Markov random field [71] Nelder-Mead direct search [73] Huber loss exploitation [74] Fibonacci search [72] Independent component analysis [75] Dictionary learning [76] Radial basis function [77] k-means clustering [79][80][81][82] Semantic-guided regularization [68] Figure 10. Branching diagram summarizing machine-learning-based dehazing algorithms.…”
Section: Machine Learningmentioning
confidence: 99%
“…Moreover, we have translated the problem of SID into estimation of difference channel in [26]. Method in [26] assumed that the color channels share same transmission and atmospheric light. Therefore, MC can be used to find transmission by using (3).…”
Section: Atmospheric Scattering Model (Asm)mentioning
confidence: 99%
“…Minimization of error in D err (x, y) will generate accurate transmission. The method in [26] computed D err (x, y) by using a non-linear bounding function. However, the non-linearity of this function increases the computational complexity.…”
Section: Atmospheric Scattering Model (Asm)mentioning
confidence: 99%
“…Raikwar and Tapaswi [ 11 ] rearranged the atmospheric scattering model to estimate the transmission map based on the difference of minimum color channels in order to further improve visibility restoration. They adopted a bounding function to model this difference and exploited the regression technique to estimate the bounding function.…”
Section: Introductionmentioning
confidence: 99%