Watermark Information Research Articles

A Novel Blind and Robust Video Watermarking Technique in Fast Motion Frames Based on SVD and MR-SVD

In this work, a novel and efficient digital video watermarking technique based on the Singular Value Decomposition performed in the Multiresolution Singular Value Decomposition domain is proposed. While most of the existing watermarking schemes embed the watermark in all the video frames, which is time-consuming and also affects the perceptibly of the video quality, the proposed method chooses only the fast motion frames in each shot to host the watermark. In doing so, the number of frames to be processed is consequently reduced and a better quality of the watermarked video is also ensured since the human visual system cannot notice the variations in fast moving regions. The watermark information is embedded by Quantization Index Modulation which is a blind watermarking algorithm. The experimental results demonstrate that the proposed method can achieve a very good transparency, while being robust against various kinds of attacks such as filtering, noising, compression, and frame collusion. Compared with several methods found in the literature, the proposed method gives a better robustness.

Affine invariant image watermarking scheme based on ASIFT and Delaunay tessellation

Watermarking algorithms that resist geometric combination attacks is currently a trend of research in this field. This paper proposed a geometrically invariant watermarking scheme based on the feature points of resistance to affine transformation. The scheme used Affine Scale Invariant Feature Transform (ASIFT) to detect the feature points of the carrier image and filtrated the established feature points group depending on anti-affine properties. The obtained feature points set obtained better robustness against multiple attacks. As for robustness, we utilized the feature points set to construct the Delaunay tessellation and embedded the watermark information in the histogram of each triangle. Because of the stability of Delaunay tessellation and the basic characteristics of affine transformation, the geometric robustness of the proposed scheme achieved a good effect as was verified in experiments.

Securing Multiple Biometric Data Using SVD and Curvelet-Based Watermarking

The security and privacy of biometric data in multibiometric systems has become a hot research topic. In this paper, a singular value decomposition (SVD) and fast discrete curvelet transform (FDCuT)-based watermarking scheme for authenticity of fingerprint image using watermark speech signal has been proposed and analyzed. This scheme also provides security to watermark speech signal, which is inserted into the fingerprint image. This proposed scheme has a number of steps including fingerprint image authentication using watermark speech signal. The human speech signal is taken as secret watermark information and inserting into the human fingerprint image in the proposed scheme. The singular value of high frequency curvelet coefficients of the host fingerprint image is modified according to watermark speech signal to get secured and watermarked fingerprint image. The analysis results show that the performance of fingerprint recognition system is not affected by inserted watermark speech signal into host fingerprint image.

An Image Watermarking Algorithm Based on Discrete Hopfield Neural Network Encryption

With the rapid development of science and information technology, it is more and more important to design a robust image watermarking algorithm to protect the intellectual property and information security of images. First of all, this paper encrypts the watermark information to improve the security of the watermarking algorithm through discrete Hopfield neural network based on chaos. Then, based on the image wavelet decomposition, the watermark information is embedded into the low and middle frequency wavelet coefficients according to the minimum Visual error and pixel position distortion. Experiments show that the algorithm has good security, robustness and invisibility.

Design and Implementation of a Completely Fragile Image Algorithm Based on Hash Function

In order to authenticate the authenticity and integrity of watermark, a fragile watermarking algorithm is proposed for the content authentication of digital media products. First, the watermark is embedded into the least significant bit (LSB) of the pixel of the host image, and then the hash value is generated by the Hash function form the watermark information and is saved the text, Then the watermark hash value is embedded into the image of the carrier. On the authentication side, After extracting the watermark information and the Watermark Digest information, the extracted watermark information is generated by the hash function to generate a new set of watermark summary information, and compared with the extracted watermark information. The experimental results show that the fragile watermarking algorithm can achieve good authentication capability.

Storage Feature-Based Watermarking Algorithm with Coordinate Values Preservation for Vector Line Data

Most of current watermarking algorithms for GIS vector data embed copyright information by means of modifying the coordinate values, which will do harm to its quality and accuracy. To preserve the fidelity of vector line data and protect its copyright at the same time, a lossless watermarking algorithm is proposed based on storage feature in this paper. Firstly, the superiority of embedding watermark based on storage feature is demonstrated theoretically and technically. Then, the basic concepts and operations on storage feature have been defined including length and angle of the polyline feature. In the process of embedding watermark, the watermark information is embedded into directions of polyline feature by the quantitative mechanism, while the positions of embedding watermark are determined by the feature length. Hence, the watermark can be extracted by the same geometric features without original data or watermark. Finally, experiments have been conducted to show that coordinate values remain unchanged after embedding watermark. Moreover, experimental results are presented to illustrate the effectiveness of the method.

