Watermark Capacity Research Articles

Bivariate BMM-based hybrid domain image watermark detector

Robustness, imperceptibility, and watermark capacity are three indispensable and contradictory properties for any image watermarking systems. It is a challenging work to achieve the balance among the three important properties. In this paper, by using the bivariate Beta mixture model (Bivariate BMM), we present a statistical image watermark scheme in nonsubsampled Contourlet transform (NSCT)-fractional order Jacobi Fourier moments (FJFMs) amplitude hybrid domain. The whole watermarking algorithm includes two parts: watermark embedding and detection. NSCT is firstly performed on host image to obtain the frequency subbands, and the NSCT subbands are divided into non overlapping blocks. Then, the significant NSCT domain blocks are selected using local binary patterns (LBP). Meanwhile, for each selected NSCT coefficient block, FJFMs are calculated to obtain the NSCT-FJFMs amplitude. Finally, watermark signals are inserted into the amplitude hybrid domain of NSCT-FJFMs. In order to detect accurately watermark signal, the statistical characteristics of NSCT-FJFMs magnitudes are analyzed in detail. Then, NSCT-FJFMs magnitudes are described statistically by Bivariate BMM, which can simultaneously capture the marginal distribution and strong dependencies of NSCT-FJFMs magnitudes. Also, Bivariate BMM parameters are estimated accurately by the rough-enhanced-Bayes mixture estimation & expectation–maximization (REBMIX&EM) approach. Finally, a statistical watermark detector based on the locally optimum (LO) decision rule and Bivariate BMM is developed in NSCT-FJFMs magnitude hybrid domain. Also, the closed-form expressions on the LO statistic is derived and the receiver operating characteristic (ROC) about our detector is analyzed. Extensive experimental results show the superiority of the proposed image watermark detector over some state-of-the-art statistical watermarking methods.

Vector geographic data commutative encryption and watermarking algorithm based on prediction differences

Commutative encryption and watermarking (CEW) is a seamless integration of encryption and watermarking technologies, overcoming the limitations of single security protection methods that may fail to provide comprehensive data protection. It is a research hotspot in the field of geographic information security. However, constructing or selecting stable features for vector point data to apply CEW algorithms remains a challenging problem. To address this, this paper utilizes space-filling curves to organize discrete points into line or polygon types and proposes a CEW algorithm for vector data based on prediction differences. Specifically, feature points are used to fit curves, providing independent operational spaces for watermarking and encryption. The segmented fitted curves are arbitrarily flipped to achieve perceptual encryption, while watermarks are embedded in the differences between the fitted curves and the actual data. Experimental results demonstrate that the proposed algorithm effectively addresses the issue of existing algorithms being unsuitable for point data. In simulated real-world scenarios, the extracted watermark information achieved NC values above 0.75, indicating strong robustness. Under conditions using existing lossless algorithms, the watermark capacity of the proposed method is thousands of times higher than that of existing algorithms, and it exhibits excellent encryption security, providing a new perspective for further research on lossless CEW.

Statistical learning based blind image watermarking approach

Image watermarking technology poses a significant challenge, requiring a delicate balance between robustness, imperceptibility, and capacity. To solve the balancing problem, a statistical learning based blind image watermarking technique is proposed in this paper. The idea of the proposed method to solve the balancing problem is to enhance imperceptibility and robustness while accommodating sufficient watermarks. Firstly, the local low-order pseudo-Zernike moments (PZM) magnitude in the discrete non-separable Shearlet transform (DNST) domain is constructed as the embedding domain. To ensure stability in embedding positions, we propose an edge embedding strategy. Secondly, by analyzing the statistical characteristics and multi-correlations of DNST-PZM magnitudes, a multi-correlation vector model based on the skew student's-t mixture (SSM) and hidden Markov tree (HMT) is designed. Finally, leveraging the vector SSM-HMT model and the maximum likelihood (ML) criterion, we derive the closed-form decoder expression. Comparative analysis with state-of-the-art methods demonstrates the superior imperceptibility and robustness of our proposed approach in accommodating the same capacity watermark.

