Robust Watermarking Research Articles

Real-time and screen-cam robust screen watermarking

Unauthorized photography of screen-loaded information has become a low-cost and difficult-to-trace method for leakage. Many researchers have proposed screen-cam robust watermarking methods for digital images and documents to identify surreptitious photography. However, these methods are designed for specific types of data and cannot be used in real time, which limits their applicability. This study proposes a screen watermarking method that possesses screen-cam robustness and real-time watermark refreshing. Specifically, a resolution-adaptive watermark template was designed that comprises message watermark templates and two types of synchronization watermark templates. To achieve real-time watermark refreshing, the pregenerated watermark template is directly embedded into the back buffer, which represents the content to be loaded onto the screen. A simplified just noticeable difference model was employed to ensure watermark imperceptibility. For watermark extraction, the positions of the embedded synchronization watermark templates are calculated using a synchronization response index method. Based on these positions, we can perform automatic perspective correction and locate the message watermark template embedded region. Finally, the message watermark was extracted from the discrete Fourier transform domain of the noise component. Extensive experiments demonstrated that the watermark refresh rate meets practical requirements and that the proposed method is robust against image-processing attacks and screen-cam attacks.

An improved reversible watermarking scheme using embedding optimization and quaternion moments

Digital watermarking of images is an essential method for copyright protection and image security. This paper presents an innovative, robust watermarking system for color images based on moment and wavelet transformations, algebraic decompositions, and chaotic systems. First, we extended classical Charlier moments to quaternary Charlier moments (QCM) using quaternion algebra. This approach eliminates the need to decompose color images before applying the discrete wavelet transform (DWT), reducing the computational load. Next, we decompose the resulting DWT matrix using QR and singular value decomposition (SVD). To enhance the system's security and robustness, we introduce a modified version of Henon's 2D chaotic map. Finally, we integrate the arithmetic optimization algorithm to ensure dynamic and adaptive watermark insertion. Our experimental results demonstrate that our approach outperforms current color image watermarking methods in security, storage capacity, and resistance to various attacks, while maintaining a high level of invisibility.

INVARIANT ZERO-WATERMARKING ALGORITHM IN DWT-DCT DOMAIN USING ROBUST FEATURES MATCHING

In order to protect the copyright of the digital contents, the robust watermarking techniques are employed based on frequency domains or combined frequency domains. Another techniques, called zero-watermarking which does not modify the original image to embed the watermark but create a watermark from its robust features, is a useful technique for resolving the tension between robustness and invisibility. In this paper, we propose a new zero-watermarking algorithm based on discrete wavelet transform and discrete cosine transform domain with significant feature points matching for improving the robustness. In our proposed method, the original image is firstly separated into three components (Y, Cr, Cb), then its Y-component is performed with discrete wavelet transform, afterwards its LL3 is transformed with discrete cosine transform. To generate the master share of the original image, the DCT-based image is binarized. After performing the Arnold transformation on the watermark, the owner share is generated by taking the XOR operation on the scrambled watermark and master share. The robustness of the our proposed algorithm for imaging processes is analyzed, and the results show that the proposed algorithm is robust to common signal processing such as noise, filtering, JPEG compression, geometric attacks such as rotation, scaling, translation and so on.

Security analysis and improvement of DWFCAT

With the rapid development of Internet technology, the copyright protection and authentication of multimedia data have attracted more and more attention. Recently, a dual watermarking framework for industrial image content authentication and tampering localization (DWFCAT) has been proposed, in which the main innovation is the double encrypted robust watermark is embedded into the transform domain by exploiting the DCT energy compression characteristics and block coefficient correlation mechanism, the fragile watermark is embedded in the spatial domain to ensure data authentication and tamper location. However, through security analysis, we found that DWFCAT has security holes, the dual encryption algorithm of the robust watermarks cannot resist KPA attacks and prevent robust watermarks from being damaged, stolen, and replaced, even when the fragile watermark is unaware. Theoretical analysis and simulation results verify the effectiveness of the method. To improve the security of the original watermarking scheme and the ability to tampering with location, and restore the robust watermark that has been tampered with, an improved scheme is also given in this paper.

A dual watermarking algorithm for trajectory data based on robust watermarking and fragile watermarking

