LKAW: A Robust Watermarking Method Based on Large Kernel Convolution and Adaptive Weight Assignment

Robust watermarking requires finding invariant features under multiple attacks to ensure correct extraction.Deep learning has extremely powerful in extracting features,and watermarking algorithms based on deep learning have attracted widespread attention.Most existing methods use 3×3 small kernel convolution to extract image features and embed the watermarking.However,the effective perception fields for small kernel convolution are extremely confined,so the pixels that each watermarking can affect are restricted,thus limiting the performance of the watermarking.To address these problems,we propose a watermarking network based on large kernel convolution and adaptive weight assignment for loss functions.It uses large-kernel depth-wise convolution to extract features for learning large-scale image information and subsequently projects the watermarking into a highdimensional space by 1×1 convolution to achieve adaptability in the channel dimension.Subsequently,the modification of the embedded watermarking on the cover image is extended to more pixels.Because the magnitude and convergence rates of each loss function are different,an adaptive loss weight assignment strategy is proposed to make theweights participate in the network training together and adjust theweight dynamically.Further,a high-frequency wavelet loss is proposed,by which the watermarking is restricted to only the low-frequency wavelet sub-bands,thereby enhancing the robustness of watermarking against image compression.The experimental results show that the peak signal-to-noise ratio(PSNR)of the encoded image reaches 40.12,the structural similarity(SSIM)reaches 0.9721,and the watermarking has good robustness against various types of noise.

Robust Watermarking of Mobile Video Resistant against Barrel Distortion

In head mounted display(HMD),in order to cancel pincushion distortion,the images displayed on the mobile should be prewarped with barrel distortion.The copyright of the mobile video should be verified on both the original view and the pre-warped virtual view.A robust watermarking resistant against barrel distortion for HMDs is proposed in this paper.Watermark mask is embedded into image in consideration of imperceptibility and robustness of watermarking.In order to detect watermark from the pre-warped image with barrel distortion,an estimation method of the barrel distortion is proposed for HMDs.Then,the same warp is enforced on the embedded watermark mask with the estimated parameters of barrel distortion.The correlation between the warped watermark and the pre-warped image is computed to predicate the existence of watermark.As shown in experimental results,watermark of mobile video can be detected not only from the original views,but also from the pre-warped virtual view.It also shows that the proposed scheme is resistant against combined barrel distortion and common post-processing,such as JPEG compression.

Novel Blind Robust Watermarking Based on Chaotic Mixing

This paper proposed a novel blind robust watermarking scheme. Multi-bits watermark is embedded in the chaotic mixed image blocks. Energy of the watermark is spread to all region of the blocks instead of some individual pixels, which entitles the watermark with imperceptibility and high robustness. A class of 1-D Markov chaotic maps is employed to perform image block mixing and watermark encryption ensures security of the system. To prove the validity of this proposed scheme, some objective comparisons with the popular spread spectrum scheme were also presented. The simulation results show that this scheme can survive processing such as high-ratio JPEG compression, Gaussian noise pollution and histogram equalization.

An Error-Correcting Code-Based Robust Watermarking Scheme for Stereolithographic Files

Stereolithographic(STL)files have been extensively used in rapid prototyping industries as well as many other fields as watermarking algorithms to secure intellectual property and protect three-dimensional models from theft.However,to the best of our knowledge,few studies have looked at how watermarking can resist attacks that involve vertex-reordering.Here,we present a lossless and robust watermarking scheme for STL files to protect against vertexreordering attacks.Specifically,we designed a novel error-correcting code(ECC)that can correct the error of any one-bit in a bitstream by inserting several check digits.In addition,ECC is designed to make use of redundant information according to the characteristics of STL files,which introduces further robustness for defense against attacks.No modifications are made to the geometric information of the three-dimensional model,which respects the requirements of a highprecision model.The experimental results show that the proposed watermarking scheme can survive numerous kinds of attack,including rotation,scaling and translation(RST),facet reordering,and vertex-reordering attacks.

Robust Watermarking of Screen-Photography Based on JND

