Watermark Bits Research Articles

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.

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.

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.

Dual image watermarking based on NSST-LWT-DCT for color image

Advanced internet technology allows unauthorized individuals to modify and distribute digital images. Image watermarking is a popular solution for copyright protection and ensuring digital security. This research presents an embedding scheme with a set of conditions using non-subsampled Shearlet transform (NSST), lifting wavelet transform (LWT), and discrete cosine transform (DCT). Red and green channels are employed for the embedding process. The red channel is converted by NSST-LWT. The low-frequency area (LL) frequency is then split into small blocks of 8×8, each partition block is then transformed by DCT. The DCT coefficient of (3,4), (5,2), (5,3), (3,5), called matrix M1, and (2,5), (4,3), (6,2), (4,4), called matrix M2 are selected for singular value decomposition (SVD) process. With a set of conditions, the watermark bits are incorporated into those singular values. The green channel is cropped to get the center image before splitting into 4×4 pixels. The block components are then selected based on the least entropy value for the embedding regions. The selected blocks are then computed using LWT-SVD. A set of conditions for U(1,1) and U(2,1) are used to incorporate the watermark logo. The experimental findings reveal that the suggested scheme achieves high imperceptibility and resilience under various evaluating attacks with an average peak signal-to-noise ratio (PSNR) and correlation value (NC) values are up to 43.89 dB and 0.96, respectively.

Levenberg–Marquardt deep neural watermarking for 3D mesh using nearest centroid salient point learning

Watermarking is one of the crucial techniques in the domain of information security, preventing the exploitation of 3D Mesh models in the era of Internet. In 3D Mesh watermark embedding, moderately perturbing the vertices is commonly required to retain them in certain pre-arranged relationship with their neighboring vertices. This paper proposes a novel watermarking authentication method, called Nearest Centroid Discrete Gaussian and Levenberg–Marquardt (NCDG–LV), for distortion detection and recovery using salient point detection. In this method, the salient points are selected using the Nearest Centroid and Discrete Gaussian Geometric (NC–DGG) salient point detection model. Map segmentation is applied to the 3D Mesh model to segment into distinct sub regions according to the selected salient points. Finally, the watermark is embedded by employing the Multi-function Barycenter into each spatially selected and segmented region. In the extraction process, the embedded 3D Mesh image is extracted from each re-segmented region by means of Levenberg–Marquardt Deep Neural Network Watermark Extraction. In the authentication stage, watermark bits are extracted by analyzing the geometry via Levenberg–Marquardt back-propagation. Based on a performance evaluation, the proposed method exhibits high imperceptibility and tolerance against attacks, such as smoothing, cropping, translation, and rotation. The experimental results further demonstrate that the proposed method is superior in terms of salient point detection time, distortion rate, true positive rate, peak signal to noise ratio, bit error rate, and root mean square error compared to the state-of-the-art methods.

A Novel Watermarking Scheme for Audio Data Stored in Third Party Servers

To improve the security and privacy of audio data stored in third party servers, a novel watermarking scheme is proposed. Firstly, the authors split the host signal into frames and scramble each frame to get the encrypted signal. Secondly, they generate watermark bits by using the frame number and embed them into each frame of the encrypted signal, which is the data that will be uploaded to the third party servers. For the users, they can download the encrypted data and verify the data is intact or not. If the data is intact, the users decrypt the data to get the audio signal. If the audio signal is attacked in the process of transmission, they can also locate the location of the attacked frame. The experimental results show that the method proposed is effective not only for encrypted signals, but also for the encrypted signals after decryption.

Robust Watermarking Algorithm for Building Information Modeling Based on Element Perturbation and Invisible Characters

