Robust and imperceptible watermarking scheme based on Canny edge detection and SVD in the contourlet domain
- PDF / 5,938,026 Bytes
- 23 Pages / 439.37 x 666.142 pts Page_size
- 48 Downloads / 205 Views
Robust and imperceptible watermarking scheme based on Canny edge detection and SVD in the contourlet domain Li-Hua Gong 1 & Cheng Tian 1 & Wei-Ping Zou 1,2 & Nan-Run Zhou 1 Received: 5 June 2019 / Revised: 16 July 2020 / Accepted: 20 August 2020 # Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract
To enhance the invisibility and the robustness of the watermarking algorithm, a robust and imperceptible watermarking scheme is presented by combining Canny edge detection, contourlet transform with singular value decomposition. The host image is firstly decomposed by the contourlet transform. Then the low frequency sub-band obtained by contourlet transform is partitioned into 4×4 non-overlapping blocks and the singular value decomposition is carried out for the specific blocks selected by the Canny edge detection. Finally, the watermark is embedded into the coefficient of matrix U. The embedded watermark could be recovered blindly in the watermark extraction stage. And the robustness and the imperceptibility are efficiently guaranteed with an optimal threshold k selected by the least-square curve fitting. Experimental results demonstrate that the proposed watermarking scheme is superior in terms of imperceptibility and robustness against common attacks. Keywords Robustness . Imperceptibility . Digital watermarking . Canny edge detection . Singular value decomposition . Contourlet transform
1 Introduction The rapid growth of digital products has greatly stimulated the demand on private digital contents protection. At the same time, some urgent problems such as illegal copying, tampering and modifying of digital contents have been exposed. Digital watermarking scheme could serve as an efficient solution to these problems by embedding a watermark into the host image [13, 15]. Generally speaking, robustness and imperceptibility both are the criteria to judge * Nan-Run Zhou [email protected]; [email protected]
1
Department of Electronic Information Engineering, Nanchang University, Nanchang 330031, China
2
XLIM UMR CNRS 7252, University of Poitiers, Poitiers, France
Multimedia Tools and Applications
watermarking algorithms [14, 17]. The robustness means the watermarking scheme could resist against tremendous attacks, such as JPEG compression, Gaussian noise and filtering, etc. [24, 34]. While the imperceptibility indicates that the difference between the host image and the watermarked one should be small enough to avoid detection [33]. Normally, the digital watermarking techniques could be classified into spatial domain and transform domain categories [21, 28, 30]. The spatial watermarking algorithms usually embed watermark by modifying the pixel values directly. These algorithms perform poorly in terms of imperceptibility and robustness [22]. While the imperceptibility and the robustness are guaranteed more efficiently in the transform domain, since the watermark could be spread out over the transformed domain coefficients of the host image [16]. The common watermarking techniques in the transf
Data Loading...