Robust Digital Watermarking for High-definition Video using Steerable Pyramid Transform, Two Dimensional Fast Fourier Transform and Ensemble Position-based Error Correcting

In this paper, we propose a robust blind watermarking scheme for high-definition video. In the embedding process, luminance component of each frame is transformed by 2-dimensional fast Fourier transform (2D FFT). A secret key is used to generate a matrix of random numbers for the security of watermark information. The matrix is transformed by inverse steerable pyramid transform (SPT). We embed the watermark into the low and mid-frequency of 2D FFT coefficients with the transformed matrix. In the extraction process, the 2D FFT coefficients of each frame and the transformed matrix are transformed by SPT respectively, to produce two oriented sub-bands. We extract the watermark from each frame by cross-correlating two oriented sub-bands. If a video is degraded by some attacks, the watermarks of frames contain some errors. Thus, we use an ensemble position-based error correcting algorithm to estimate the errors and correct them. The experimental results show that the proposed watermarking algorithm is imperceptible and moreover is robust against various attacks. After embedding 64 bits of watermark into each frame, the average peak signal-to-noise ratio between original frames and embedded frames is 45.7 dB.

Watermarking Based on Compressive Sensing for Digital Speech Detection and Recovery †.

In this paper, a novel imperceptible, fragile and blind watermark scheme is proposed for speech tampering detection and self-recovery. The embedded watermark data for content recovery is calculated from the original discrete cosine transform (DCT) coefficients of host speech. The watermark information is shared in a frames-group instead of stored in one frame. The scheme trades off between the data waste problem and the tampering coincidence problem. When a part of a watermarked speech signal is tampered with, one can accurately localize the tampered area, the watermark data in the area without any modification still can be extracted. Then, a compressive sensing technique is employed to retrieve the coefficients by exploiting the sparseness in the DCT domain. The smaller the tampered the area, the better quality of the recovered signal is. Experimental results show that the watermarked signal is imperceptible, and the recovered signal is intelligible for high tampering rates of up to 47.6%. A deep learning-based enhancement method is also proposed and implemented to increase the SNR of recovered speech signal.

Robust and Fragile Medical Image Watermarking: A Joint Venture of Coding and Chaos Theories.

A secure spatial domain, hybrid watermarking technique for obtaining watermark (authentication information) robustness and fragility of the host medical image (content integrity) using product codes, chaos theory, and residue number system (RNS) is proposed. The proposed scheme is highly fragile and unrecoverable in terms of the host image, but it is significantly robust and recoverable in terms of the watermark. Altering the medical image may result in misdiagnosis, hence the watermark that may contain patient information and organization logo must be protected against certain attacks. The host medical image is separated into two parts, namely, the region of interest (ROI) and region of noninterest (RONI) using a rectangular region. The RONI part is used to embed the watermark information. Moreover, two watermarks are used: one to achieve authenticity of image and the other to achieve the robustness against both incidental and malicious attacks. Effectiveness in terms of security, robustness, and fragility of the proposed scheme is demonstrated by the simulations and comparison with the other state-of-the-art techniques.

Anti-HEVC Recompression Video Watermarking Algorithm Based on the All Phase Biorthogonal Transform and SVD

ABSTRACTWith the rapid development of Internet of Things and multimedia technologies, people are paying more attention to the security of images and videos. To further improve the security of video content, a video watermarking algorithm based on the high efficiency video coding (HEVC) compression domain is proposed in this paper. The scheme embeds watermark information in the quantized coefficients, which can solve the cumulative error caused by watermark embedding. Moreover, the all phase biorthogonal transform (APBT), an improved transform, is used to compress the watermark data at the digital watermark preprocessing stage, optimize the watermark embedding scheme, and improve the embedding capacity of video watermarking. Due to the characteristics of HEVC video coding, most HEVC video watermarking schemes based on compression domain cannot resist recompression attack. To solve this problem, on the basis of APBT and singular value decomposition, an anti-HEVC recompression video watermarking algorithm is proposed and can effectively resist the HEVC recompression. Experimental results show that even when the quantization parameter is larger than 40, the extracted watermark still has good image quality. In addition, the algorithm also has a good performance in noise resistance.

Self-recovery reversible image watermarking algorithm.