With the increasing ease of building information modeling data usage, digital watermarking technology has become increasingly crucial for BIM data copyright protection. In response to the problem that existing robust watermarking methods mainly focus on BIM exchange formats and cannot adapt to BIM data, a novel watermarking algorithm specifically designed for BIM data, which combines element perturbation and invisible character embedding, is proposed. The proposed algorithm first calculates the centroid of the enclosing box to locate the elements, and establishes a synchronous relationship between the element coordinates and the watermarked bits using a mapping mechanism, by which the watermarking robustness is effectively enhanced. Taking into consideration both data availability and the need for watermark invisibility, the algorithm classifies the BIM elements based on their mobility, and perturbs the movable elements while embedding invisible characters within the attributes of the immovable elements. Then, the watermark information after dislocation is embedded into the data. We use building model and structural model BIM data to carry out the experiments, and the results demonstrate that the signal-to-noise ratio and peak signal-to-noise ratio before and after watermark embedding are both greater than 100 dB. In addition, the increased information redundancy accounts for less than 0.15% of the original data., which means watermark embedding has very little impact on the original data. Additionally, the NC coefficient of watermark extraction is higher than 0.85 when facing attacks such as translation, element addition, element deletion, and geometry–property separation. These findings indicate a high level of imperceptibility and robustness offered by the algorithm. In conclusion, the robust watermarking algorithm for BIM data fulfills the practical requirements and provides a feasible solution for protecting the copyright of BIM data.

Self-embedding reversible color-to-grayscale conversion with watermarking feature

This paper presents a self-embedding reversible color-to-grayscale conversion (RCGC) algorithm that makes good use of deep learning, vector quantization, and halftoning techniques to achieve its goals. By decoupling the luminance information of a pixel from its chrominance information, it explicitly controls the luminance error of both the conversion outputs and their corresponding reconstructed color images. It can also alleviate the burden of the deep learning network used to restore the embedded chrominance information during the reconstruction of the color image. Luminance-guided chrominance quantization and checkerboard-based halftoning are introduced in the paper to encode the chrominance information to be embedded while reference-guided inverse halftoning is proposed to restore the color image. Simulation results verify that its performance is remarkably superior to conventional state-of-art RCGC algorithms in various measures. In the aspect of authentication, embedding the watermark and chrominance information is realized with context-based pixel-wise encryption and a key-based watermark bit positioning mechanism, which makes us possible to locate tampered regions and prevent unauthorized use of the chrominance information.

A Robust Integrated Watermarking Algorithm for Vector Geographic Data Copyright Protection

Vector geographic data play an important role in the natural resources and environment sector as well as in other location information services. This is also one of the types of data where the cost to create it is relatively large because of the difficulty in surveying, collecting, and authorizing. The rapid development of the Internet has created many advantages in the distribution, exploitation, and use of vector geographic data, but it also gives rise to many problems such as duplication, redistribution, forgery, and illegal data use. The theft on the Internet is becoming more and more sophisticated and the number of violations is increasing, showing the urgent need to research and develop an effective solution to protect the copyright of vector geographic data and prevent them from being illegally collected and used. Among the major studies and solutions, digital watermarking emerges as an effective method and is an active research area for copyright protection. Towards a good solution for copyright protection of vector geographic data, our study proposes a new algorithm with three main contributions, including: (1) generating short, pseudo-random meaningful watermarks to in-crease robustness and to enable automated as well as visual manual verifying; (2) building a uniformly distributed mapping between the vertex coordinates and the watermark bit indexes to increase the robustness of the watermarks; and (3) integrating two types of watermarks, namely, spatial domain-based watermarking and zero-watermarking to be resistant to most common attacks on geographic vector data. The algorithm works on all types of vector geographic data, including points, polylines, and polygons.

A blind color image watermarking algorithm based on Hadamard transform and TLBO algorithm

For the sake of better protect the copyright of color images, an efficient color image watermarking algorithm based on Hadamard transform and teaching-learning-based optimization (TLBO) algorithm is proposed in this paper. In the stage of embedding watermark, different watermark embedding strategies are employed in 4 × 4 blocks based on the impact level of pixel caused by the high and low bit of watermark and taking into account the energy concentration characteristics of the Hadamard matrix. To enhance the robustness of the watermarking algorithm, the voting system is designed for the high-four bits of watermark information. Simultaneously, the permutation ordered binary (POB) number system is used to compress the low-four bits of watermark information for improving the invisibility of the watermarked image and the embedding capacity. When the watermark needs to be extracted, the inverse process of POB number system transform is optimized, and the time of watermark extraction is shortened. Finally, the TLBO algorithm is used to optimize the watermarking algorithm parameters for saving the experimental time while considering both invisibility and robustness of the algorithm. In comparison to the other algorithms examined in this research, the experimental results demonstrate that the proposed watermarking algorithm exhibits several performance enhancements, these include aspects such as robustness, running time, watermark embedding capacity, security and invisibility.