Digital watermarking technology plays a crucial role in securing trajectory data. However, as trajectory data usage scenarios continue to expand, the security requirements for it have changed from a single copyright protection to one that takes into account data integrity. Existing digital watermarking algorithms for trajectory data can only choose between implementing copyright protection or ensuring integrity, unable to simultaneously achieve both functionalities. This limitation impedes the sharing and utilization of trajectory data. A dual watermarking algorithm that combines robust and fragile watermarking was innovatively proposed to solve this problem based on the geometric domain. Firstly, a set of feature points is extracted from the trajectory, and the farthest point pair of the minimum convex hull of the feature points is set as fixed points. The robust watermark is then embedded in the angles constructed by the feature points and the fixed points using quantization index modulation. Meanwhile, the trajectory points are grouped based on the angle and distance ratio constructed from the trajectory points to the fixed points. In each group, the spatiotemporal attributes of the trajectory points are mapped to the fragile watermark, which is then embedded into the distance ratios constructed by the trajectory points. Experimental results show that the proposed algorithm achieves both copyright protection and integrity verification for trajectory data and exhibits stronger robustness and tampering localization ability. This research can provide security and privacy protection for trajectory data and contribute positively to the application of trajectory data.

Robust watermarking with PSO and DnCNN

Robust watermarking with PSO and DnCNN

Image Robust Watermarking Method Based on DWT-SVD Transform and Chaotic Map

The existing watermarking algorithms make it difficult to balance the invisibility and robustness of the watermark. This paper proposes a robust image watermarking method based on discrete wavelet transform (DWT), singular value decomposition (SVD), and chaotic maps. This method is a semiblind watermarking method. First, a chaotic logistic-tent map is introduced, employing an extensive chaotic parameter domain. This map is amalgamated with Arnold’s transformation to encrypt the watermark image, thereby bolstering the security of the watermark information. Subsequently, the frequency domain is obtained by applying DWT to the carrier image. Embedding watermarks in the frequency domain ensures the invisibility of the watermark, with a preference for a high-frequency subband after the DWT of the carrier image for enhanced watermark robustness. SVD is then applied to both the high-frequency subband of the carrier image after DWT and the encrypted watermark image. The final step involves embedding the singular values of the encrypted watermark image into the carrier image’s singular values, thereby completing the watermark information embedding process. In simulation experiments, an invisibility test was conducted on various carrier images, yielding peak signal-to-noise ratio (PSNR) values consistently exceeding 43, and structural similarity (SSIM) close to 1. Robustness testing against various types of attacks resulted in normalized correlation (NC) values consistently surpassing 0.9, with bit error rate (BER) values approaching 0. In conclusion, the proposed algorithm satisfies imperceptibility requirements while demonstrating formidable robustness.

An improved robust algorithm for optimisation-based colour medical image watermarking

Recently, significant attention has been focused on copyright protection of medical images, causing watermarking to become a prevalent research topic. In this paper, we propose an optimisation-based robust watermarking algorithm for the copyright protection of colour medical images. Initially, we decompose a host medical image by lifting wavelet transform (LWT), followed by discrete cosine transform (DCT) into transformed coefficients, and then embed multiple watermarks into the transformed host image by using hybrid optimisation algorithms. To further improve security and reduce the channel noise distortion, we then apply hashing and Hamming code to image and text mark, respectively, before the embedding process. Finally, we utilise 2D chaotic map to encrypt the marked media, aiming to achieve enhanced security and confidentiality. The experimental outcome shows satisfactory invisibility, watermark payload and robustness against image-processing attacks. Furthermore, through numerous comparative experiments with nine state-of-the-art algorithms on two standard datasets, the effectiveness of the proposed algorithm is demonstrated.

P‐5.5: An Optimized Robust Watermarking Algorithm for Video Based on Spatio‐temporal Feature Fusion

P‐5.5: An Optimized Robust Watermarking Algorithm for Video Based on Spatio‐temporal Feature Fusion

MuST: Robust Image Watermarking for Multi-Source Tracing