The integrity of image content is essential, although most watermarking algorithms can achieve image authentication but not automatically repair damaged areas or restore the original image. In this paper, a self-recovery reversible image watermarking algorithm is proposed to recover the tampered areas effectively. First of all, the original image is divided into homogeneous blocks and non-homogeneous blocks through multi-scale decomposition, and the feature information of each block is calculated as the recovery watermark. Then, the original image is divided into 4×4 non-overlapping blocks classified into smooth blocks and texture blocks according to image textures. Finally, the recovery watermark generated by homogeneous blocks and error-correcting codes is embedded into the corresponding smooth block by mapping; watermark information generated by non-homogeneous blocks and error-correcting codes is embedded into the corresponding non-embedded smooth block and the texture block via mapping. The correlation attack is detected by invariant moments when the watermarked image is attacked. To determine whether a sub-block has been tampered with, its feature is calculated and the recovery watermark is extracted from the corresponding block. If the image has been tampered with, it can be recovered. The experimental results show that the proposed algorithm can effectively recover the tampered areas with high accuracy and high quality. The algorithm is characterized by sound visual quality and excellent image restoration.

A new secure and robust watermarking technique based on logistic map and modification of DC coefficient

The proliferation of information and communication technology has made exchange of information easier than ever. Security and copyright protection of multimedia contents in such a scenario has become a major challenge for the research community round the globe. Digital watermarking has been found as an effective tool for protection and security of multimedia content. A secure and robust watermarking scheme based on DC coefficient modification in pixel domain and a modified logistic map is presented in this paper. The cover image is divided into $$8 \times 8$$ sub-blocks and instead of computing DC coefficient using discrete cosine transform (DCT), we 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 based on a generalized logistic map (GLM). We show that GLM has better properties like ergodicity, larger lyapunov exponent, uniform invariant density, mixing, higher range of bifurcation parameter etc., compared to basic logistic map. We exploit these properties of GLM for designing a secure robust, strong efficient cryptosystem to encrypt the watermark information before embedding it. 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 information is computed in pixel domain instead of using DCT on an image block.

Optical colour image watermarking based on phase-truncated linear canonical transform and image decomposition

This paper presents a novel optical colour image watermarking scheme based on phase-truncated linear canonical transform (PT-LCT) and image decomposition (ID). In this proposed scheme, a PT-LCT-based asymmetric cryptography is designed to encode the colour watermark into a noise-like pattern, and an ID-based multilevel embedding method is constructed to embed the encoded colour watermark into a colour host image. The PT-LCT-based asymmetric cryptography, which can be optically implemented by double random phase encoding with a quadratic phase system, can provide a higher security to resist various common cryptographic attacks. And the ID-based multilevel embedding method, which can be digitally implemented by a computer, can make the information of the colour watermark disperse better in the colour host image. The proposed colour image watermarking scheme possesses high security and can achieve a higher robustness while preserving the watermark’s invisibility. The good performance of the proposed scheme has been demonstrated by extensive experiments and comparison with other relevant schemes.

A Self-Recovery Fragile Image Watermarking with Variable Watermark Capacity

Currently, the watermark capacity of most self-recovery fragile image watermarking schemes is fixed. That means for smooth regions and texture regions, the length of watermark information is always the same. However, it is impractical since more recovery information is needed for the recovery of texture regions. In this paper, a self-recovery fragile image watermarking with variable watermark capacity is proposed. Based on the characteristic of singular value decomposition (SVD), a new block classification method is introduced. The image blocks are classified into smooth blocks and texture blocks. For smooth blocks, the average pixel values are adopted as the recovery information to recover the tampered blocks, while for texture blocks, the quantized and coded DCT coefficients are adopted as the recovery information. After encrypted by binary pseudo-random sequence, the recovery watermark of each block is embedded into its mapping block. In the detection side, the three-level detection mechanism is applied to detect and locate the tampered regions. The experimental results prove that the proposed method achieves good tamper detection results, and the recovered image has better image quality than other self-recovery fragile watermarking methods.

A Double Digital Watermarking Algorithm Based on the Combination of SVD-DFT

As the most current methods based on Fourier transform domain can well resist geometric attacks, and embed large information, which cannot well resist the shearing attack, a double watermarking algorithm based on the combination of singular value decomposition and discrete Fourier transform is put forward. In this algorithm, by singular value decomposition on images, then carry out the DFT spectrum amplitude image watermark embedding on the decomposed matrix image, namely sub block division; by DFT transform on each image block, select important coefficients relative to the predefined threshold; add the watermark information into the corresponding amplitude components, and preserve the embedding position and the original component as a key for watermark extraction, and then the watermarked image will be obtained. The experimental results show that this method can achieve better visual effect and has good robustness against the shear, noise and rotation attacks.

An optical watermarking scheme with two-layer framework based on computational ghost imaging

