Watermarking Algorithm Research Articles

Redistributed invariant redundant fractional wavelet transform and its application in watermarking algorithm

In this paper, we introduce an invariant wavelet transform with multiple parameters in fractional domain and apply it to watermarking algorithm. First, we propose a new transform called redistributed invariant redundant fractional wavelet transform (RI-RFrWT) based on redistributed invariant integer wavelet transform (RI-IWT) and redundant fractional wavelet transform (RFrWT) which implements the extension of RI-IWT in the fractional domain. When the transform order of RI-RFrWT is 0, it degenerates to RI-IWT and has invariance. Second, RI-RFrWT is applied to the proposed optimized watermarking algorithm. This algorithm solves the problem that it is difficult for existing algorithms to show high robustness under both geometric and noise attacks. Third, a secure encryption algorithm based on Logisitic-adjusted-Sine map (LASM) and generalized Arnold transform (GAT) is designed to encrypt the information of watermark. Highly sensitive LASM and multi-parameter GAT improve the security of the watermarking algorithm. To improve the invisibility and robustness of the algorithm, particle swarm optimization (PSO) is also used to simultaneously improve the order of RI-RFrWT and embedding strength. Last, the simulation results demonstrate that the proposed watermarking method outperforms high invisibility, robustness and security. Compared with the relevant literature, it has obvious advantages in invisibility and resistance to geometric attacks and noise attacks.

Digital watermarking algorithm for QR code based on hybrid PSOGWO optimization

Abstract With the rapid development of digital media, QR codes have become widely used as an important medium for information transmission. However, this also presents serious security challenges, such as frequent image infringement and inevitable compression and scaling issues during data transfer. These challenges directly threaten the effectiveness and integrity of image information, and effective protection measures must be taken. Under this background, digital watermarking technology comes into being as an innovative method to enhance security. This paper presents an innovative Hybrid Particle Swarm Optimization and Gray Wolf optimization (HPG) algorithm, which combines the advantages of PSO and overcomes the limitations of traditional GWO algorithm. The algorithm is further improved by using Bernoulli chaotic mapping and nonlinear convergence factor. The experiments focus on the global and local search balance of the algorithm and its ability to resist repeated scaling attacks. The results show that the nonlinear convergence factor of HPG algorithm slows down the iteration speed at the initial stage, strengthens the global search, and avoids falling into the local optimal. In the later stage, the iteration is accelerated to improve the local search speed and convergence efficiency, thus optimizing the performance of the algorithm and ensuring the safety and quality of image information. In addition, the algorithm has better performance in balancing imperceptibility and robustness of digital watermarking, and its peak signal-to-noise ratio (PSNR) is higher. Even with many scaling iterations, the normalized correlation (NC) value is still close to 1. Compared with the existing typical algorithms, HPG algorithm is more robust to repeated scaling attacks.

Implementation of Robust and Secure Watermarking Algorithm on FPGA using DCT

Digital watermarking deals with embedding digital content in a cover signal so that it becomes indiscernible to make it robust against different security threats. This work demonstrates the implementation of a robust and secure watermarking technique on a Field Programmable Gate Array (FPGA) using Discrete Cosine Transform (DCT). Block by block DCT of the cover image was computed and watermark pixels in each of the blocks were hidden using middle-frequency band coefficients. Security is ensured by encrypting the watermarkwith a secret key and Arnold transform. The resultant watermark image is robust to various threats like JPEG compression, scaling, cropping, and noise attacks. This watermarking approach requires a large amount of data to be processed at high speed. FPGA is the best choice for such an application. Also, it is reprogrammable and easily upgradable according to user application. In this work, a watermarking algorithm is implemented using Xilinx design tools on the Artix-7 FPGA board.

Desynchronization Attacks Resistant Watermarking for Remote Sensing Images Based on DWT‐SVD and Normalized Feature Domain

