A robust watermarking scheme based on image normalization
09 Mar 2018-pp 140-144
TL;DR: A new image watermarking framework for copyright protection is presented using image normalization, singular value decomposition (SVD) and dynamic stochastic resonance (DSR) to improve the robustness of the system.
Abstract: In this paper, a new image watermarking framework for copyright protection is presented using image normalization, singular value decomposition (SVD) and dynamic stochastic resonance (DSR). The image is first normalized using the geometric moments and then an ownership message is embedded by employing the singular value decomposition. Finally, a reliable extraction process based on dynamic stochastic resonance is proposed. The DSR phenomenon helps in the extraction of the watermark information and improves the robustness of the system. A sequence of experiments and analysis are regulated to verify the effectiveness and the higher degree of robustness, especially for the geometric attacks.
Citations
More filters
TL;DR: A new blind image watermarking scheme using binary decimal sequence (d-sequence) and lifting wavelet transform (LWT) for copyright protection and the better robustness of the proposed scheme against different kind of attacks is demonstrated.
Abstract: This paper presents a new blind image watermarking scheme using binary decimal sequence (d-sequence) and lifting wavelet transform (LWT) for copyright protection. The core idea is to produce a d- sequence based on random number generator (RNG) algorithm and secret keys. A reference set is then generated using the d-sequence for embedding purpose. For embedding, the host image is decomposed into different frequency bands using the LWT and watermark bits are then embedded in selected band, considering the reference set. The extensive experimental results, comparative and security analysis demonstrate the better robustness of the proposed scheme against different kind of attacks.
8 citations
TL;DR: A new robust watermarking framework is designed using the discrete cosine transform (DCT), binary decimal sequence (d-sequence) and Dn-structure to generate a binary d-sequence based on random number generator (RNG) and some secret keys.
Abstract: In this paper, a new robust watermarking framework is designed using the discrete cosine transform (DCT), binary decimal sequence (d-sequence) and Dn-structure. The core idea is to generate a binary d-sequence based on random number generator (RNG) and some secret keys. This binary sequence is then utilized to generate reference sets based on Dn-structure. For embedding purpose, the host image is transformed using DCT and selected coefficients are employed to construct a macro block. Each binary watermark bit is securely embedded into macro block by utilizing the reference set. The reverse process is finally formulated to extract the watermark at the receiver end. The proposed technique is experimentally analyzed using various quality metrics and attacks. The comprehensive experimental results illustrate that the proposed watermarking scheme is robust to both geometric distortions (resizing, cropping, wrapping and random row deletion) and general signal processing attacks (various noise addition, blurring, high pass filtering, image sharpening, contrast adjustment, Histogram equalization and gamma correction and JPEG compression) and outperforms state-of-the-art watermarking methods.
6 citations
18 Dec 2018
TL;DR: A robust image hashing framework is presented using discrete cosine transformation and singular value decomposition that is resilient to different content-preserving image distortions such as geometric and filtering operations.
Abstract: In this paper, a robust image hashing framework is presented using discrete cosine transformation and singular value decomposition. Firstly, the input image is normalized using geometric moment and normalized coefficients are divided into non-overlapping blocks. The selected blocks based on a peace-wise non-linear chaotic map are transformed using discrete cosine transom followed by singular value decomposition. Then a feature matrix is constructed in reliance on Hessian matrix and the final hash values are obtained. The proposed hashing system is resilient to different content-preserving image distortions such as geometric and filtering operations. The simulated results demonstrate the efficiency proposed framework in terms of security and robustness.
3 citations
TL;DR: The two issues of art image creation and data hiding are integrated into one and solved by a single approach in this study, which proposes an automatic method for generating a new type of computer art, called stained glass image, which imitates the stained-glass window picture.
Abstract: The two issues of art image creation and data hiding are integrated into one and solved by a single approach in this study. An automatic method for generating a new type of computer art, called stained glass image, which imitates the stained-glass window picture, is proposed. The method is based on the use of a tree structure for region growing to construct the art image. Also proposed is a data hiding method which utilizes a general feature of the tree structure, namely, number of tree nodes, to encode the data to be embedded. The method can be modified for uses in three information protection applications, namely, covert communication, watermarking, and image authentication. Besides the artistic stego-image content which may distract the hacker’s attention to the hidden data, data security is also considered by randomizing both the input data and the seed locations for region growing, yielding a stego-image which is robust against the hacker’s attacks. Good experimental results proving the feasibility of the proposed methods are also included. key words: computer art, stained glass image, data hiding, region growing, covert communication, watermarking, image authentication
2 citations
Cites methods from "A robust watermarking scheme based ..."
...Furthermore, a new method for data hiding via such art images is proposed, which may be adapted to solve all the three issues of watermarking for copyright protection [13], [14], covert communication [11], [14], and image authentication [15], [16] just mentioned....
[...]
01 Jan 2020
TL;DR: A novel security framework is presented in this chapter using a combination of zero watermarking and perceptual hashing to enhance the security of medical information systems and protect medical data.
Abstract: The security of medical images carrying important patient information and is a challenging issue when images are transmitted across public channels. These images are often faced with various kinds of intentional and unintentional attacks during the transmission process. To enhance the security of medical information systems and protect medical data, a novel security framework is presented in this chapter using a combination of zero watermarking and perceptual hashing. First, robust invariant features are extracted from the medical image using scale invariant feature transform and discrete cosine transform followed by a quantization process to generate the hash sequence. Finally, an encrypted watermark is used in the construction of a digital signature corresponding to the original medical images. Simulation results demonstrate that the proposed technique has greater influence on robustness against conventional attacks as well as geometric attacks.
2 citations
References
More filters
Book•
[...]
01 Jan 2008
TL;DR: In this article, a theoretical approach based on linear response theory (LRT) is described, and two new forms of stochastic resonance, predicted on the basis of LRT and subsequently observed in analogue electronic experiments, are described.
Abstract: Stochastic resonance (SR) - a counter-intuitive phenomenon in which the signal due to a weak periodic force in a nonlinear system can be {\it enhanced} by the addition of external noise - is reviewed A theoretical approach based on linear response theory (LRT) is described It is pointed out that, although the LRT theory of SR is by definition restricted to the small signal limit, it possesses substantial advantages in terms of simplicity, generality and predictive power The application of LRT to overdamped motion in a bistable potential, the most commonly studied form of SR, is outlined Two new forms of SR, predicted on the basis of LRT and subsequently observed in analogue electronic experiments, are described
2,403 citations
Book•
31 Dec 1999
TL;DR: This first comprehensive survey of steganography and watermarking and their application to modern communications and multimedia and an overview of "steganalysis," methods which can be used to break steganographic communication are discussed.
Abstract: From the Publisher:
Steganography, a means by which two or more parties may communicate using "invisible" or "subliminal" communication, and watermarking, a means of hiding copyright data in images, are becoming necessary components of commercial multimedia applications that are subject to illegal use. This new book is the first comprehensive survey of steganography and watermarking and their application to modern communications and multimedia.
Handbook of Information Hiding: Steganography and Watermarking helps you understand steganography, the history of this previously neglected element of cryptography, the hurdles of international law on strong cryptographic techniques, a description of possible applications, and a survey of the methods you can use to hide information in modern media. Included in this discussion is an overview of "steganalysis," methods which can be used to break steganographic communication.
This comprehensive resource also includes an introduction to and survey of watermarking methods, and discusses this method's similarities and differences to steganography. You gain a working knowledge of watermarking's pros and cons, and you learn the legal implications of watermarking and copyright issues on the Internet.
1,732 citations
TL;DR: A novel watermarking algorithm based on singular value decomposition (SVD) is proposed and results show that the newwatermarking method performs well in both security and robustness.
Abstract: Digital watermarking has been proposed as a solution to the problem of copyright protection of multimedia documents in networked environments. There are two important issues that watermarking algorithms need to address. First, watermarking schemes are required to provide trustworthy evidence for protecting rightful ownership. Second, good watermarking schemes should satisfy the requirement of robustness and resist distortions due to common image manipulations (such as filtering, compression, etc.). In this paper, we propose a novel watermarking algorithm based on singular value decomposition (SVD). Analysis and experimental results show that the new watermarking method performs well in both security and robustness.
978 citations
"A robust watermarking scheme based ..." refers methods in this paper
...A new decomposition namely singular value decomposition is proposed and combined with the various existing transforms for the watermark embedding [5]–[7]....
[...]
TL;DR: In this article, singular value decomposition (SVD) and pseudoinverse techniques are used for image restoration in space-variant point spread functions (SVPSF).
Abstract: The use of singular value decomposition (SVD) techniques in digital image processing is of considerable interest for those facilities with large computing power and stringent imaging requirements. The SVD methods are useful for image as well as quite general point spread function (impulse response) representations. The methods represent simple extensions of the theory of linear filtering. Image enhancement examples will be developed illustrating these principles. The most interesting cases of image restoration are those which involve space variant imaging systems. The SVD, combined with pseudoinverse techniques, provides insight into these types of restorations. Illustrations of large scale N2× N2point spread function matrix representations are discussed along with separable space variant N2× N2point spread function matrix examples. Finally, analysis and methods for obtaining a pseudoinverse of separable space variant point spread functions (SVPSF's) are presented with a variety of object and imaging system dagradations.
362 citations
"A robust watermarking scheme based ..." refers background in this paper
...Mathematically, singular value decomposition [14] can be described as follows:...
[...]
TL;DR: Two watermarking approaches that are robust to geometric distortions are presented, one based on image normalization, and the other based on a watermark resynchronization scheme aimed to alleviate the effects of random bending attacks.
Abstract: In this paper, we present two watermarking approaches that are robust to geometric distortions. The first approach is based on image normalization, in which both watermark embedding and extraction are carried out with respect to an image normalized to meet a set of predefined moment criteria. We propose a new normalization procedure, which is invariant to affine transform attacks. The resulting watermarking scheme is suitable for public watermarking applications, where the original image is not available for watermark extraction. The second approach is based on a watermark resynchronization scheme aimed to alleviate the effects of random bending attacks. In this scheme, a deformable mesh is used to correct the distortion caused by the attack. The watermark is then extracted from the corrected image. In contrast to the first scheme, the latter is suitable for private watermarking applications, where the original image is necessary for watermark detection. In both schemes, we employ a direct-sequence code division multiple access approach to embed a multibit watermark in the discrete cosine transform domain of the image. Numerical experiments demonstrate that the proposed watermarking schemes are robust to a wide range of geometric attacks.
252 citations