An Imperceptible Watermarking Scheme for Medical Images Tamper Detection

One of the important issues in telemedicine field refers to an advanced secure communication. Digital image watermarking is an ideal solution since it protects the electronic patient information’s from unauthorized access. This paper presents a novel blind fragile-based image watermarking scheme in spatial domain that merges Speed Up Robust Features (SURF) descriptor with the well-known Weber Descriptors (WDs) and Arnold algorithm. It provides a good way for enhancing the image quality and time complexity for medical data integrity. Firstly, the watermark image is shuffled using Arnold chaotic map. Secondly, the SURF technique is practiced to Region of Interest (ROI) of the medical image and then the blocks around the SURF points are selected to insert the watermark. Finally, the watermark is encrusted and extracted using WDs. Experimental results show good image fidelity with the shortest execution time to ensure medical images integrity.

An Improved Medical Image Watermarking Technique Based on Weber’s Law Descriptors

In distributed m-health communication, it is a major challenge to develop an efficient blind watermarking method to protect the confidential medical data of patients. This paper proposes an efficient blind watermarking for medical images, which boasts a very high embedding capacity, a good robustness, and a strong imperceptibility. Three techniques, namely, discrete cosine transform (DCT), Weber’s descriptors (WDs), and Arnold chaotic map, were integrated to our method. Specifically, the Arnold chaotic map was used to scramble the watermark image. Then, the medical image was partitioned into non-over lapping blocks, and each block was subjected to DCT. After that, the scrambled watermark image data were embedded in the middle-band DCT coefficients of each block, such that two bits were embedded in each block. Simulation results show that the proposed watermarking method provides better imperceptibility, robustness, and computational complexity results with higher embedding capacity than the contrastive method.

Intelligent High Payload Audio Watermarking Algorithm Using Colour Image in DWT-SVD Domain

Copyright protection and ownership verification of digital audio tracks have become increasingly important to be enabled by digital watermarking techniques. A novel high payload intelligent audio watermarking scheme with RGB color watermark image is proposed in this paper. The color watermark image is encrypted using Arnold chaotic map and passed through an adaptive scaling filter to scale the image to match the required payload. The encoding process is performed on the scaled encrypted version of the watermark image. A portion of the audio signal is used to embed a synchronization code and the other one is decomposed into short frames. These frames are processed with a two-level discrete wavelet transform (DWT), followed by a singular value decomposition (SVD) process on the approximation coefficients. The encoded watermark is inserted into the diagonal matrix using quantization index modulation (QIM). The inverse process of SVD and DWT is applied to obtain the marked audio signal. Blind extraction of the hidden information from the marked audio signal is performed in the reverse order of the embedding process. Experiments show that security, high payload, transparency and imperceptibility of the algorithm are satisfied. The robustness against several kinds of audio signal processing attacks is shown. Performance evaluation tests with SNR, BER, and FSIM are conducted.

A Novel Invariant Based Commutative Encryption and Watermarking Algorithm for Vector Maps

Commutative encryption and watermarking (CEW) is an emerging method that combines encryption technology with digital watermarking technology. It has the dual capability of secure transmission and copyright protection. However, the existing CEW methods for vector maps have good robustness in resisting geometric attacks but poor resistance to vertex attacks (e.g., addition, deletion, etc.). To solve this problem, here we propose a novel invariant-based CEW algorithm for vector maps, which consists of permutation-based encryption scheme and coordinates-based watermarking scheme. In the encryption scheme, the encryption key is generated via the Gaussian distribution method combined with the SHA-512 hash method; then, the double random position permutation strategy is applied to the vector map encryption. In watermarking embedding scheme, the original watermark image is scrambled via logistic chaotic encryption before embedding, and the coordinates of all the vertices are normalized. Then, the scrambled watermark image is embedded into the normalized coordinates. Results show that: proposed method is more robust to conventional attacks (e.g., vertex addition and deletion, reordering and data format conversion) and geometric attacks (e.g., scaling and translation). In addition, compared with the existing CEW methods for vector maps, the proposed method has higher security and stronger robustness against vertex attacks.

Robust and Secure Watermarking for Propagation of Digital Multimedia by Paillier Homomorphic Cryptosystem With Arnold Transformation

Sharing of digital media over internet is becoming easier due to content authentication and security provided by digital watermarking. It also locates application in other fields like copyright protection, tele-medicine, military, tamper detection, and many more. This paper represents the robust watermarking approach using Paillier homomorphic cryptosystem with Arnold transformation. In this, the watermarking system is primarily prepared at an encrypted DWT-DCT domain. Cryptosystem is exploited at this time to encrypt the original media. For more security of multimedia content, the watermark image is scrambled through Arnold scrambling technique. The embedding process is done here to produce the encrypted watermark image followed by the encryption process. At recovery phase, decryption of encrypted watermark image to get the original and watermark image is done. The experimental result has shown that watermarking method is more robust and offers the security of digital media.