With the popularity of smartphones,it is often easy to maliciously leak important information by taking pictures of the phone.Robust watermarking that can resist screen photography can achieve the protection of information.Since the screen photo process can cause some irreversible distortion,the currently available screen photo watermarks do not consider the image content well and the visual quality is not very high.Therefore,this paper proposes a new screen-photography robust watermark.In terms of embedding region selection,the intensity-based Scale-invariant feature transform(SIFT)algorithm used for the construction of feature regions based on the density of feature points,which can make it more focused on the key content of the image;in terms of embedding strength,the Just noticeable difference(JND)model is applied to limit the intensity of the watermark embedding according to the luminance and texture of the picture to balance robustness and invisibility;after embedding watermark,the coefficients in the neighborhood are again adjusted with optimal constraints to improve the accuracy of watermark extraction.After experiments,it is shown that the method we proposed can improve the correct rate of watermark extraction,the quality of the visual aspect of the watermarked picture is also improved.

A Dual Domain Robust Reversible Watermarking Algorithm for Frame Grouping Videos Using Scene Smoothness

The proposed robust reversible watermarking algorithm addresses the compatibility challenges between robustness and reversibility in existing video watermarking techniques by leveraging scene smoothness for frame grouping videos.Grounded in the H.264 video coding standard,the algorithm first employs traditional robust watermark stitching technology to embed watermark information in the low-frequency coefficient domain of the U channel.Subsequently,it utilizes histogram migration techniques in the high-frequency coefficient domain of the U channel to embed auxiliary information,enabling successful watermark extraction and lossless recovery of the original video content.Experimental results demonstrate the algorithm’s strong imperceptibility,with each embedded frame in the experimental videos achieving a mean peak signal-to-noise ratio of 49.3830 dB and a mean structural similarity of 0.9996.Compared with the three comparison algorithms,the performance of the two experimental indexes is improved by 7.59%and 0.4%on average.At the same time,the proposed algorithm has strong robustness to both offline and online attacks:In the face of offline attacks,the average normalized correlation coefficient between the extracted watermark and the original watermark is 0.9989,and the average bit error rate is 0.0089.In the face of online attacks,the normalized correlation coefficient between the extracted watermark and the original watermark is 0.8840,and the mean bit error rate is 0.2269.Compared with the three comparison algorithms,the performance of the two experimental indexes is improved by 1.27%and 18.16%on average,highlighting the algorithm’s robustness.Furthermore,the algorithm exhibits low computational complexity,with the mean encoding and the mean decoding time differentials during experimental video processing being 3.934 and 2.273 s,respectively,underscoring its practical utility.

A Robust 3-D Medical Watermarking Based on Wavelet Transform for Data Protection

In a telemedicine diagnosis system,the emergence of 3D imaging enables doctors to make clearer judgments,and its accuracy also directly affects doctors’diagnosis of the disease.In order to ensure the safe transmission and storage of medical data,a 3D medical watermarking algorithm based on wavelet transform is proposed in this paper.The proposed algorithm employs the principal component analysis(PCA)transform to reduce the data dimension,which can minimize the error between the extracted components and the original data in the mean square sense.Especially,this algorithm helps to create a bacterial foraging model based on particle swarm optimization(BF-PSO),by which the optimal wavelet coefficient is found for embedding and is used as the absolute feature of watermark embedding,thereby achieving the optimal balance between embedding capacity and imperceptibility.A series of experimental results from MATLAB software based on the standard MRI brain volume dataset demonstrate that the proposed algorithm has strong robustness and make the 3D model have small deformation after embedding the watermark.

Robust Image Watermarking Using Local Invariant Features and Independent Component Analysis

This paper proposes a novel robust image watermarking scheme for digital images using local invariant features and Independent Component Analysis （ICA）. Most present watermarking algorithms are unable to resist geometric distortions that desynchronize the location. The method we propose here is robust to geometric attacks. In order to resist geometric distortions, we use a local invariant feature of the image called the scale invariant feature transform, which is invariant to translation and scaling distortions. The watermark is inserted into the circular patches generated by scale-invariant key point extractor. Rotation invariance is achieved using the translation property of the polar-mapped circular patches. Our method belongs to the blind watermark category, because we use Independent Component Analysis for detection that does not need the original image during detection. Experimental results show that our method is robust against geometric distortion attacks as well as signal-processing attacks.

Robust watermarking of databases in order-preserving encrypted domain

Security of databases has always been a hot topic in the field of information security.Privacy protection can be realized by encrypting data,while data copyright can be protected by using digital watermarking technology.By combining these two technologies,a database’s copyright and privacy problems in the cloud can be effectively solved.Based on order-preserving encryption scheme(OPES),circular histogram and digital watermarking technology,this paper proposes a new robust watermarking scheme for protection of databases in the encrypted domain.Firstly,the OPES is used to encrypt data to avoid exposing the data in the cloud.Then,the encrypted data are grouped and modified by the use of a circular histogram for embedding a digital watermark.The common data query operations in database are available for the encrypted watermarking database.In receivers,the digital watermark and the original data can be restored through a secret key and a key table.Experimental results have shown that the proposed algorithm is robust against common database attacks in the encrypted domain.