Robust image watermarking in DCT domain using optimal inter‐block difference

SummaryRobust watermarking provides valuable solutions to protect the copyright and secure digital images. In this paper, a robust and transparent watermarking scheme in the discrete cosine transform (DCT) domain is presented. The watermark is embedded into the difference of two adjacent DCT coefficients located at the same frequency. The embedding process involves optimal selection of adjacent blocks and DCT coefficients positions. For a given DCT block, the optimal selection is to find the coefficient with the lowest DCT frequency that requires the minimal variation to represent the target watermark bit. To insert the watermark, a new quantization index modulation (QIM) based method with irregular distance between continuous quantizers is employed. The performance of the proposed scheme was extensively evaluated using 12 benchmark images and a total of more than 90 attacks per image grouped into nine attack types including JPEG compression, filtering and noise contamination. Furthermore, robustness comparison with state‐of‐the‐art works was conducted, and the results demonstrate the superiority of the proposed scheme in terms of imperceptibility and robustness.

A secure framework for medical image by integrating watermarking and encryption through fuzzy based ROI selection

Security, secrecy, and authenticity problems have arisen as a result of the widespread sharing of medical images in social media. Copyright protection for online photo sharing is becoming a must. In this research, a cutting-edge method for embedding encrypted watermarks into medical images is proposed. The proposed method makes use of fuzzy-based ROI selection and wavelet-transformation to accomplish this. In the first step of the process, a fuzzy search is performed on the original picture to locate relevant places using the center region of interest (RoI) and the radial line along the final intensity. The suggested method takes a digital picture and divides it into 4×4 non-overlapping blocks, with the intent of selecting low information chunks for embedding in order to maximize invisibility. By changing the coefficients, a single watermark bit may be inserted into both the left and right singular SVD matrices. The absence of false positives means the suggested technique can successfully integrate a large amount of data. Watermarks are encrypted using a pseudorandom key before being embedded. Discrete wavelet transform saliency map, block mean method, and cosine functions are used to construct an adaptively-generated pseudo-random key from the cover picture. Images uploaded to social media platforms must have a high degree of invisibility and durability. These watermarking features, however, come with a price. The optimal scaling factor is used to strike a balance between the two in the proposed system. Furthermore, the suggested scheme’s higher performance is confirmed by comparison with the latest state-of-the-art systems.

RBWCI: Robust and Blind Watermarking Framework for Cultural Images

Heritage multimedia, which comprises images, audio, and videos, are precious artifacts of a region. In addition to enabling a better understanding of earlier generations, heritage media provides information about their creative approach, style of living, and diversity of historical and archaeological ideologies. Heritage is an important resource that boosts the local economy, generates sustainable communities, and improves tourism and business sectors. Once heritage images are dissipated to consumers, they may be transmitted through wire/wireless systems, where the data may be accessed by both authorized and unauthorized consumers. With the rapid advancement of technology and 5G networks, establishing an approach that protects cultural heritage media from unauthorized consumers is necessary. This study presents a robust and blind watermarking-framework for cultural images (RBWCI) utilizing the discrete cosine transform domain for ownership verification and copyright protection. The embedding scenario of our technique relies on the difference between coefficients obtained from the two channels of the YCbCr color model. The watermark bit is embedded by taking the difference between two preselected mid-frequency coefficients (Cb-Cr). Moreover, chaotic and deoxyribonucleic acid encryption are employed to ensure double-layer watermark security. The proposed algorithm demonstrates a peak signal-to-noise ratio between 42-43 dB and structural similarity index metric value of approximately 1 for different test images when not under attack. The robustness of the RBWCI was revealed by comparing it with various state-of-the-art schemes, making it suitable for different consumer applications.