ABSTRACTMost existing remote sensing image watermarking algorithms concentrate on excavation of particular embedding templates, image features, or geometric invariant domains, which present challenges in terms of resistance to desynchronization attacks, embedding domain repetition, and insufficient algorithm versatility. To address these issues, this study proposes a watermarking algorithm that is robust to desynchronization attacks and can adapt to different types of remote sensing images using the geometric invariant domain and hybrid frequency domain. The algorithm uses the multi‐scale SIFT to identify feature points in remote sensing images, then creates a Delaunay triangulation network (DTN) based on these feature points, extracts the tangent circles of triangles, and normalizes these tangent circles using image moment and affine transformation, and the feature domains with geometric invariance are constructed. On this basis, the discrete wavelet transform (DWT) transforms the feature domain to the frequency decomposition state, and the singular value decomposition (SVD) further mines the watermark embedding domain, ensuring the stability of the watermark transforming back and forth in the embedding domain and improving the overall invisibility of the watermarking algorithm. The experimental results indicate that, compared to related algorithms, the proposed watermarking algorithm not only adapts better to remote sensing images with different bands and bit depths but also provides superior invisibility and demonstrates strong robustness against various desynchronization attacks such as splicing, panning, rotating, as well as image processing like noise addition, filtering, and compression.

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.

Robust block-based watermarking algorithm with parallelization using multi-level discrete wavelet transformation

Robust block-based watermarking algorithm with parallelization using multi-level discrete wavelet transformation

Identification of Tampering in Arabic Text Documents Using Zero-Watermarking Algorithm

The internet makes sharing information easy, but protecting copyrights and verifying the authentication of online text remains a challenge. Current methods for securing Arabic text are limited. This research introduces a new tool: a zero watermark algorithm designed specifically for Arabic text. This new algorithm protects Arabic text by analyzing its content. It creates a watermark based on a chosen keyword (at least 6 characters, no duplicates), and how often each character appears in different forms (separate, connected), and positions (beginning, middle, and end) within the text. The proposed method was tested on nine different Arabic text samples of varying size, simulating various tampering attempts like inserting, deleting, and rephrasing text. The results are impressive, showing that the algorithm outperforms existing methods in detecting even minor changes.

Fast and robust JND-guided video watermarking scheme in spatial domain

Generally speaking, those watermarking studies using the spatial domain tend to be fast but with limited robustness and imperceptibility while those performed in other transform domains are robust but have high computational cost. Watermarking applied to digital video has as one of the main challenges the large amount of computational power required due to the huge amount of information to be processed. In this paper we propose a watermarking algorithm for digital video that addresses this problem. To increase the speed, the watermark is embedded using a technique to modify the DCT coefficients directly in the spatial domain, in addition to carrying out this process considering the video scene as the basic unit and not the video frame. In terms of robustness, the watermark is modulated by a Just Noticeable Distortion (JND) scheme computed directly in the spatial domain guided by visual attention to increase the strength of the watermark to the maximum level but without this operation being perceivable by human eyes. Experimental results confirm that the proposed method achieves remarkable performance in terms of processing time, robustness and imperceptibility compared to previous studies.

Commutative Encryption and Reversible Watermarking Algorithm for Vector Maps Based on Virtual Coordinates

The combination of encryption and digital watermarking technologies is an increasingly popular approach to achieve full lifecycle data protection. Recently, reversible data hiding in the encrypted domain (RDHED) has greatly aroused the interest of many scholars. However, the fixed order of first encryption and then watermarking makes these algorithms unsuitable for many applications. Commutative encryption and watermarking (CEW) technology realizes the flexible combination of encryption and watermarking, and suits more applications. However, most existing CEW schemes for vector maps are not reversible and are unsuitable for high-precision maps. To solve this problem, here, we propose a commutative encryption and reversible watermarking (CERW) algorithm for vector maps based on virtual coordinates that are uniformly distributed on the number axis. The CERW algorithm consists of a virtual interval step-based encryption scheme and a coordinate difference-based reversible watermarking scheme. In the encryption scheme, the map coordinates are moved randomly by multiples of virtual interval steps defined as the distance between two adjacent virtual coordinates. In the reversible watermarking scheme, the difference expansion (DE) technique is used to embed the watermark bit into the coordinate difference, computed based on the relative position of a map coordinate in a virtual interval. As the relative position of a map coordinate in a virtual interval remains unchanged during the coordinate scrambling encryption process, the watermarking and encryption operations do not interfere with each other, and commutativity between encryption and watermarking is achieved. The results show that the proposed method has high security, high capacity, and good invisibility. In addition, the algorithm applies not only to polyline and polygon vector data, but also to sparsely distributed point data, which traditional DE watermarking algorithms often fail to watermark.

A Video Dual-Domain Blind Watermarking Algorithm Based on Hadamard Transform

