Dual Scrambled Image Watermarking Algorithm in DWT-SVD Composite Domain

2017 ◽  
pp. 30-42 ◽  
Author(s):  
Dharm Singh ◽  
Madhuri Agarwal ◽  
Charu Singh
Keyword(s):  
Performance Analysis ◽  
Copyright Protection ◽  
Image Watermarking ◽  
Singular Values ◽  
Extraction Process ◽  
Scaling Factor ◽  
Multimedia Data ◽  
Copyright Violation ◽  
Increased Risk ◽  
Security Levels

There is an increased risk of copyright violation of multimedia data due to the enormous growth of computer networks that provides fast and error free transmission of any multimedia information. A copyright identifier that may contain some information about the lawful owner is inserted in the contents of the image, without sacrificing its quality. The security levels are increased by using a key value and scaling factor for the embedding and extraction process. The dual scrambled watermark using Arnold and Scrambling sequence is embedded by modifying the singular values of the scrambled cover image's DWT middle frequency sub-band. The simulation was performed on MATLAB 7.7.0 with standard database gray scale images of size 512x512 and watermark of size 64x64 using hybrid dual scrambled watermark schemes. The performance analysis is done on the basis of the degree of scrambling and JPEG compression attack using various parameters. The proposed method achieves better imperceptibility and security for the copyright protection methods.

scholarly journals SVD-Based Image Watermarking Using the Fast Walsh-Hadamard Transform, Key Mapping, and Coefficient Ordering for Ownership Protection

Symmetry ◽  
2019 ◽  
Vol 12 (1) ◽  
pp. 52 ◽  
Author(s):  
Tahmina Khanam ◽  
Pranab Kumar Dhar ◽  
Saki Kowsar ◽  
Jong-Myon Kim
Keyword(s):  
State Of The Art ◽  
Image Watermarking ◽  
Singular Values ◽  
Multimedia Data ◽  
Cover Image ◽  
Hadamard Transform ◽  
Art Methods ◽  
Walsh Hadamard Transform ◽  
Value Decomposition ◽  
Ownership Protection

Proof of ownership on multimedia data exposes users to significant threats due to a myriad of transmission channel attacks over distributed computing infrastructures. In order to address this problem, in this paper, an efficient blind symmetric image watermarking method using singular value decomposition (SVD) and the fast Walsh-Hadamard transform (FWHT) is proposed for ownership protection. Initially, Gaussian mapping is used to scramble the watermark image and secure the system against unauthorized detection. Then, FWHT with coefficient ordering is applied to the cover image. To make the embedding process robust and secure against severe attacks, two unique keys are generated from the singular values of the FWHT blocks of the cover image, which are kept by the owner only. Finally, the generated keys are used to extract the watermark and verify the ownership. The simulation result demonstrates that our proposed scheme is highly robust against numerous attacks. Furthermore, comparative analysis corroborates its superiority among other state-of-the-art methods. The NC of the proposed method is numerically one, and the PSNR resides from 49.78 to 52.64. In contrast, the NC of the state-of-the-art methods varies from 0.7991 to 0.9999, while the PSNR exists in the range between 39.4428 and 54.2599.

scholarly journals An Efficient Image Watermarking System Based on Error Correcting Codes in DCT Domain

1970 ◽  
Vol 3 ◽  
Author(s):  
Pranab Kumar Dhar ◽  
Mohammad Ibrahim Khan ◽  
Sujan Chowdhury
Keyword(s):  
Digital Watermarking ◽  
Copyright Protection ◽  
Image Watermarking ◽  
Binary Sequence ◽  
Block Codes ◽  
Error Correcting Codes ◽  
Multimedia Data ◽  
Storage Unit ◽  
Dct Domain ◽  
Linear Block

Digital watermarking has drawn extensive attention for copyright protection of multimedia data. This paper proposes a new watermarking system for digital images using efficient systematic linear block codes (SLBC) in discrete cosine transform (DCT) domain. The proposed watermarking system using SLBC generates a code sequence of {0, 1} that provides error correction capabilities and then replaces it with a binary watermark sequence of {-1, 1}. This achieves more robust invisible image watermarks and requires a small storage unit for binary sequence numbers. The generated watermark sequence is then used as an input for our proposed watermarking system which consists of watermark embedding process and watermark detection process. Experimental results indicate that the invisible watermark embedded with the proposed system are very robust against various kinds of attacks such as white Gaussian noise, JPEG compression, median, and mean filtering, by showing similarity values ranging from 0.7 to 0.8. KEY WORDS: Digital Watermarking; Linear Block Code; Copyright Protection. DOI: http://dx.doi.org/10.3329/mist.v3i0.8056

scholarly journals A Robust Digital Image Watermarking in Hybrid Frequency Domain

2018 ◽  
Vol 7 (3.6) ◽  
pp. 243 ◽  
Author(s):  
P Sridhar ◽  
. .
Keyword(s):  
Signal Processing ◽  
Image Watermarking ◽  
Singular Values ◽  
Scaling Factor ◽  
Discrete Wavelet ◽  
Geometric Attacks ◽  
Host Image ◽  
Hybrid Frequency ◽  
Left And Right ◽  
Block Based

