The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Convolutional Neural Network-Based Digital Image Watermarking Adaptive to the Resolution of Image and Watermark
Open accessAbstract
Digital watermarking has been widely studied as a method of protecting the intellectual property rights of digital images, which are high value-added contents. Recently, studies implementing these techniques with neural networks have been conducted. This paper also proposes a neural network to perform a robust, invisible blind watermarking for digital images. It is a convolutional neural network (CNN)-based scheme that consists of pre-processing networks for both host image and watermark, a watermark embedding network, an attack simulation for training, and a watermark extraction network to extract watermark whenever necessary. It has three peculiarities for the application aspect: The first is the host image resolution’s adaptability. This is to apply the proposed method to any resolution of the host image and is performed by composing the network without using any resolution-dependent layer or component. The second peculiarity is the adaptability of the watermark information. This is to provide usability of any user-defined watermark data. It is conducted by using random binary data as the watermark and is changed each iteration during training. The last peculiarity is the controllability of the trade-off relationship between watermark invisibility and robustness against attacks, which provides applicability for different applications requiring different invisibility and robustness. For this, a strength scaling factor for watermark information is applied. Besides, it has the following structural or in-training peculiarities. First, the proposed network is as simple as the most profound path consists of only 13 CNN layers, which is through the pre-processing network, embedding network, and extraction network. The second is that it maintains the host’s resolution by increasing the resolution of a watermark in the watermark pre-processing network, which is to increases the invisibility of the watermark. Also, the average pooling is used in the watermark pre-processing network to properly combine the binary value of the watermark data with the host image, and it also increases the invisibility of the watermark. Finally, as the loss function, the extractor uses mean absolute error (MAE), while the embedding network uses mean square error (MSE). Because the extracted watermark information consists of binary values, the MAE between the extracted watermark and the original one is more suitable for balanced training between the embedder and the extractor. The proposed network’s performance is confirmed through training and evaluation that the proposed method has high invisibility for the watermark (WM) and high robustness against various pixel-value change attacks and geometric attacks. Each of the three peculiarities of this scheme is shown to work well with the experimental results. Besides, it is exhibited that the proposed scheme shows good performance compared to the previous methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“However, the embedding of digital watermarking is usually accompanied by some degree of image quality degradation”
From Deep Perceptual Hash Based on Hash Center for Image Copyright Protection (2022) · cites this paper as [1]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“and an image that has been embezzled before the watermark was embedded could not be detected.”
From Deep Perceptual Hash Based on Hash Center for Image Copyright Protection (2022) · cites this paper as [1]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
HiDDeN: Hiding Data With Deep Networks
Zhu, J., Kaplan, R., Johnson, J., & Fei-Fei, L. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-01267-0_40 · Cited by 1,300
”Break Our Steganographic System”: The Ins and Outs of Organizing BOSS
Bas, P., Filler, T., & Pevný, T. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24178-9_5 · Cited by 1,267
A DWT-DFT composite watermarking scheme robust to both affine transform and JPEG compression
Kang, X., Huang, J., Shi, Y. Q., et al. (2003) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2003.815957 · Cited by 346
ReDMark: Framework for residual diffusion watermarking based on deep networks
Ahmadi, M., Norouzi, A., Karimi, N., et al. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.113157 · Cited by 303
A Novel Two-stage Separable Deep Learning Framework for Practical Blind Watermarking
Liu, Y., Guo, M., Zhang, J., Zhu, Y., & Xie, X. (2019) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/3343031.3351025 · Cited by 222
Exploring the learning capabilities of convolutional neural networks for robust image watermarking
Kandi, H., Mishra, D., & Gorthi, R. K. (2016) · Computers & Security · doi:10.1016/j.cose.2016.11.016 · Cited by 194
Finding robust domain from attacks: A learning framework for blind watermarking
Mun, S.-M., Nam, S.-H., Jang, H., Kim, D., & Lee, H.-K. (2019) · Neurocomputing · doi:10.1016/j.neucom.2019.01.067 · Cited by 166
Self-citationOuyang, J., Coatrieux, G., Chen, B., et al. (2015) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2015.03.004 · Cited by 77
Dither modulation of significant amplitude difference for wavelet based robust watermarking
Li, C., Zhang, Z., Wang, Y., et al. (2015) · Neurocomputing · doi:10.1016/j.neucom.2015.03.039 · Cited by 54
ROMark: A Robust Watermarking System Using Adversarial TrainingPreprint
Wen, B., & Aydöre, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.01221 · Cited by 36
Blind Image Watermarking Based on Adaptive Data Spreading in n-Level DWT Subbands
Lee, Y.-S., Seo, Y.-H., & Kim, D.-W. (2019) · Security and Communication Networks · doi:10.1155/2019/8357251 · Cited by 22
Self-citationColor image watermarking using DWT-SVD and Arnold transform
George, J., Varma, S. L., & Chatterjee, M. (2014) · IEEE India Conference · doi:10.1109/indicon.2014.7030497 · Cited by 21
Lagrangian support vector regression based image watermarking in wavelet domain
Mehta, R., Vishwakarma, V. P., & Rajpal, N. (2015) · International Conference on Signal Processing and Integrated Networks (SPIN) · doi:10.1109/spin.2015.7095436 · Cited by 10
ReDMark: Framework for Residual Diffusion Watermarking on Deep NetworksPreprint
Ahmadi, M., Norouzi, A., Soroushmehr, S. M. R., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.07248 · Cited by 10
Cox, I. J., Miller, M. L., Bloom, J. A., et al. (2008) · Elsevier eBooks · doi:10.1016/b978-012372585-1.50012-7 · Cited by 9
A Robust Image Watermarking System Based on Deep Neural NetworksPreprint
Zhong, X., & Shih, F. Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.11331 · Cited by 7
A progressive QIM to cope with SVD-based blind image watermarking in DWT domain
Hu, H.-T., Chang, Y.-J., & Chen, S.-H. (2014) · doi:10.1109/chinasip.2014.6889277 · Cited by 6
Cited by
Deep Perceptual Hash Based on Hash Center for Image Copyright Protection
Sun, X., & Zhou, J. (2022) · IEEE Access · doi:10.1109/access.2022.3221980 · Cited by 20
“In the past decades, people have relied on various types of digital watermarking [1], [2] to mark protected images and detect suspected infringing images.”
Background
Metadata
- Authors
- Lee, J.-E., Seo, Y.-H., & Kim, D.-W.
- Affiliations
- Kwangwoon University (KR)
- Corresponding author
- Kim, Dong-Wook
- Venue
- Applied Sciences
- Publisher
- MDPI AG
- Published
- 2020-09-29
- Volume
- 10
- Issue
- 19
- Pages
- 6854
- ISSN
- 2076-3417 (ISSN-L)
- OpenAlex
- W3089622076
- Cited by
- 76
- References
- 18
- Citations by year
- 2026: 14 · 2025: 9 · 2024: 14 · 2023: 19 · 2022: 13 · 2021: 6 · 2020: 1
- FWCI
- 3.79
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- Applied Sciences (publishedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Funders
- National Research Foundation of Korea (2019R1F1A105455212)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Steganography and Watermarking Techniques
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Digital Media Forensic Detection
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Data Compression Techniques
- Keywords
- image watermarking, blind watermarking, convolutional neural networks, watermark invisibility, watermark robustness, attack simulation, geometric attacks, intellectual property protection
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.