Revisiting the Information Capacity of Neural Network Watermarks: Upper Bound Estimation and Beyond

To trace the copyright of deep neural networks, an owner can embed its identity information into its model as a watermark. The capacity of the watermark quantify the maximal volume of information that can be verified from the watermarked model. Current studies on capacity focus on the ownership verification accuracy under ordinary removal attacks and fail to capture the relationship between robustness and fidelity. This paper studies the capacity of deep neural network watermarks from an information theoretical perspective. We propose a new definition of deep neural network watermark capacity analogous to channel capacity, analyze its properties, and design an algorithm that yields a tight estimation of its upper bound under adversarial overwriting. We also propose a universal non-invasive method to secure the transmission of the identity message beyond capacity by multiple rounds of ownership verification. Our observations provide evidence for neural network owners and defenders that are curious about the tradeoff between the integrity of their ownership and the performance degradation of their products.

Commutative encryption and watermarking algorithm based on compound chaotic systems and zero-watermarking for vector map

Commutative encryption and watermarking (CEW) is an efficient and safe protection technology combining cryptography and digital watermarking. It features the dual functions of secure transmission and copyright safeguarding. In traditional CEW algorithms for vector map, the watermark is embedded by modifying the host data, which cannot meet the needs of high precision vector map, especially for vector maps applied in military and navigation positioning fields. To fill this gap, a CEW algorithm for vector map based on zero-watermarking and permutation encryption is proposed. Firstly, compound chaotic systems are applied to permutation encryption to encrypt the storage order and position of the vertex coordinates respectively. The key is generated by the SHA-256 hash method, which has higher security. Secondly, the number of vertex features is regarded as the feature invariants to establish the watermark information and watermark index. After that, the zero-watermarking image is constructed through the XOR operation of the feature matrix and the copyright information matrix. Experiments show that the combination of permutation encryption and zero watermark can better meet the needs of secure transmission and copyright protection of high-precision vector graphics. The security, robustness and watermark capacity of the algorithm have been improved, making it more practical.

DoBMark: A double-branch network for screen-shooting resilient image watermarking

The dramatic changes in cross-media information transmission modes, especially screen-shooting, have made traditional robust image watermarking for digital channels less resistant to various physical noises from the real world. To address this problem, we propose a double-branch network for screen-shooting resilient image watermarking. Specifically, two weights conforming to a Gaussian distribution are assigned to the double-branch encoder, and by jointly training, two residual images containing watermark information are produced to generate the fused watermarked image. A dual frame alternate-fusion mechanism and a just noticeable difference (JND) constraint function on residual images are employed to improve the watermark invisibility and the quality of watermarked images. A differentiable distortion network is introduced to enhance the robustness of the end-to-end network. Additionally, the decoder integrates a quality enhancement module (QEM) that can correct distortions and apply de-noising to the distorted images, thereby improving the accuracy of watermark information extraction. Experimental results show that the proposed scheme can achieve high robustness against the screen-shooting process while maintaining a satisfactory watermark capacity and visual quality of the watermarked image.

Optimal Information Hiding: Advanced Bitstream‐Based Watermarking for Secure and Efficient Integration of Image Data in Digital Videos