WATERMARKING AUTHENTICATION:USING THE FRAGILE MODE OR THE ROBUST MODE?

Due to the lack of a unified authentication model certain mistakes occurred in the use of the wa-termarking authentication methods. To clarify the confusion, authentication models of robust and fragile wa-termarking are developed respectively in the paper. Concrete algorithms are proposed to prove the models that different Discrete Wavelet Transform (DWT) domains are utilized to embed the watermarks and quanti-zation method is presented with Just Notice Differences (JNDs) threshold as the quantization size. After the key technologies about the two methods are discussed, we detail the comparison of the two modes and rec-ommend their respective application scenarios as applicable results.

Robust Reversible Audio Watermarking Scheme for Telemedicine and Privacy Protection

The leakage of medical audio data in telemedicine seriously violates the privacy of patients.In order to avoid the leakage of patient information in telemedicine,a two-stage reversible robust audio watermarking algorithm is proposed to protect medical audio data.The scheme decomposes the medical audio into two independent embedding domains,embeds the robust watermark and the reversible watermark into the two domains respectively.In order to ensure the audio quality,the Hurst exponent is used to find a suitable position for watermark embedding.Due to the independence of the two embedding domains,the embedding of the second-stage reversible watermark will not affect the first-stage watermark,so the robustness of the first-stage watermark can be well maintained.In the second stage,the correlation between the sampling points in the medical audio is used to modify the hidden bits of the histogram to reduce the modification of the medical audio and reduce the distortion caused by reversible embedding.Simulation experiments show that this scheme has strong robustness against signal processing operations such as MP3 compression of 48 db,additive white Gaussian noise(AWGN)of 20 db,low-pass filtering,resampling,re-quantization and other attacks,and has good imperceptibility.

Robust Image Watermarking Based on Generative Adversarial Network

Digital watermark embeds information bits into digital cover such as images and videos to prove the creator’s ownership of his work.In this paper,we propose a robust image watermark algorithm based on a generative adversarial network.This model includes two modules,generator and adversary.Generator is mainly used to generate images embedded with watermark,and decode the image damaged by noise to obtain the watermark.Adversary is used to discriminate whether the image is embedded with watermark and damage the image by noise.Based on the model Hidden(hiding data with deep networks),we add a high-pass filter in front of the discriminator,making the watermark tend to be embedded in the mid-frequency region of the image.Since the human visual system pays more attention to the central area of the image,we give a higher weight to the image center region,and a lower weight to the edge region when calculating the loss between cover and embedded image.The watermarked image obtained by this scheme has a better visual performance.Experimental results show that the proposed architecture is more robust against noise interference compared with the state-of-art schemes.

A New Robust Watermarking Algorithm for Vector Data

Because the existing vector data watermarking algorithm is insufficiently robust for compression and cropping,and has no sufficient control on map deformation,a new watermarking algorithm was proposed in this paper.Its main features are：① it selected feature points and non-feature points from the sequence of Douglas,and then embedded watermarking points by wavelet transform,which is based on layer segmentation;② it enhanced the map deformation control design.Furthermore,it increased the map graphic deformation control design.The algorithm was applied to experimental data,and the test results showed that the algorithm had good robustness on graphics geometric transformation,the addition,deletion and cropping of points in graph layers.Also,the graph distortion had been well controlled.

Connectivity-Based Watermarking Robust to Geometrical Attacks

A novel robust watermarking scheme based on image connectivity is proposed. In the scheme, the connected objects are obtained according to selected connectivity pattern, and the gravity centers are calculated in several bigger objects as the reference points for watermark embedding. Based on these reference points and the center of the whole image, several sectors are formed, and the same version of watermarks is embedded into these sectors and their opposites. Thanks to the very stable gravity center of the connected objects, watermark detection is synchronized successfully. Simulation results show that the watermark can survive under both local and global geometrical distortions.

Fragile Watermarking Based on Robust Hidden Information