In recent years, with the popularity of social media applications, massive digital images are available online, which brings great convenience to image recreation. However, the use of unauthorized image materials in multi-source composite images is still inadequately regulated, which may cause significant loss and discouragement to the copyright owners of the source image materials. Ideally, deep watermarking techniques could provide a solution for protecting these copyrights based on their encoder-noise-decoder training strategy. Yet existing image watermarking schemes, which are mostly designed for single images, cannot well address the copyright protection requirements in this scenario, since the multi-source image composing process commonly includes distortions that are not well investigated in previous methods, e.g., the extreme downsizing. To meet such demands, we propose MuST, a multi-source tracing robust watermarking scheme, whose architecture includes a multi-source image detector and minimum external rectangle operation for multiple watermark resynchronization and extraction. Furthermore, we constructed an image material dataset covering common image categories and designed the simulation model of the multi-source image composing process as the noise layer. Experiments demonstrate the excellent performance of MuST in tracing sources of image materials from the composite images compared with SOTA watermarking methods, which could maintain the extraction accuracy above 98% to trace the sources of at least 3 different image materials while keeping the average PSNR of watermarked image materials higher than 42.51 dB. We released our code on https://github.com/MrCrims/MuST

PersistVerify: Federated model ownership verification with spatial attention and boundary sampling

Federated learning, known for its emphasis on privacy and resource efficiency, has emerged as a transformative paradigm in the fields of artificial intelligence and industrial machine learning. However, with the advancement and widespread adoption of this technology, the concern of model theft in federated learning models becomes increasingly prominent. While current endeavors concentrate on protecting individual deep learning models, limited attention has been dedicated to those involved in federated learning, especially within decentralized environments. To fill this void, we introduce PersistVerify, an innovative approach for verifying model copyright within the federated learning framework. PersistVerify integrates boundary sample selection and spatial attention mechanisms, enhancing the robustness and confidentiality of neural network backdoor watermarks to ensure secure verification of model ownership. PersistVerify constructs a confidential and robust watermark dataset through three sequential steps: latent representation extraction, boundary sample selection, and spatial attention-based trigger embedding. Our research addresses the pervasive challenge of reliable model ownership verification in federated learning, demonstrating the efficacy of PersistVerify. This study provides valuable insights and methodologies to maintain the confidentiality and reliability of neural network backdoor watermarks in the domains of artificial intelligence and federated learning.

SEDD: Robust Blind Image Watermarking With Single Encoder And Dual Decoders

Abstract Blind image watermarking is regarded as a vital technology to provide copyright of digital images. Due to the rapid growth of deep neural networks, deep learning-based watermarking methods have been widely studied. However, most existing methods which adopt simple embedding and extraction structures cannot fully utilize the image features. In this paper, we propose a novel Single-Encoder-Dual-Decoder (SEDD) watermarking architecture to achieve high imperceptibility and strong robustness. Precisely, the single encoder utilizes normalizing flow to realize watermark embedding, which can effectively fuse the watermark and cover image. For watermark extraction, we introduce a parallel dual-decoder to improve the imperceptibility and extracting ability. Extensive experiments demonstrate that better watermark robustness and imperceptibility are obtained by SEDD architecture. Our method achieves a bit error rate less than 0.1% under most attacks such as JPEG compression, Gaussian blur and crop. Besides, the proposed method also obtains strong robustness under combined attacks and social platform processing.

Robust Zero-Watermarking by Circular Features and 1-D NRDPWT Transformation

<p>This paper introduces a secure and robust zero-watermarking framework that leverages the advantages of zero-watermarking, ensuring non-destructive modification of original images and unlimited capacity. The proposed method enables robust watermark embedding while preserving the original image. It employs a novel feature extraction approach using circular areas based on image radius, enhancing feature resilience. Additionally, applying one-dimensional non-recursive discrete periodized wavelet transform (1-D NRDPWT) converts feature values into phi, contributing to enhanced stability and robustness. Enhanced security is achieved through the use of Shuffle and Pseudo-Random Number Generator (PRNG). Experimental results, evaluated using metrics such as Bit Error Rate (BER) and Normalized Correlation (NC), validate the exceptional performance of this watermarking technique. These findings underscore the framework’s robustness, security, reliability, and integrity against both general and geometric noise attacks, making it a secure and robust solution for modern digital image copyright protection. In summary, our method offers an effective defense against various noise attacks while ensuring the highest watermark quality without compromising the original image. It is a significant advancement in copyright protection applications.</p> <p> </p>

