Research Article
A Robust Watermarking Scheme with High Security and Low Computational Complexity
@INPROCEEDINGS{10.1007/978-3-030-63095-9_28, author={Liangjia Li and Yuling Luo and Junxiu Liu and Senhui Qiu and Lanhang Li}, title={A Robust Watermarking Scheme with High Security and Low Computational Complexity}, proceedings={Security and Privacy in Communication Networks. 16th EAI International Conference, SecureComm 2020, Washington, DC, USA, October 21-23, 2020, Proceedings, Part II}, proceedings_a={SECURECOMM PART 2}, year={2020}, month={12}, keywords={Watermark TLCM DC coefficient Spatial domain}, doi={10.1007/978-3-030-63095-9_28} }- Liangjia Li
Yuling Luo
Junxiu Liu
Senhui Qiu
Lanhang Li
Year: 2020
A Robust Watermarking Scheme with High Security and Low Computational Complexity
SECURECOMM PART 2
Springer
DOI: 10.1007/978-3-030-63095-9_28
Abstract
Implementing a watermarking algorithm with high security and low computational complexity is a challenge, especially at a limited distortion level. A novel watermarking scheme is proposed in this paper, which is based on Tent-Logistic-Cosine Map (TLCM) and Direct Current (DC) coefficient modification. Firstly, the watermark is encrypted by a matrix obtained from TLCM. Then, the cover image is divided into non-overlapping(4 \times 4)sub-blocks and some blocks are selected randomly. Thereafter, the DC coefficients of selected blocks are calculated directly in the spatial domain without performing two-dimensional discrete cosine transform. Finally, using the proposed watermark embedding procedure, DC coefficients of selected blocks are updated according to the encrypted watermark bits. Results show that the proposed watermarking algorithm has high security and low computational complexity at a limited distortion.
