2022
DOI: 10.48550/arxiv.2204.12039
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Learning Weighting Map for Bit-Depth Expansion within a Rational Range

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 35 publications
0
1
0
Order By: Relevance
“…Byun et al [7] proposed a method to identify the bit-depth of input images by providing the network with bit-depth information concatenated with the input image. Liu et al [8] learned a unified representation for different bit-depth degradation by concatenating the theoretical upper bound of the missing information as bit-depth information to the input. Punnappurath et al [9] progressively recovered each missing bitplane from the bit-depth of the input image to the desired bit-depth by training an independent multiple networks on a bitplane wise.…”
Section: Introductionmentioning
confidence: 99%
“…Byun et al [7] proposed a method to identify the bit-depth of input images by providing the network with bit-depth information concatenated with the input image. Liu et al [8] learned a unified representation for different bit-depth degradation by concatenating the theoretical upper bound of the missing information as bit-depth information to the input. Punnappurath et al [9] progressively recovered each missing bitplane from the bit-depth of the input image to the desired bit-depth by training an independent multiple networks on a bitplane wise.…”
Section: Introductionmentioning
confidence: 99%