Robust reversible image watermarking scheme based on spread spectrum

Robust reversible watermarking can provide robustness against various attacks besides the ability to recover the cover image. However, robustness and reversibility are somewhat separate in many schemes. The original cover image cannot be recovered even if the watermarked image suffers from a tiny distortion. This paper presents a new robust reversible watermarking scheme by exploring the reversibility of spread-spectrum codes. Watermark bits are embedded by a suggested adaptive spread-spectrum code. The embedding amplitude used in the algorithms is determined by quantizing the source interference of the cover. The proposed scheme is robust to various attacks. Furthermore, since the embedding amplitude is available at the receiver, the original image can be recovered losslessly when there is no attack. Even in the presence of attacks, the original cover images can still be partially recovered. Experimental results demonstrate that the proposed scheme performs well on robustness and watermarked image quality, and provide extra reversibility that resists image distortions.

A Fragile Image Watermarking Scheme in DWT Domain Using Chaotic Sequences and Error-Correcting Codes.

With the rapid development of digital signal processing tools, image contents can be easily manipulated or maliciously tampered with. Fragile watermarking has been largely used for content authentication purposes. This article presents a new proposal for image fragile watermarking algorithms for tamper detection and image recovery. The watermarked bits are obtained from the parity bits of an error-correcting code whose message is formed from a binary chaotic sequence (generated from a secret key known to all legitimate users) and from bits of the original image. Part of the codeword (the chaotic bits) is perfectly known to these users during the extraction phase, adding security and robustness to the watermarking method. The watermarked bits are inserted at specific sub-bands of the discrete wavelet transform of the original image and are used as authentication bits for the tamper detection process. The imperceptibility, detection, and recovery of this algorithm are tested for various common attacks over digital images. The proposed algorithm is analyzed for both grayscale and colored images. Comparison results reveal that the proposed technique performs better than some existing methods.

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.

Secure map legends based on just noticeable distortion and watermark bit recovery

Secure map legends based on just noticeable distortion and watermark bit recovery

DNN-based speech watermarking resistant to desynchronization attacks

Desynchronization attacks proved to be the greatest challenge to audio watermarking systems as they introduce misalignment between the signal carrier and the watermark. This paper proposes a DNN-based speech watermarking system with two adversarial networks jointly trained on a set of desynchronization attacks to embed a randomly generated watermark. The detector neural network is expanded with spatial pyramid pooling layers to be able to handle signals affected by these attacks. A detailed training procedure of the aforementioned DNN system with gradual attack introduction is proposed in order to achieve robustness. Experiments performed on a speech dataset show that the system achieves satisfactory results according to all the benchmarks it was tested against. The system preserves signal quality after watermark embedding. Most importantly, the system achieved resistance to all considered desynchronization attacks. The majority of the attacks cause less than [Formula: see text]% of incorrectly detected watermarked bits on average, which outperforms comparative techniques in this regard.

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.

Survey on Relational Database Watermarking Employing Evolutionary Methods

Ownership control, integrity, and tamper-proofing of relational data are essential concerns that must be addressed as the communication (network) system grows. Over the past several years, a plethora of potential solutions has been proposed to address these issues (including cryptography, steganography, digital signatures, watermarks, and many others). Digital watermarking (comparatively new) is a technology that aids in the resolution of issues such as data theft, authenticity, and copyright claims. This paper’s primary contributions are as follows: 1) Examine evolutionary algorithm-based watermarking in relational databases that provide optimize data encoding space in search space which provides high robustness and imperceptibility. 2) Examine contemporary database watermarking strategies based on evolutionary algorithms for high embedding capacity and watermark bit insertion. 3) Malicious agent tracing through cluster-based (mainly fuzzy c-mean clustering algorithm or based on a hash function) or multiple watermarking approaches over shared or collaborative networks. This article focuses on watermarking numeric relational databases for authentication and integrity. Also provide a brief overview of the development of relational database watermarking and emergence, its characteristics and application, and the popular research methods currently in use. In addition, gist on various possible attacks. At last, this paper suggests directions for further research in these areas. Researchers can use the findings of this study to build secure watermarking methods for databases.