Block-wise fragile watermarks can be used to reveal maliciously tampered areas in multimedia products. However a forged content containing a cloned fragile watermark can be constructed by using a series of watermarked data. To defeat this type of counterfeit attack, a novel fragile watermarking technique is proposed in which different pseudo-random data are selected for different host products, and the generated fragile watermark is dependent upon the selected information. While inserting the fragile watermark, the pseudo-random information is also robustly embedded into the host data. Because of the difference between the selected information, different watermarked data cannot be used to forge illegal contents containing a valid fragile watermark.

Imperceptible and Robust DWT-SVD-Based Digital Audio Watermarking Algorithm

Digital representation of multimedia is more advantageous than the analog one due to potentially improving the portability, efficiency, and accuracy of the information presented. Despite the challenge of having high hiding capacity like other media watermarking, still audios are likely candidates for data hiding due to their possible capabilities of achieving impressive robustness and protection against online music piracy and content identification. In this paper, we propose efficient audio watermarking embedding and extracting techniques, which mainly use Discrete Wavelet Transform (DWT) and Singular Value Decomposition (SVD), in which a new matrix formation of details sub-bands is proposed. Additionally, massive experimental work was conducted to investigate the contributions of operating different watermark intensities and multiple levels of DWT to our proposed techniques. Two performance objectives are employed in this work which involve imperceptibility and robustness. To further boost the imperceptibility, we incorporate the code assignment method to our techniques that do outperform what are closely connected in the literature.

Secure and Robust Digital Watermarking： A Survey

A digital watermarking technique is a multi-scientific discipline which is developed rapidly in last several years for digital content protection, such as copyright protection, authentication protection, source tracing, etc. However, in realistic scenarios, the digital watermarking system faces significant secure issues, for example, the attackers want to remove, detect, or embed illegal watermark signals. Therefore, the aim of this contribution is to illustrate recent results of robust and secure watermarking to the signal processing community, and highlight both benefits and still open issues. Specifically, this paper is intended to introduce the concept of secure and robust digital watermarking system, and provide with problems and their countermeasures. First of all, the classic watermark model and cryptosystem will be reviewed and then, the concept of secure and robust digital watermarking system will be described. Next, the watermark attack will be classified and described. Finally, some countermeasures that can help to improve secure and robustness are considered.

Robustness Proof on A United Watermarking Based on CRT Theorem

A new method of embedding and detecting a joint watermarking is proposed. Itapplies the asmuth-bloom secret sharing scheme, which is based on CRT (Chinese remainder theorem)theorem, to the digital watermarking technology. On the base of describing the watermarkingembedding proceeding and analyzing the watermarking detection proceeding, a series of experiments isdone. The experiments emphasize on the method's robust proving and security analysis. And theexperiments show that the method can resistthe attacks of JPEG compress, geometry, noise and grayadjusting. The results of the experiments show that the method has a nice recognition of copyrightfor joint ownership.

基于水印技术的深度神经网络模型知识产权保护

构造一个优秀的深度神经网络(deep neural network,DNN)模型需要大量的训练数据、高性能设备以及专家智慧.DNN模型理应被视为模型所有者的知识产权(intellectual property,IP).保护DNN模型的知识产权也体现了对作为构建和训练该模型的数据要素价值的珍视.然而,DNN模型容易受到恶意用户的盗取、篡改和非法传播等攻击,如何有效保护其知识产权已成为学术研究的前沿热点与产业亟需攻克的难题.不同于现有相关综述,聚焦DNN模型水印的应用场景,从用于模型版权声明的鲁棒模型水印和用于模型完整性验证的脆弱模型水印2个维度出发,着重评述基于水印技术的DNN模型知识产权保护方法,探讨不同方法的特点、优势及局限性.同时,详细阐述DNN模型水印技术的实际应用情况.最后,在提炼各类方法共性技术的基础上,展望DNN模型知识产权保护的未来研究方向.

基于双域标记的视频鲁棒可逆水印算法

针对现有视频水印算法无法兼顾鲁棒性与可逆性的问题,文章提出一种基于双域标记的视频鲁棒可逆水印算法。该算法在H.264视频编码中的量化DCT系数域利用传统鲁棒水印拼接技术,嵌入水印信息;在运动矢量域利用二维直方图迁移技术,嵌入辅助信息,实现解码端的水印提取与原始视频的无损恢复。实验结果表明,文章算法具有良好的不可见性,实验视频的峰值信噪比与结构相似度均值分别为44.7537 dB与0.9902,比特率扩张均在16.74%以下,同时对不同强度的失真攻击均具有强鲁棒性,实验视频的归一化互相关系数均在0.970以上,误码率均在0.068以下。