Addressing the compatibility challenges surrounding the robustness and reversibility of existing video watermarking techniques, this study introduces a novel video dual-domain blind watermarking algorithm leveraging the Hadamard transform. Specifically tailored for H.264 video copyright protection, the algorithm initially organizes video frames and identifies key frames for watermark embedding. Prior to embedding, the robust watermark undergoes coding preprocessing to optimize its integration. Subsequently, a 4×4 block is expanded based on the selected embedding position within the frame, followed by the application of the Hadamard transform to the enlarged block. The 1-bit robust watermark information is then embedded via the coefficient pair located in the first row of the Hadamard coefficient matrix corresponding to the expanded block. Additionally, a reversible watermark, designed to mitigate the distortions introduced during robust embedding, is generated and embedded into the remaining coefficients of the coefficient matrix using reversible embedding techniques. During watermark extraction, the dual-domain watermark can be retrieved exclusively through reversible extraction methodologies by analyzing the size relationship of coefficient pairs, eliminating the need for access to the original video data. To bolster the algorithm’s robustness, a majority-subordinate voting system is devised and implemented, effectively enhancing its resilience. Experimental findings demonstrate that, compared to similar approaches, this algorithm not only enhances the reversibility of video restoration but also exhibits superior robustness and meets the requirements for imperceptibility.

Double-layer data-hiding mechanism for ECG signals

Due to the advancement in biomedical technologies, to diagnose problems in people, a number of psychological signals are extracted from patients. We should be able to ensure that psychological signals are not altered by adversaries and it should be possible to relate a patient to his/her corresponding psychological signal. As far as our awareness extends, none of the existing methods possess the capability to both identify and verify the authenticity of the ECG signals. Consequently, this paper introduces an innovative dual-layer data-embedding approach for electrocardiogram (ECG) signals, aiming to achieve both signal identification and authenticity verification. Since file name-based signal identification is vulnerable to modifications, we propose a robust watermarking method which will embed patient-related details such as patient identification number, into the medically less-significant portion of the ECG signals. The proposed robust watermarking algorithm adds data into ECG signals such that the patient information hidden in an ECG signal can resist the filtering attack (such as high-pass filtering) and noise addition. This is achieved via the use of error buffers in the embedding algorithm. Further, modification-sensitive fragile watermarks are added to ECG signals. By extracting and checking the fragile watermark bits, we can determine whether an ECG signal is modified or not. To ensure the security of the proposed mechanism, two secret keys are used. Our evaluation demonstrates the usefulness of the proposed system.

A Survey of Text Watermarking in the Era of Large Language Models

Text watermarking algorithms are crucial for protecting the copyright of textual content. Historically, their capabilities and application scenarios were limited. However, recent advancements in large language models (LLMs) have revolutionized these techniques. LLMs not only enhance text watermarking algorithms with their advanced abilities but also create a need for employing these algorithms to protect their own copyrights or prevent potential misuse. This paper conducts a comprehensive survey of the current state of text watermarking technology, covering four main aspects: (1) an overview and comparison of different text watermarking techniques; (2) evaluation methods for text watermarking algorithms, including their detectability, impact on text or LLM quality, robustness under target or untargeted attacks; (3) potential application scenarios for text watermarking technology; (4) current challenges and future directions for text watermarking. This survey aims to provide researchers with a thorough understanding of text watermarking technology in the era of LLM, thereby promoting its further advancement.

Copyright Protection Based on Hybrid Image Watermark (DCT) with Audio Watermark (EMD)

A digital watermark is a type of security that incorporates data into a signal, making it difficult to erase and showing ownership and validity. An important issue brought about by the growing use of the Internet is illicit copyright infringement and authentication. Previous research has proposed several techniques for this problem but has proven them to be either robust, difficult to detect, or fragile and easy to break. Because of this, in this paper, we use two separate kinds of watermarks—one for image and one for audio—to merge these two purposes into one. The image watermark discrete cosine transform (DCT) is renowned for its robustness. It is embedded in an audio watermarking algorithm based on empirical mode decomposition (EMD), ensuring a safe and fragile embedding process. The audio signal was divided into frames, and each one was decomposed by EMD into intrinsic mode functions (IMFs). The DCT watermark bits and the synchronization codes are embedded into the extrema of the first IMF, a high frequency mode sensitive to any small changes in the audio signal. The experimental outcomes suggest that while using two separate kinds of watermarks may seem like a comprehensive solution, it shows the flexibility of EMD and the limits of the DCT watermark technique in different scenarios.

An Audio Watermarking Algorithm Based on Adversarial Perturbation