Image watermarking is a method to hide the secret information in a host image for copyright protection of watermark data during the transmission by means of insecure channel. The proposed scheme protects our data with adaptive level of visual quality and robustness against signal processing and geometric attacks. The proposed method divides the host image into four non-overlapping segments labelled as sub-images, DWT is applied on each sub images and then block based DCT is applied on mid frequency channels LH and HL of discrete wavelet transform. Embedded matrix is formed using hybrid transformed coefficients where matrix elements are chosen from the localized two mid frequency coefficients of each block in DCT. SV Decomposition is applied on embedded matrix to factorize it into singular values, left and right singular vectors and embed the scrambled watermark image along with scaling factor in singular value matrix. This repetition of watermark data in each sub-image reduces the PSNR values of the watermarked image. Despite this proposed scheme scales down PSNR value, changing the scaling factor favours to adjust the PSNR to the acceptable level and withstand the signal processing attacks such as JPEG compression and geometrical attack such as rotation, translation. Compared to the other method, the proposed scheme gives better correlation coefficient value for above mentioned kinds of attacks and also provide adaptive PSNR for imperceptibility on watermarked image.  

A SVD and Modified Firefly Optimization Based Robust Digital Image Watermarking Technique

2017 ◽  
Vol 7 (7) ◽  
pp. 268
Author(s):  
Chauhan Usha ◽  
Singh Rajeev Kumar
Keyword(s):  
Digital Media ◽  
Firefly Algorithm ◽  
Image Watermarking ◽  
Singular Values ◽  
Robust Watermarking ◽  
Scaling Factors ◽  
Geometric Attacks ◽  
Host Image ◽  
Firefly Optimization ◽  
Value Decomposition

Digital Watermarking is a technology, to facilitate the authentication, copyright protection and Security of digital media. The objective of developing a robust watermarking technique is to incorporate the maximum possible robustness without compromising with the transparency. Singular Value Decomposition (SVD) using Firefly Algorithm provides this objective of an optimal robust watermarking technique. Multiple scaling factors are used to embed the watermark image into the host by multiplying these scaling factors with the Singular Values (SV) of the host image. Firefly Algorithm is used to optimize the modified host image to achieve the highest possible robustness and transparency. This approach can significantly increase the quality of watermarked image and provide more robustness to the embedded watermark against various attacks such as noise, geometric attacks, filtering attacks etc.

A DCT-Domain System for Digital Watermarking

2013 ◽  
Vol 321-324 ◽  
pp. 2609-2612
Author(s):  
Yan Liang ◽  
Gao Yan ◽  
Chun Xia Qi
Keyword(s):  
Signal Processing ◽  
Digital Watermarking ◽  
Copyright Protection ◽  
Random Sequence ◽  
Multimedia Data ◽  
Dct Domain ◽  
Digital Document ◽  
Dct Coefficients ◽  
Processing Techniques ◽  
Signal Processing Techniques

Digital watermarking has been proposed as a solution to the problem of copyright protection of multimedia data in a networked environment. It makes possible to tightly associated to a digital document a code allowing the identification of the data creator, owner, authorized consumer, and so on. In this paper a new DCT-domain system for digital watermarking algorithm for digital images is presented: the method, which operates in the frequency domain, embeds a pseudo-random sequence of scrambled image in a selected set of DCT coefficients. After embedding, the watermark is adapted to the image by exploiting the masking characteristics of the human visual system, thus ensuring the watermark invisibility. By exploiting the statistical properties of the embedded sequence, the mark can be reliably extracted without resorting to the original uncorrupted image. Experimental results demonstrate that the watermark is robust to several signal processing techniques, including JPEG compression, cut, fuzzy, addition of noise, and sharpen.

Quantum color image watermarking based on fast bit-plane scramble and dual embedded

2018 ◽  
Vol 16 (07) ◽  
pp. 1850060 ◽  
Author(s):  
Ri-Gui Zhou ◽  
Peng Liu Yang ◽  
Xing Ao Liu ◽  
Hou Ian
Keyword(s):  
Nearest Neighbor ◽  
Color Image ◽  
Interpolation Method ◽  
Image Watermarking ◽  
Extraction Process ◽  
Watermark Image ◽  
Color Image Watermarking ◽  
Encryption Algorithms ◽  
Bit Plane ◽  
Watermarking Scheme

Most of the studied quantum encryption algorithms are based on square images. In this paper, based on the improved novel quantum representation of color digital images model (INCQI), a quantum color image watermarking scheme is proposed. First, INCQI improved from NCQI is used to represent the carrier and watermark images with the size [Formula: see text] and [Formula: see text], respectively. Secondly, before embedding, the watermarking needs to be preprocessed. That is, the watermark image with the size of [Formula: see text] with 24-qubits color information is disordered by the fast bit-plane scramble algorithm, and then further expanded to an image with the size [Formula: see text] with 6-qubits pixel information by the nearest-neighbor interpolation method. Finally, the dual embedded algorithm is executed and a key image with 3-qubits information is generated for retrieving the original watermark image. The extraction process of the watermark image is the inverse process of its embedding, including inverse embedding, inverse expand and inverse scrambling operations. To show that our method has a better performance in visual quality and histogram graph, a simulation of different carrier and watermark images are conducted on the classical computer’s MATLAB.

Sign in / Sign up

Export Citation Format

Share Document