Robust image watermarking using ant colony optimization and fast generic radial harmonic Fourier moment calculation

AbstractIn open networks, the geometric deformation and common image processing are common image manipulation modes, which pose a great challenge in robust watermarking. To improve the robustness of GRHFM‐based watermarking, a watermarking algorithm based on the fast GRHFM calculation method and ant colony optimization (ACO) based fractional parameter selection method is proposed. With the similarity between the discrete Fourier transform and GRHFM moment calculation, the algorithm utilizes fast Fourier transform to improve the GRHFM calculation accuracy and speed. To select the optimal GRHFM fractional parameter for watermarking algorithm, ACO is introduced to the fractional parameter adaptive selection method. Here, the fast Fourier transform‐based calculation method is combined with the adaptive parameter selection method to maximize the invisibility and robustness of watermarking. The experimental results indicate that the algorithm achieves higher robustness with the same payload and invisibility compared with other existing watermarking methods.

Robust Watermarking Against Camera Shooting for PowerPoint Presentation

Robust Watermarking Against Camera Shooting for PowerPoint Presentation

Subnetwork-Lossless Robust Watermarking for Hostile Theft Attacks in Deep Transfer Learning Models

Recently, considerable progress has been made in providing solutions to prevent intellectual property (IP) theft for deep neural networks (DNNs) in ideal classification or recognition scenarios. However, little work has been dedicated to protecting the IP of DNN models in the context of transfer learning. Moreover, knowledge transfer is usually achieved through knowledge distillation or cross-domain distribution adaptation techniques, which will easily lead to the failure of the IP protection due to the high risk of the underlying DNN watermark being corrupted. To address this issue, we propose a subnetwork-lossless robust DNN watermarking (SRDW) framework, which can exploit out-of-distribution (OOD) guidance data augmentation to boost the robustness of watermarking. Specifically, we accurately seek the most rational modification structure (i.e., core subnetwork) using the module risk minimization, and then calculate the contrastive alignment error and the corresponding hash value as the reversible compensation information for the restoration of carrier network. Experimental results show that our scheme has superior robustness against various hostile attacks, such as fine-tuning, pruning, cross-domain matching, and overwriting. In the absence of malicious jamming attacks, the core subnetwork can be recovered without any loss. Besides that, we investigate how embedding watermarks in batch normalization (BN) layers affect the generalization performance of the deep transfer learning models, which reveals that reducing the embedding modifications in BN layers can further promote the robustness to resist hostile attacks.

A statistical characteristics preserving watermarking scheme for time series databases

Database watermarking is one of the most effective methods to protect the copyright of databases. However, traditional database watermarking has a potential drawback: watermark embedding will change the distribution of data, which may affect the use and analysis of databases. Considering that most analyses are based on the statistical characteristics of the target database, keeping the consistency of the statistical characteristics is the key to ensuring analyzability. Since statistical characteristics analysis is performed in groups, compared with traditional relational databases, time series databases (TSDBs) have obvious time-grouping characteristics and are more valuable for analysis. Therefore, this paper proposes a robust watermarking algorithm for time series databases, effectively ensuring the consistency of statistical characteristics. Based on the time-group characteristics of TSDBs, we propose a three-step watermarking method, which is based on linear regression, error compensation, and watermark verification, named RCV. According to the properties of the linear regression model and error compensation, the proposed watermark method generates a series of data that have the same statistical characteristics. Then, the verification mechanism is performed to validate the generated data until it conveys the target watermark message. Compared with the existing methods, our method achieves superior robustness and preserves constant statistical properties better.r.

Robust watermarking of medical images using SVM and hybrid DWT-SVD

Robust watermarking of medical images using SVM and hybrid DWT-SVD

MarkINeRV: A Robust Watermarking Scheme for Neural Representation for Videos Based on Invertible Neural Networks

MarkINeRV: A Robust Watermarking Scheme for Neural Representation for Videos Based on Invertible Neural Networks

Dual Defense: Adversarial, Traceable, and Invisible Robust Watermarking Against Face Swapping

Dual Defense: Adversarial, Traceable, and Invisible Robust Watermarking Against Face Swapping