A Robust Watermarking Scheme for Encrypted JPEG Bitstreams with Format-Compliant Encryption

Chen, Wenhao; Bohang, Zeng; Zheng, P.

doi:10.1109/trustcom/bigdatase.2019.00060

Cited by 2 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In (16), 𝜎 I and 𝜎 ′ I refer to the variance of I and I ′ respectively, 𝜇 I and 𝜇 I ′ are the means of I and I ′ respectively, 𝜎…”

Section: Evaluation Metricsmentioning

confidence: 99%

“…Figures [15][16][17] show the robustness results in terms of BER(%) after various noise contamination attacks. For GN attacks (Figure 15), the Man image which presents the highest PSNR (71 dB) among the tree tested images shows the best robustness, where the BER is always below 1.5% for different noise variances between 0.001 and 0.1.…”

Section: F I G U R E 15mentioning

confidence: 99%

“…Depending on the watermark embedding domain, watermarking schemes can be classified into transform domain and spatial domain categories. In spatial domain, the watermark is directly inserted by manipulating a code value, bit stream, or the pixel value of the host image 15,16 . This technique requires little computational complexity and performs well in terms of imperceptibility, but it suffers from robustness problems against most potential attacks.…”

Section: Introductionmentioning

confidence: 99%

“…In spatial domain, the watermark is directly inserted by manipulating a code value, bit stream, or the pixel value of the host image. 15,16 This technique requires little computational complexity and performs well in terms of imperceptibility, but it suffers from robustness problems against most potential attacks. Transform domain methods are carried out by modifying transform domain coefficients, allowing the increase of robustness and imperceptibility through the centralization of energy distribution.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Robust image watermarking in DCT domain using optimal inter‐block difference

Kricha

Sakly

2023

Concurrency and Computation

View full text Add to dashboard Cite

SummaryRobust watermarking provides valuable solutions to protect the copyright and secure digital images. In this paper, a robust and transparent watermarking scheme in the discrete cosine transform (DCT) domain is presented. The watermark is embedded into the difference of two adjacent DCT coefficients located at the same frequency. The embedding process involves optimal selection of adjacent blocks and DCT coefficients positions. For a given DCT block, the optimal selection is to find the coefficient with the lowest DCT frequency that requires the minimal variation to represent the target watermark bit. To insert the watermark, a new quantization index modulation (QIM) based method with irregular distance between continuous quantizers is employed. The performance of the proposed scheme was extensively evaluated using 12 benchmark images and a total of more than 90 attacks per image grouped into nine attack types including JPEG compression, filtering and noise contamination. Furthermore, robustness comparison with state‐of‐the‐art works was conducted, and the results demonstrate the superiority of the proposed scheme in terms of imperceptibility and robustness.

show abstract

“…In (16), 𝜎 I and 𝜎 ′ I refer to the variance of I and I ′ respectively, 𝜇 I and 𝜇 I ′ are the means of I and I ′ respectively, 𝜎…”

Section: Evaluation Metricsmentioning

confidence: 99%

Section: F I G U R E 15mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations