Blind watermarking scheme based on Schur decomposition and non-subsampled contourlet transform
- PDF / 2,057,840 Bytes
- 15 Pages / 439.37 x 666.142 pts Page_size
- 3 Downloads / 205 Views
Blind watermarking scheme based on Schur decomposition and non-subsampled contourlet transform Jing-You Li 1,2 & Chao-Zhu Zhang 1 Received: 15 August 2019 / Revised: 14 June 2020 / Accepted: 21 July 2020 # Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract
An invisibility and blind watermarking algorithm based on Schur decomposition and nonsubsampled contourlet transform is designed to protect copyright. The cover image is decomposed by the non-subsampled contourlet transform. And the low pass sub-band of the non-subsampled contourlet transform is divided into 8 × 8 non-overlapping blocks. Then each block is performed by the Schur decomposition and the watermark information is embedded by modifying the largest energy element in the Schur domain. Before embedding into the cover image, the original watermark is scrambled with logistic map and Arnold transform to ensure the security. Besides, a synchronization mechanism based on scale invariant feature transform is designed for resisting geometrical attacks. The proposed watermarking algorithm is evaluated with structural similarity index, peak signal to noise ratio and bit error rate. Experimental results demonstrate that the proposed watermarking scheme performs better in terms of invisibility, robustness and payload than other similar schemes. Keywords Blind watermarking scheme . Schur decomposition . Non-subsampled contourlet transform . Logistic map . Arnold transform
1 Introduction With the fast development of digital products, a series of urgent security issues such as the illegal copying and distortion of private information have been deeply concerned [17, 20, 41, 43]. Digital * Jing-You Li [email protected] Chao-Zhu Zhang [email protected]
1
School of Information & Communication Engineering, Harbin Engineering University, Harbin 150001, China
2
School of Communication & Electronic Engineering, Qiqihar University, Qiqihar 161006, China
Multimedia Tools and Applications
watermarking is considered as an effective solution to these security issues [16, 25]. Generally, digital watermarking is achieved by embedding the private information into the host image [12, 14]. Invisibility, robustness, security and payload are necessary for an excellent watermarking scheme [2, 13, 26, 35]. The invisibility in a watermarking algorithm refers to the cover image and the watermarked one should be similar enough to avoid being noticed. And the robustness of watermarks indicates that the watermark algorithm is able to resist against common attacks, such as JPEG compression, noise attacks and geometric attacks, etc. The security means that watermark extraction in a watermarking scheme relies on the secret key. The payload implies that the total amount of information can be hidden into the cover image. Generally, digital watermarking can be implemented in frequency domain and spatial domain [27, 39]. The watermarking schemes in the spatial domain generally embed the watermark by altering a set of pixel values of the cover image directly
Data Loading...
