scholarly journals Robust Blind Watermarking Technique Against Geometric Attacks for Fingerprint Image Using DTCWT-DCT

2020 ◽  
pp. 2715-2739
Author(s):  
Mohamed Lebcir ◽  
Suryanti Awang ◽  
Ali Benziane

In this research paper, a new blind and robust fingerprint image watermarking scheme based on a combination of dual-tree complex wavelet transform (DTCWT) and discrete cosine transform (DCT) domains is demonstrated. The major concern is to afford a solution in reducing the consequence of geometric attacks. It is due to the fingerprint features that may be impacted by the incorporated watermark, fingerprint rotations, and displacements that result in multiple feature sets. To integrate the bits of the watermark sequence into a differential process, two DCT-transformed sub-vectors are implemented. The initial sub-vectors were obtained by sub-sampling in the host fingerprint image of both real and imaginary parts of the DTCWT wavelet coefficients. The basic difference between the relevant sub-vectors of the watermarked fingerprint image in the extraction stage directly provides the inserted watermark sequence. It is not necessary to extract watermark data from an original fingerprint image. Therefore, the technique suggested is evaluated using 80 fingerprint images from 10 persons, from both CASIA-V5-DB and FVC2002-DB2 fingerprint database. For each person, eight fingerprints are set as the template and the watermark are inserted in each image. A comparison between the obtained results with other geometric robust techniques results is performed afterwards. The comparison results show that the proposed technique has stronger robustness against common image processing processes and geometric attacks such as cropping, resizing, and rotation.

2019 ◽  
Vol 2019 ◽  
pp. 1-11 ◽  
Author(s):  
Yong-Seok Lee ◽  
Young-Ho Seo ◽  
Dong-Wook Kim

This paper proposes a new adaptive watermarking scheme for digital images, which has the properties of blind extraction, invisibility, and robustness against attacks. The typical scheme for invisibility and robustness consisted of two main techniques: finding local positions to be watermarked and mixing or embedding the watermark into the pixels of the locations. In finding the location, however, our scheme uses a global space such that the multiple watermarking data is spread out over all four lowest-frequency subbands, resulting from n-level Mallat-tree 2D (dimensional) DWT, where n depends on the amount of watermarking data and the resolution of the host image, without any further process to find the watermarking locations. To embed the watermark data into the subband coefficients, weighting factors are used according to the type and energy of each subband to adjust the strength of the watermark, so we call this an adaptive scheme. To examine the ability of the proposed scheme, images with various resolutions are tested for various attacks, both pixel-value changing attacks and geometric attacks. With experimental results and comparison to the existing works we show that the proposed scheme has better performance than the previous works, except those which specialize in certain types of attacks.


Cryptography ◽  
2020 ◽  
pp. 1-21
Author(s):  
Shabir A. Parah ◽  
Javaid A. Sheikh ◽  
Nilanjan Dey ◽  
G.M. Bhat

The proliferation of information and communication technology has made exchange of information easier than ever. Security, Duplication and manipulation of information in such a scenario has become a major challenge to the research community round the globe. Digital watermarking has been found to be a potent tool to deal with such issues. A secure and robust image watermarking scheme based on DC coefficient modification in pixel domain and chaotic encryption has been presented in this paper. The cover image has been divided into 8×8 sub-blocks and instead of computing DC coefficient using Discrete Cosine Transform (DCTI, the authors compute DC coefficient of each block in spatial domain. Watermark bits are embedded by modifying DC coefficients of various blocks in spatial domain. The quantum of change to be brought in various pixels of a block for embedding watermark bit depends upon DC coefficient of respective blocks, nature of watermark bit (0 or 1) to be embedded and the adjustment factor. The security of embedded watermark has been taken care of by using chaotic encryption. Experimental investigations show that besides being highly secure the proposed technique is robust to both signal processing and geometric attacks. Further, the proposed scheme is computationally efficient as DC coefficient which holds the watermark information has been computed in pixel domain instead of using DCT on an image block.


2009 ◽  
Vol 34 (10) ◽  
pp. 1235-1242 ◽  
Author(s):  
Lei-Da LI ◽  
Bao-Long GUO ◽  
Xiao-Yue WU

2020 ◽  
Author(s):  
Yujian Zhuang ◽  
Xiaoyi Zhou ◽  
Sheng Liu

Abstract The existing robust digital watermarking schemes mainly embed information in the fixed positions or with fixed embedding strength, while seldom considering adaptive adjustment based on the characteristics of the cover image, thus it reduces the imperceptibility and the robustness of watermarking. Aiming at these issues, we propose a scheme which can be able to dynamically adjust the watermark embedding position and strength. Therefore, it guarantees the trade-off between robustness and imperceptibility. The appropriate embedding positions are dynamically selected for the watermark by comparing the image entropy, and the embedding strength of the image blocks are adaptively adjusted according to the entropy and the Just Noticeable Difference (JND) model in the Human Visual System (HVS)-based wavelet domain. Singular Value Decomposition (SVD) is performed on the image blocks to ensure the resistant ability of geometric attacks. The experimental results show that the scheme has good imperceptibility as well as strong robustness against various attacks. The robustness in common attacks is improved by at least 1% compared with similar watermarking schemes.


2019 ◽  
Vol 2019 ◽  
pp. 1-16
Author(s):  
Jun Zhang ◽  
Xiaoyi Zhou ◽  
Jilin Yang ◽  
Chunjie Cao ◽  
Jixin Ma

With the intensive study of machine learning in digital watermarking, its ability to balance the robustness and transparency of watermarking technology has attracted researchers’ attention. Therefore, quantum genetic algorithm, which serves as an intelligent optimized scheme combined with biological genetic mechanism and quantum computing, is widely used in various fields. In this study, an adaptive robust blind watermarking algorithm by means of optimized quantum genetics (OQGA) and entropy classification-based SVM (support vector machine) is proposed. The host image was divided into two parts according to the odd and even rows of the host image. One part was transformed by DCT (discrete cosine transform), and then the embedding intensity and position were separately trained by entropy-based SVM and OQGA; the other part was by DWT (discrete wavelet transform), in which the key fusion was achieved by an ergodic matrix to embed the watermark. Simulation results indicate the proposed algorithm ensures the watermark scheme transparency as well as having better resistance to common attacks such as lossy JPEG compression, image darken, Gaussian low-pass filtering, contrast decreasing, salt-pepper noise, and geometric attacks such as rotation and cropping.


Sign in / Sign up

Export Citation Format

Share Document