2019
DOI: 10.1109/tifs.2018.2879301
|View full text |Cite
|
Sign up to set email alerts
|

A Scalable Architecture for Uncompressed-Domain Watermarked Videos

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 29 publications
(18 citation statements)
references
References 36 publications
0
18
0
Order By: Relevance
“…A disadvantage of both uncompressed-domain and inthe-loop watermarking techniques is their high embedding complexity: every watermarked video requires a separate video encoding. Although the complexity of encoding watermarked videos can be severely reduced by re-using coding information, this results in an additional decrease in compression efficiency [6]. For example, our previous work proposed to embed a watermark by slightly changing only a single intra-prediction mode during compression, while forcing all other coding decisions to be the same as the compressed unwatermarked video [7].…”
Section: State Of the Artmentioning
confidence: 99%
See 1 more Smart Citation
“…A disadvantage of both uncompressed-domain and inthe-loop watermarking techniques is their high embedding complexity: every watermarked video requires a separate video encoding. Although the complexity of encoding watermarked videos can be severely reduced by re-using coding information, this results in an additional decrease in compression efficiency [6]. For example, our previous work proposed to embed a watermark by slightly changing only a single intra-prediction mode during compression, while forcing all other coding decisions to be the same as the compressed unwatermarked video [7].…”
Section: State Of the Artmentioning
confidence: 99%
“…These watermarking systems have a higher complexity than compressed-domain systems, since each watermarked video requires a separate encoding. Although an architecture has been proposed that reduces the compression complexity by re-using coding information, it comes at the expense of an additional decrease in compression efficiency [6]. For example, previous work proposed to introduce a watermark by changing a single coding decision while preserving all other coding information, but had a non-negligible negative impact on the visual quality and bit rate [7].…”
Section: Introductionmentioning
confidence: 99%
“…If the current coeff_abs_level_remaining value is less than or equal to 7, data extraction can be performed as Eq. (9). Otherwise, if it is in the interval [8], [11] or [12], [19], the extraction of the data bit can be performed as Eq.…”
Section: Case 2 Rice Parameter M =mentioning
confidence: 99%
“…In the literature, many different data hiding algorithms have been proposed and overviews of these algorithms are also provided [2], [3]. For example, some existing systems embed the information in the uncompressed domain [8], [9]. However, lossy compression is inherently contradictory with data hiding and may result in unreliable extraction of hidden information.…”
Section: Introductionmentioning
confidence: 99%
“…f * S i can be recovered to f S i by the reverse process of Equation (18). Denoted the recovered coefficient asf…”
Section: Irreversible K-em/k-dmmentioning
confidence: 99%