Abstract
This paper proposes a robust dual-color watermarking based on quaternion singular value decomposition (QSVD), which can embed large payloads into color images with low distortion, and can obtain strong robustness to process color image in a holistic manner. First, two notes are proposed for designing the proposed watermarking scheme, one of which is about three strong correlations found in <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$U$ </tex-math></inline-formula> that can be used for watermark embedding, and the other is analyzing the feasibility of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$V$ </tex-math></inline-formula> compensation for QSVD-based watermarking scheme. In addition, a fast structure-preserving algorithm is used to calculate the singular value decomposition (SVD) of a quaternion matrix, which makes the procedure computationally more flexible and efficient. Then a new watermarking scheme is proposed to protect the copyright of color images. This scheme uses quaternion to make the color image channels correlated so that the proposed watermarking scheme has strong anti-attack performance. Experimental results show that the proposed dual-color watermarking is not only imperceptible but also robust to some common attacks, and the performance of the proposed method outperforms other methods considered in this work.
Highlights
Today in the era of big data, the rapid development of new information technologies has led to the security and copyright protection in multimedia applications and services becoming an important issue that needs to be solved urgently
Two notes are presented for designing the proposed watermarking scheme, one of which is about three strong correlations found in U that can be used for watermark embedding, and the other is analyzing the feasibility of V compensation for quaternion singular value decomposition (QSVD)-based watermarking scheme
The experimental results verify the impact of the compensation scheme on the quality of the extracted watermark. It shows that the proposed watermarking method with two notes is effective and has better performance than the other methods considered in this paper. The novelties of this scheme are as follows: (1) three strong correlations are found in U that can be used to embed ternary watermark information simultaneously, which improves the payload of the proposed watermarking scheme; (2) the feasibility of V compensation is analyzed for (Q)SVDbased watermarking schemes; (3) the structure-preserving algorithm introduced in this paper can quickly and efficiently calculate the singular value decomposition (SVD) of a quaternion matrix; (4) the proposed dual-color watermarking scheme based on QSVD can effectively resist geometric attacks and common attacks; and (5) this scheme has high security because it is based on two private keys of Arnold scrambling and random coordinate sequences
Summary
Today in the era of big data, the rapid development of new information technologies has led to the security and copyright protection in multimedia applications and services becoming an important issue that needs to be solved urgently. It shows that the proposed watermarking method with two notes is effective and has better performance than the other methods considered in this paper The novelties of this scheme are as follows: (1) three strong correlations are found in U that can be used to embed ternary watermark information simultaneously, which improves the payload of the proposed watermarking scheme; (2) the feasibility of V compensation is analyzed for (Q)SVDbased watermarking schemes; (3) the structure-preserving algorithm introduced in this paper can quickly and efficiently calculate the SVD of a quaternion matrix; (4) the proposed dual-color watermarking scheme based on QSVD can effectively resist geometric attacks and common attacks; and (5) this scheme has high security because it is based on two private keys of Arnold scrambling and random coordinate sequences.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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.
