A Robust Image Watermarking Scheme Based on SVD in the Spatial Domain
AbstractWith the development of image processing technology, the copyright protection of digital images has become an urgent problem to be solved. As an effective method, the robust digital watermarking technique emerges at a historic moment. Currently, most robust watermarking schemes are performed in the transform domains, such as the discrete cosine transform (DCT) and singular value decomposition (SVD). Compared with spatial domain watermarking schemes, these methods have achieved good performance, such as better robustness and higher security. However, the computational complexity increases with the use of forward and reverse transforms. In this paper, we analyze the SVD-based watermarking scheme and its impact on the spatial domain. Based on this analysis and the mathematical characteristics of SVD, we present a robust image watermarking scheme where a binary watermark is embedded into the largest singular value of each image block in the spatial domain. Several experiments are conducted to verify the performance of the proposed watermarking scheme. The experimental results show that compared with the existing SVD domain watermarking schemes, our proposed method has maintained good robustness against various attacks. Moreover, it avoids the false positive problem existing in traditional SVD-based watermarking schemes and has lower computational complexity. View Full-Text
Share & Cite This Article
Zhang, H.; Wang, C.; Zhou, X. A Robust Image Watermarking Scheme Based on SVD in the Spatial Domain. Future Internet 2017, 9, 45.
Zhang H, Wang C, Zhou X. A Robust Image Watermarking Scheme Based on SVD in the Spatial Domain. Future Internet. 2017; 9(3):45.Chicago/Turabian Style
Zhang, Heng; Wang, Chengyou; Zhou, Xiao. 2017. "A Robust Image Watermarking Scheme Based on SVD in the Spatial Domain." Future Internet 9, no. 3: 45.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.