2021
DOI: 10.1109/access.2021.3059115
|View full text |Cite
|
Sign up to set email alerts
|

Geometric-Pixel Guided Single-Pass Convolution Neural Network With Graph Cut for Image Dehazing

Abstract: One of the major shortcomings of existing image dehazing algorithms is in estimating scene transmittance, which has assumed many items in the existing algorithms. One key assumption has been pixel uniformity and smoothness. In this paper, we propose to solve the dehazing problem using a combination of single-pass CNN with graph cut algorithms. It considers the transmittance based on differential pixel-based variance, local and global patches and energy functions to improve the transmission map. The proposed al… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
22
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 23 publications
(22 citation statements)
references
References 46 publications
0
22
0
Order By: Relevance
“…Our PFBN is compared with several state-of-the-art dehazing methods, including NLD [27], AODNet [2], NLDN [28] and a Geometric-Pixel Guided CNN proposed by [20]. Besides, the proposed self-ensemble methods are implemented to enhance the reconstruction ability.…”
Section: B Comparison With the State-of-the-art Methodsmentioning
confidence: 99%
“…Our PFBN is compared with several state-of-the-art dehazing methods, including NLD [27], AODNet [2], NLDN [28] and a Geometric-Pixel Guided CNN proposed by [20]. Besides, the proposed self-ensemble methods are implemented to enhance the reconstruction ability.…”
Section: B Comparison With the State-of-the-art Methodsmentioning
confidence: 99%
“…These are attainable via a novel energy function in the depth estimation network. The energy function is based on a novel global-local Markov chain already discussed in detail in [12]. The resultant energy function is optimized by the graph-cut as discussed in Alenezi and Ganesan [12].…”
Section: Minimum Energymentioning
confidence: 99%
“…The energy function is based on a novel global-local Markov chain already discussed in detail in [12]. The resultant energy function is optimized by the graph-cut as discussed in Alenezi and Ganesan [12]. However, in this model, we use the color channel features as representative of both global and local color moments proposed by [57].…”
Section: Minimum Energymentioning
confidence: 99%
See 2 more Smart Citations