A two-layer watermarking scheme based on computational ghost imaging and singular value decomposition is proposed. In the first layer, the original watermark is encoded into a significantly small number of measured intensities in the process of computational ghost imaging to constitute a new watermark. In the second layer, the significant blocks chosen from the host image based on spatial frequency are combined to the reference image, which is used to embed the new watermark by using the singular value decomposition. Differing from other watermarking schemes, the information of original watermark can be verified without clear visualization via calculating the nonlinear correlation map between the original one and the reconstructed one. Besides optical parameters such as wavelength and propagation distance, a series of phase-only masks are used as security keys, which can enlarge the key space and enhance the level of security. The results illustrate the feasibility and effectiveness about the proposed watermarking mechanism, which provides an effective alternative for the related work.

Robust Image Watermarking Algorithm Based on ASIFT against Geometric Attacks

Image processing technology has been developed rapidly in recent years, and altering the content of an image is easy for everyone, but may be illegal for an attacker. Thus, it is urgent and necessary to overcome this problem to protect the integrity and authenticity of images. Watermarking is a powerful technique proposed to solve this problem. This paper introduces a robust image watermarking algorithm working in the wavelet domain, embedding the watermark information into the third level low frequency coefficients after the three-level discrete wavelet transform (DWT) and singular value decomposition (SVD). Additionally, to improve the robustness to geometric attacks, the affine-scale-invariant feature transform (ASIFT) is applied to obtain feature points which are invariant to geometric attacks. Then, features of acquired points between the watermarked image and the received image are used to realize the resynchronization to improve the robustness. Experimental results show that the proposed algorithm achieves great balance between robustness and imperceptibility, and is robust against geometric attacks, JPEG compression, noise addition, cropping, median filters, and so on.

Multiple Watermarking for Healthcare Applications

AbstractIn this paper, an algorithm for multiple digital watermarking based on discrete wavelet transform (DWT), discrete cosine transform (DCT), and singular value decomposition (SVD) was proposed for healthcare applications such as tele-ophthalmology, tele-medicine, tele-diagnosis, and tele-consultancy services. Multiple watermarks were used in this algorithm to reduce the consequences of medical identity thefts. In the embedding process, the cover medical image was decomposed into third-level DWT. Low-frequency bands (LH2 and LL3) were transformed by DCT, and then SVD was applied to DCT coefficients. Two watermarks in the form of images were also transformed by DCT and then SVD. The singular values of the watermark information were embedded in the singular value of the cover medical image. Watermarks were extracted using an extraction algorithm. In order to enhance the robustness performance of the image watermarks, back-propagation neural network was applied to the extracted watermarks to reduce the effects of different noise applied on the watermarked image. Results were obtained by varying the gain factor and the different cover image modalities. Experimental results were provided to illustrate that the proposed method is able to withstand a variety of signal processing attacks, and has been found to give excellent performance in terms of robustness and imperceptibility. The performance of the method was also compared with other reported techniques. Further, the visual quality of the proposed method was also evaluated by a subjective method.

A Color Image Watermarking Based on Tensor Analysis

Since most of the color image watermarking methods embed the watermark information in each channel or one channel of a color image, the redundant information of the color image cannot be sufficiently utilized, resulting in the poor ability to resist attacks. In this paper, a novel blind color image watermarking method based on the tensor domain is proposed, and it takes efficient account of the overall characteristics of color images and spreads the watermark information into three channels of color images based on tensor decomposition. Exploring the new tensor domain to embed and extract watermark information and the theoretical proof of the optimal embedding position of the core tensor are the major technical contributions of this paper. To be more specific, first, the RGB channels of the color image as a tensor are considered, and the tensor decomposition is used to obtain the core tensor. Then, based on the theoretical proof, the optimal embedding position of the core tensor is obtained, and the watermark information is embedded into the core tensor. Finally, the watermark information is spread to the three channels of the color image through the inverse tensor decomposition. The experimental results show that the proposed method has better invisibility and stronger robustness for the most common attacks.

A Watermarking Method for 3D Models Based on Feature Vertex Localization

This paper presents a new blind watermarking scheme for 3-D point cloud models by using feature vertices to locate the embedded watermark. The vertices with larger mean curvature are considered to be feature vertices carrying watermarking information; non-feature vertices are used to build a new coordinate system in which the 3-D point cloud model is classified into bins containing several longitudes. Each bit of the watermarking information is repeatedly embedded into a bin by altering azimuth angles of feature vertices lying in the bin. The non-feature vertices are not exploited to embed the watermarking information, which enables the built coordinate system to avoid the impacts of the embedding of watermark. The choice of the embedding position and redundant embedding provide an optimal balance between imperceptibility and robustness of watermark. Simulation results testify that our watermarking method for 3-D point cloud models has desired robustness against common attack and geometric attack while demonstrating good transparency.