Video watermarking is a technique used to embed a visible or invisible mark onto a video file in order to claim ownership, protect intellectual property rights, and detect unauthorized users. The issue of video piracy arises due to the advancement of Internet services and the utilization of various storage technologies. This problem becomes particularly significant with the widespread propagation of media through online channels. The constant progress in sharing of data, videos, images, and applications necessitates the implementation of measures focused on security and the protection of intellectual ownership rights. To address this issue, we proposed a novel Bitstream video watermarking technique that integrates cutting‐edge methodologies to seamlessly embed image data within digital videos. This technique stands apart from less sophisticated watermarking methods by capitalizing on spatial and temporal domain concepts in video processing. An experiment is conducted to analyze the time required for the insertion and extraction processes to gain insights into the performance of bitstream watermarking in the video. While enhancing the existing approach, we systematically explored diverse strategies aimed at augmenting watermark capacity, bolstering robustness, and heightening visual imperceptibility. These strategies encompassed the intricate infusion of watermark fragments into the frame area through chaotic mechanisms, the integration of error‐correcting codes to ensure data fidelity, and the selective omission of dynamic video segments during information extraction processes. Rigorous experimentations are undertaken by the constraints of lossy compression scenarios, maintaining equivalent or reduced bitrate parameters. The findings substantiate the favorable outcomes stemming from the implemented enhancement, affirming the tangible suitability of the phase watermarking technique for the protection of video copyrights. In order to assess the quality of the bitstream video watermarking technique, the peak signal‐to‐noise ratio (PSNR), structural similarity index (SSIM), and normalized correlation coefficient (NCC) are computed and examined by the testing data. The suggested model achieved a PSNR value up to 32.52 dB, SSIM value up to 0.97, and NCC value is 1. The dynamic range (DR) and spatial resolution (SR) are measured in the evaluation process. Security is enhanced significantly after implementing the multifaceted approach. The watermarking scheme is more robust and can effectively resist the potential attacks. In summary, this study advances the field of video watermarking by proposing a sophisticated bitstream technique and rigorously evaluating its performance. The outcomes underscore its practical viability for copyright protection, contributing to a more secure digital media landscape.

Statistical Image Watermark Algorithm for FAPHFMs Domain Based on BKF–Rayleigh Distribution

In the field of image watermarking, imperceptibility, robustness, and watermarking capacity are key indicators for evaluating the performance of watermarking techniques. However, these three factors are often mutually constrained, posing a challenge in achieving a balance among them. To address this issue, this paper presents a novel image watermark detection algorithm based on local fast and accurate polar harmonic Fourier moments (FAPHFMs) and the BKF–Rayleigh distribution model. Firstly, the original image is chunked without overlapping, the entropy value is calculated, the high-entropy chunks are selected in descending order, and the local FAPHFM magnitudes are calculated. Secondly, the watermarking signals are embedded into the robust local FAPHFM magnitudes by the multiplication function, and then MMLE based on the RSS method is utilized to estimate the statistical parameters of the BKF–Rayleigh distribution model. Finally, a blind image watermarking detector is designed using BKF–Rayleigh distribution and LO decision criteria. In addition, we derive the closed expression of the watermark detector using the BKF–Rayleigh model. The experiments proved that the algorithm in this paper outperforms the existing methods in terms of performance, maintains robustness well under a large watermarking capacity, and has excellent imperceptibility at the same time. The algorithm maintains a well-balanced relationship between robustness, imperceptibility, and watermarking capacity.

Multiple Watermarking Algorithms for Vector Geographic Data Based on Multiple Quantization Index Modulation

Multiple digital watermarking is an important and challenging task in geographic information science and data security. Vector geographic data are a basic data format for digital geographic data storage, and the security protection of these data involves copyright protection and tracking. As part of the solution, existing digital watermarking algorithms have made contributions to vector geographic data protection. However, when vector geographic data flow through multiple units, they need to be marked to ensure that the original data are not destroyed during data processing. Existing single or multiple data watermarking algorithms often fail in the presence of data processing because the new watermarks overlay the old ones. Consequently, a multiple digital watermarking algorithm based on multiple QIM (quantization index modulation) is proposed. First, based on traditional quantization index modulation (QIM), a multiple QIM is proposed. Unlike traditional QIM, in multiple QIM, the process of quantization is executed multiple times depending on the number of watermarks. Then, the vertices are quantized into different quantization intervals according to the multiple QIM. Finally, multiple watermarks are embedded into different quantization intervals to reduce the interference among multiple watermarks, and the original watermarks are not needed in the process of watermark detection. We then conducted experiments to test the multiple watermark method’s robustness and capacity, with an emphasis on datasets with a lower data volume. The experimental results show that the proposed algorithm achieves good performance in terms of its robustness against common issues, such as vertices addition, data simplification, data cropping, and feature deletion; this holds true for both normal and small amounts of data. Additionally, it has a high multiple watermark capacity.

