Abstract
With 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.
Highlights
With the widespread use of digital products, it becomes more and more convenient for us to obtain and modify digital multimedia
Since the watermark embedding process is performed in the spatial domain, the proposed method avoids the false positive problem existing in traditional singular value decomposition (SVD)-based watermarking schemes and reduces the computational complexity
Based on the mathematical characteristics of SVD, a robust image watermarking scheme is proposed in this paper
Summary
With the widespread use of digital products, it becomes more and more convenient for us to obtain and modify digital multimedia. K. Singh [16] proposed a DWT-SVD and DCT based robust watermarking method, which provided another solution for the false positive problem. Singh [16] proposed a DWT-SVD and DCT based robust watermarking method, which provided another solution for the false positive problem In their method, a grayscale watermark image is first split into two planes called the most significant bits (MSBs) plane and the least significant bits (LSBs) plane. To avoid the false positive problem, an extra signature generated by singular vectors is embedded into the host image along with the watermark Though these improved watermarking schemes have achieved great performance, the use of multiple transforms and optimization algorithms increases the complexity of these schemes immensely. Since the watermark embedding process is performed in the spatial domain, the proposed method avoids the false positive problem existing in traditional SVD-based watermarking schemes and reduces the computational complexity. The conclusions and future work are given at the end of this paper
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