Robust Watermarking Method using QIM with VSS for Image Copyright Protection

This paper proposes a new watermarking method for digital image by composing the DWT-QIM based embedding with visual secret sharing (VSS) method. Firstly, the watermark image is separated into $n$ shares by using the $k-out-of-n$ method, called $(k,n)$ visual secret sharing. One of share is employed in order to embed into the original image for copyright protection. Another $(n-1)$ of shares are registered with Vietnam Copyright Department. When the dispute happens, the verifier can extract the watermark information from the watermarked image, then, decode it with $(k-1)$ shares chosen from $(n-1)$ shares to achieve the copyright information. Our experimental results show that our proposed method works efficiently on the digital images.

Consideration of A Robust Watermarking Algorithm for Color Image Using Improved QR Decomposition

In order to protect the color image copyright protection of the digital multimedia, it is necessary to design a color image watermarking algorithm. To achieve this purpose, an improved color image watermarking scheme based on QR decomposition for color image matrix is proposed in this paper. The proposed method gives a new algorithm to find elements of Q and R matrices instead of using Gram-Schmidt algorithm for QR factorization. First, R matrix is performed by solving a set of linear equations where diagonal elements of R are checked and modified if they are zero or negative. After that, Q matrix is computed based on R matrix. In addition, a novel formula is proposed to improve extracting time where the first element R(1,1) of R matrix is found instead of computing QR decomposition as the previous proposals. Experimental results show that the proposed method outperforms other methods considered in this paper in term of the quality of the watermarked images and the robustness of embedding method. Furthermore, the execution time is significantly improved and the watermark image is more robust under some tested attacks.

Image Authentication Using Block Truncation Coding in Lifting Wavelet Domain

Image watermarking is one of the most accepted solutions protecting image authenticity. The method presented in this paper not only provides the desired outcome also efficient in terms of memory requirements and preserving image characteristics. This scheme effectively utilizes the concepts of block truncation coding (BTC) and lifting wavelet transform (LWT). The BTC method is applied to observe the binary watermark image corresponding to its gray-scale image. Whereas, the LWT is incorporated to transform the cover image from spatial coordinates to corresponding transform coordinates. In this, a quantization-based approach for watermark bit embedding is applied. And, the extraction of binary watermark data from the attacked watermarked image is based on adaptive thresholding. To show the effectiveness of the proposed scheme, the experiment over different benchmark images is performed. The experimental results and the comparison with state-of-the-art schemes depict not only the good imperceptibility but also high robustness against various attacks.

Robust Digital Image Watermarking in YCbCr Color Space using Hybrid Method

The image watermarking is widely used to provide the security. This paper provides the conceptual framework on image watermarking which is widely used for security purpose within the epoch of data and communication technology. Detailed discuss has been provided on the basis of the three phases. In the first phase of present paper focus has been made on image watermarking and data set will be prepared on which watermarking technique will be executed. Second phase need to locate a specific watermarking technique [LWT- WALSH HADMARD-SVD] which will provide appropriate results in term of PSNR and processing time. In second phase various attacks will be tested on images so that implemented method must stand against various attacks. Last phase emphasise on reverse process will be executed to extract cover and watermark image. Proposed technique is based on the secure encryption watermark .It is associated with image encryption. The encryption algorithm had been introduced in which watermarking information was based on the size of an image. It is clear from the outcomes of the hybrid proposed technique shows that it provides more security than the existing technique. Proposed techniques provide high level of security as compared to existed technology.

An Adaptive Visible Watermark Embedding Method based on Region Selection

Aiming at the problem that the robustness, visibility, and transparency of the existing visible watermarking technologies are difficult to achieve a balance, this paper proposes an adaptive embedding method for visible watermarking. Firstly, the salient region of the host image is detected based on superpixel detection. Secondly, the flat region with relatively low complexity is selected as the embedding region in the nonsalient region of the host image. Then, the watermarking strength is adaptively calculated by considering the gray distribution and image texture complexity of the embedding region. Finally, the visible watermark image is adaptively embedded into the host image with slight adjustment by just noticeable difference (JND) coefficient. The experimental results show that our proposed method improves the robustness of visible watermarking technology and greatly reduces the risk of malicious removal of visible watermark image. Meanwhile, a good balance between the visibility and transparency of the visible watermark image is achieved, which has the advantages of high security and ideal visual effect.