UDTCWT-PHFMs Domain Statistical Image Watermarking Using Vector BW-Type R Distribution

For any image watermarking algorithm, how to achieve the trade-off among robustness, imperceptibility, and watermark capacity is a challenging problem because of their mutually constrained relationship. In this paper, we design a statistical-based image watermarking system to solve the trade-off problem. In embedding process, consider the imperceptibility and the robustness, we inventively combine the undecimated dual tree complex Wavelet transform (UDTCWT) and the polar harmonic Fourier moments (PHFMs) to obtain the UDTCWT-PHFMs magnitudes as the watermark carriers, and we embed watermark signals in multiplicative manner. In modeling phase, by analyzing the statistical property and the multiple correlations of the UDTCWT-PHFMs magnitudes, we bound the magnitudes of different directions into the vector groups, and then we model them with the vector Roy type bivariate Weibull (BW-Type R) distribution so that we can capture accurately the marginal characteristics, the inter-scale dependencies, and the inter-orientation dependencies at the same time. Moreover, we obtain the model parameters with the double looped maximum likelihood estimation (double-looped MLE). Benefit from the reliable modeling result, we finally derive a novel specific image watermark decoder to blindly extract the hidden watermarks. Extensive experiment results declare the designed statistical image watermarking system achieves the better balance among imperceptibility, robustness, and payload.

Robust Texture-Aware Local Adaptive Image Watermarking With Perceptual Guarantee

Watermarking involves embedding a watermark in an image and later extracting it to prove the image’s copyright. In most cases, a complete image contains both smooth and textured regions. As a rule of thumb, the visual quality of an image with a watermark embedded in its textured regions is better than that of the same image with a watermark in smooth regions. This paper, by taking advantage of the fact, proposes a texture-aware local adaptive watermarking algorithm to maximize the watermark’s robustness while maintaining its imperceptibility. To identify textured regions in an image, we introduce the texture value, an efficient and proper metric of the richness of image texture. It combines the texture correlation of the AC coefficients, the luminance masking of the DC coefficient, and the distribution of image texture. A watermark is embedded adaptively into multiple non-overlapping textured regions of an image under the specified SSIM condition. Its adaptiveness comes from a novel texture-aware adaptive parameter model derived by multivariate regression analysis. Correct extraction of watermarks from multiple textured regions can be done by the cooperation of embedding and extraction strategies, with the assistance of RS-based watermark coding model. They allow for greater robustness, faster extraction, and adjustable watermark capacity. The simulation experiments on 100 images demonstrate that our proposed algorithm outperforms state-of-the-art algorithms with respect to imperceptibility, robustness, and adaptability.

A Robust Video Watermarking Algorithm Based on Two-Dimensional Discrete Fourier Transform

Due to the continuous development and popularity of digital video technology, the copyright protection of digital video content has become an increasingly prominent issue. Digital video watermarking, as an effective means of digital copyright protection, has attracted widespread attention from academia and industry. The two-dimensional discrete Fourier transform (2D-DFT) template-based method has the advantages of good real-time performance and robustness, but the embedding capacity is small and cannot resist frame-dropping attack. To address this problem, a new template construction method is proposed in this paper, which can extend the embedding capacity from 1 bit each group of pictures (GOP) to theoretically n bits each GOP. In addition, by changing the GOP pattern, the method gains the ability to resist frame-dropping attacks. Experimental results show that the proposed method can achieve larger watermark capacity while maintaining strong robustness against image-processing attacks, geometric attacks, video-processing attacks and compression attacks.

A Novel Steganography Method for Infrared Image Based on Smooth Wavelet Transform and Convolutional Neural Network