Recently, deep learning has been gradually applied to digital watermarking, which avoids the trouble of hand-designing robust transforms in traditional algorithms. However, most of the existing deep watermarking algorithms use encoder–decoder architecture, which is redundant. This paper proposes a novel audio watermarking algorithm based on adversarial perturbation, AAW. It adds tiny, imperceptible perturbations to the host audio and extracts the watermark with a pre-trained decoder. Moreover, the AAW algorithm also uses an attack simulation layer and a whitening layer to improve performance. The AAW algorithm contains only a differentiable decoder, so it reduces the redundancy. The experimental results also demonstrate that the proposed algorithm is effective and performs better than existing audio watermarking algorithms.

Watermarking Algorithm for Remote Sensing Images based on Ring-Shaped Template Watermark and Multiscale LCM

Identifying template watermarks under severe geometric distortions is a significant scientific problem in the current watermarking research for remote sensing images. We propose a novel watermarking algorithm that integrates the ring-shaped template watermark with the multiscale local contrast measure (LCM) method. In the embedding stage, the ring-shaped template watermark is embedded into the discrete Fourier transform (DFT) magnitude coefficients, converting the watermark into small targets in the DFT domain. During the detection stage, the multiscale LCM, a classic infrared small target detection method, enhances these small targets and generates a contrast map. Peak detection is then performed on the contrast map to determine the radius of the template watermark. Finally, circular edge local binarization is applied to extract the watermark information. The proposed method enables synchronization recovery of watermarks under blind conditions. The experimental results demonstrate that the method possesses strong robustness against various geometric attacks such as rotation, scaling, translation, and cropping. It outperforms comparative algorithms in terms of robustness and also exhibits good imperceptibility.

A Robust and Secure Medical Image Watermarking Algorithm Based on Normalized DCT and Polar-coded UFMC Assisted NOMA Scheme for Telemedicine Applications

A Robust and Secure Medical Image Watermarking Algorithm Based on Normalized DCT and Polar-coded UFMC Assisted NOMA Scheme for Telemedicine Applications

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.

Screen‐shooting resistant robust document watermarking in the Discrete Fourier Transform domain

AbstractMetaverse's augmented reality (AR) function allows virtual information to be seamlessly superimposed onto real scenes through the camera of a head‐mounted device. However, this raises concerns about privacy protection and copyright authentication when transmitting cross‐media information. Additionally, there is a risk of secret information leakage due to screen candid shooting in the real world. Ensuring information security and copyright authentication in case of unauthorized screen capturing is crucial. To prevent information loss and interference from cross‐media transfer between screens and cameras, we implement digital watermarking for copyright protection. We have proposed an innovative framework for automatic document watermarking that can resist screen‐shooting. Our approach involves embedding a ring watermark in the document underlay. On the extraction side, the watermark extraction process is divided into three key steps: automatic location, automatic correction, and automatic extraction. First, the document image is located in the covert photography. Then, perspective correction is performed based on the text line features of the document. Finally, the watermark information is extracted by combining the ring watermark features. Our method is capable of automatically extracting watermarks from covert photography while considering aspects such as concealment, robustness, and visual quality. The watermark is embedded in the document underlay, which ensures good visual quality and does not affect the normal reading and editing. We also propose various embedding strength schemes that can adapt to different usage scenarios, providing resistance to screen‐shooting or screenshot attacks, as well as various noise attacks. Through extensive experiments, we have demonstrated the feasibility of the proposed automated framework and the robustness of the watermarking algorithm, as well as the superiority and broad application prospects of our method.

A hybrid steganography and watermark algorithm for copyright protection by using multiple embedding approaches

In this modern era, it has become much simpler to replicate, sell, and copy the copyright owners' works without their permission as a result of the expansion of digitalization, and it is difficult to identify such violations, posing a threat to the creators' and copyright owners' rights. For many years, the internet has been regarded as one of the most serious threats to copyright, and the content available has varying levels of copyright protection. On the internet, there are numerous copyrighted works, including e-books, movies, news, and so on. Therefore, by using watermarking and steganography techniques, these issues can be solved, which are based on the author's signature information or logo. This paper concluded that the techniques of discrete cosine transform (DCT), discrete wavelet transform (DWT), one-time pad (OTP), and playfair are highly effective when used together to watermark an image or embed a secret message, our lab results validate that our algorithm scheme is robust against several sets of attacks, where the algorithm was assessed by computation of many evaluation metrics such as mean square error (MSE), signal-to-noise ratio (SNR), and peak signal-to-noise ratio (PSNR).

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.