Infrared images have been widely used in many research areas, such as target detection and scene monitoring. Therefore, the copyright protection of infrared images is very important. In order to accomplish the goal of image-copyright protection, a large number of image-steganography algorithms have been studied in the last two decades. Most of the existing image-steganography algorithms hide information based on the prediction error of pixels. Consequently, reducing the prediction error of pixels is very important for steganography algorithms. In this paper, we propose a novel framework SSCNNP: a Convolutional Neural-Network Predictor (CNNP) based on Smooth-Wavelet Transform (SWT) and Squeeze-Excitation (SE) attention for infrared image prediction, which combines Convolutional Neural Network (CNN) with SWT. Firstly, the Super-Resolution Convolutional Neural Network (SRCNN) and SWT are used for preprocessing half of the input infrared image. Then, CNNP is applied to predict the other half of the infrared image. To improve the prediction accuracy of CNNP, an attention mechanism is added to the proposed model. The experimental results demonstrate that the proposed algorithm reduces the prediction error of the pixels due to full utilization of the features around the pixel in both the spatial and the frequency domain. Moreover, the proposed model does not require either expensive equipment or a large amount of storage space during the training process. Experimental results show that the proposed algorithm had good performances in terms of imperceptibility and watermarking capacity compared with advanced steganography algorithms. The proposed algorithm improved the PSNR by 0.17 on average with the same watermark capacity.

A robust and high embedding capacity watermarking technique for telemedicine

ABSTRACT The medical field has been greatly influenced by the rapid expansion of technology and globalization. Medical images are routinely transferred by wired or remote media amongst professionals, medical experts, analysts, and patients themselves in order to improve the diagnostic outcomes. To achieve investigative conclusions, physicians concentrate on the ROI (Region of Interest) in a medical image. To retrieve the ROI when it has been damaged by noise or altered by intruders during transmission, the ROI data are hidden within the RONI (Region of Non-Interest) in medical images. This paper intends a high embedding capacity watermarking system grounded on Finite Ridgelet Transform (FRT). Proposed method supports the high embedding capacity for concealing entire ROI data inside RONI and simultaneously provides a high level of robustness to the concealed data.

Multilevel histogram shape‐based image watermarking invariant to geometric attacks

AbstractIn this paper, a geometrically invariant image watermarking scheme is proposed by exploiting multilevel histogram shapes. The embedding procedure starts by decomposing the host image with the first level Haar wavelet. After that, histograms are extracted from the approximation subband via several rounds, which are used to embed watermark bits. Each round of embedding first extracts a histogram at a specified level. Then the histogram is split into fragments, into which a number of watermark bits can be embedded. In this way, a considerable watermarking capacity is available. Besides, a histogram adjustment in the first embedding round is suggested to guarantee good population of histogram bins. Experimental results support its robustness against various common attacks and geometric attacks. Moreover, the scheme can embed multiple watermark sequences with various robustness and capacity profiles, which enriches its practical applications.

A Self-Error-Correction-Based Reversible Watermarking Scheme for Vector Maps

The existing digital watermarking schemes for vector maps focus mainly on the process of watermark embedding, while few works have been conducted on the topic of the self-optimization of watermark data in the process of watermark detection. There is thus still much room for accuracy improvement in watermark detection. In this paper, a model of mixed watermark data construction is built first. It constructs the error-correction codes and checking code of the original copyright watermark data and combines them to generate the final watermark data. Additionally, a lossless compression algorithm is designed for watermark data to constrain the total watermark length. Based on the constructed model, a self-error-correction-based reversible watermarking scheme is put forward for vector maps. In this scheme, map vertices are divided into non-intersecting groups first according to stability, and mixed watermark data are then embedded with respective vertex groups. Simulation results demonstrate that the watermark capacity of this scheme is 1.0000, the coordinate error caused by the watermark embedding process can be limited to no more than 0.00001 when the strength of watermark embedding is set to five, and several watermark bits can be effectively detected and corrected after watermark extraction. Experimental results and analysis show that it can strike a good balance among reversibility, invisibility, capacity and robustness. It can provide a novel solution to improve the watermark detection accuracy of digital watermarking schemes for vector maps.

Efficient Video Watermarking Algorithm Based on Convolutional Neural Networks with Entropy-Based Information Mapper.

This paper presents a method for the transparent, robust, and highly capacitive watermarking of video signals using an information mapper. The proposed architecture is based on the use of deep neural networks to embed the watermark in the luminance channel in the YUV color space. An information mapper was used to enable the transformation of a multi-bit binary signature of varying capacitance reflecting the entropy measure of the system into a watermark embedded in the signal frame. To confirm the effectiveness of the method, tests were carried out for video frames with a resolution of 256 × 256 pixels, with a watermark capacity of 4 to 16,384 bits. Transparency metrics (SSIM and PSNR) and a robustness metric-the bit error rate (BER)-were used to assess the performance of the algorithms.

Low distortion reversible database watermarking based on hybrid intelligent algorithm.

In many fields, such as medicine and the computer industry, databases are vital in the process of information sharing. However, databases face the risk of being stolen or misused, leading to security threats such as copyright disputes and privacy breaches. Reversible watermarking techniques ensure the ownership of shared relational databases, protect the rights of data owners and enable the recovery of original data. However, most of the methods modify the original data to a large extent and cannot achieve a good balance between protection against malicious attacks and data recovery. In this paper, we proposed a robust and reversible database watermarking technique using a hash function to group digital relational databases, setting the data distortion and watermarking capacity of the band weight function, adjusting the weight of the function to determine the watermarking capacity and the level of data distortion, using firefly algorithms (FA) and simulated annealing algorithms (SA) to improve the efficiency of the search for the location of the watermark embedded and, finally, using the differential expansion of the way to embed the watermark. The experimental results prove that the method maintains the data quality and has good robustness against malicious attacks.

Parallel multiple watermarking using adaptive Inter-Block correlation

People pay more and more attention to copyright protection and digital watermarking technology is a reliable method for copyright identification. In this paper, we propose the parallel multiple watermarking method using adaptive inter-block correlation. Considering the image texture characteristics, the texture complexity method is designed, based on which, the Circular-shaped Adjacent Block Selection and the Arch-shaped Adjacent Block Selection will be adaptively selected for adjacent block selection. The multiple watermarks are alternately embedded into the low and middle frequency band in DCT domain of the image blocks to good imperceptibility and high robustness. By adjusting the difference of projection of embedding coefficients and reference coefficients on the spreading vector, the multiple watermarks can be embedded, so the embedding capacity increases. In addition, we improve the multiple watermarks embedding based on orthogonal spreading vectors so that it can be adapted to embedding multiple watermarks in parallel based on inter-block correlation, saving embedding and extraction time. We theoretically analyze the rationality of parallel orthogonal embedding of multiple watermarks and experimentally verify the high efficiency of parallelism. Cover images of different texture complexity are included in the test dataset, and various attacks have been simulated in the experiments. Experimental results on imperceptibility, robustness, time cost and watermark capacity show the satisfied performance of the proposed scheme.

Efficient methods for digital image watermarking and information embedding

Now a day to achieve security of digital data, utilizing digital image watermarking scheme is the option. The primary purpose to upgrade image watermarking scheme is to fulfill the need of sufficient imperceptibility, capacity, and robustness of watermark against several attacks like JPEG compression parameter, salt and pepper noise, cropping factor of the image part which contains a watermark and rotating the watermark at one particular angle. During embedding stage in digital image watermarking scheme, a secret message or image introduced into a host image without destroying the quality of original cover image for security and authentication of the data. During extraction stage in the watermarking scheme applying a process to that employed in insertion step but in a reverse way. In this paper different evaluation based on the watermarking methods described. Many projects have been presented such as DCT, DWT, DFT, SVD using FWHT, QIM, BPNN, DFIS, EZW, Huffman coding to provide protection, robustness and high embedding capacity. In the digital image watermarking world, where Peak signal-to-noise ratio (PSNR) is utilized to determine the image quality factor and Normalized correlation (NC) and robustness of the watermark. Using this learning opportunity an environment friendly digital image watermarking scheme can be used with sustainable infrastructure in developing countries.