No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
A robust multiple watermarking scheme in the Discrete Wavelet Transform domain
Abstract
Because of the transition from analog to digital technologies, content owners are seeking technologies for the protection of copyrighted multimedia content. Encryption and watermarking are two major tools that can be used to prevent unauthorized consumption and duplication. In this paper, we generalize an idea in a recent paper that embeds a binary pattern in the form of a binary image in the LL and HH bands at the second level of Discrete Wavelet Transform (DWT) decomposition. Our generalization includes all four bands (LL, HL, LH, and HH), and a comparison of embedding a watermark at first and second level decompositions. We tested the proposed algorithm against fifteen attacks. Embedding the watermark in lower frequencies is robust to a group of attacks, and embedding the watermark in higher frequencies is robust to another set of attacks. Only for rewatermarking and collusion attacks, the watermarks extracted from all four bands are identical. Our experiments indicate that first level decomposition appear advantageous for two reasons: The area for watermark embedding is maximized, and the extracted watermarks are more textured with better visual quality.
... There are studies in the literature to avoid these types of attacks [6]. ...
... Tao and Eskicioğlu proposed a non-blind Discrete Wavelet Transform (DWT) based watermarking method [6]. In discrete wavelet transform, image is decomposed into four bands, each of which is half sized in both row and column size, which ...
... Many DWT-based watermarking schemes were developed thereafter [11]- [14]. Dugad, Ratakonda and Narendra proposed [11] a method similar to that of Tao and Eskicioglu's work [6]. Proposed work was also semi-blind DWT-based watermarking method, in which watermark is a binary image of the same size as the original image, watermark is embedded in LH, HL and HH bands. ...
1 Abstract-Image watermarking has been an important discipline for claiming ownership, ensuring genuineness of images and fingerprinting of images. An important part of the work in this field is performed in discrete wavelet transform (DWT) domain. The watermark is embedded in coefficient values in one or all of LL, LH, HL, HH bands of first level or higher level (DWT) decompositions. In previous works, a host image is taken as a whole and firstly DWT of the whole image is found and then further level decompositions are obtained, if needed. In this paper, instead of taking DWT of the whole image, we implement the known DWT watermarking algorithm by first dividing host image into smaller blocks, namely 64x64, 32x32, 16x16, 8x8, and then taking DWT of each block independently. In addition, we divide the corresponding watermark into the same/matching number of blocks as the original image blocks. We then embed the corresponding watermark block into bands (LL, LH, HL, HH) of DWT transform of original image blocks. When we analyze the fidelity of watermarked images and similarity values of extracted watermarks for different types of block sizes and attacks, we observed that we get better results in our implementation than the known algorithm for some attack types and the results improve with smaller size blocks.
... The proposed watermarking scheme was tested without and with attacks like: Gaussian blur, Gaussian noise, median filter, JPEG compression, sharpening, rotation, cropping, contrast adjustment, and histogram equalization. As you will see in table 1; 2; 3; 4, and 5 the results of proposed algorithm have been compared with those obtained from other watermarking scheme [6][7][8] 19]. Table. 2 and Table.5show ...
... Attacks Taoaand et al[19] Sverdlov et al [7] Ganic & Eskicioglu [6] [19] Sverdlov et al [7] Ganic & Eskicioglu [6] [19] Sverdlov et al [7] Ganic & Eskicioglu [6] ...
... Attacks Taoaand et al[19] Sverdlov et al [7] Ganic & Eskicioglu [6] [19] Sverdlov et al [7] Ganic & Eskicioglu [6] [19] Sverdlov et al [7] Ganic & Eskicioglu [6] ...
... Most of the methods discussed till date, refer to the embedding of a single watermark only. But to improve the security and enhance the robustness of the watermark, many researchers have used dual watermarking [6,10,12,23,29,39] and multiple watermarking [7,11,15,23,26,28,30] schemes. ...
... Ganic et al. [10] used DFT for embedding two watermarks in low and high frequencies respectively. However, Taoa et al. [30] used DWT to embed watermarks at different levels in the host image. Kallel et al. [15] used spatial domain for embedding the diagnosis in the medical image in theirproposed multiple watermarking scheme. ...
This paper presents an improved image-adaptive watermarking technique. Two image watermarks are embedded in the high entropy 8 × 8 blocks of the host image. DWT is applied on these blocks using the principle of sub band coding. This decomposes the high entropy blocks into four sub band coefficients, wherein the approximation and vertical frequency coefficients are modeled using Gaussian (or Normal) distribution. The two watermarks are inserted in the host image using Adjustable Strength Factor (ASF). It is calculated adaptively using the fourth statistical moment known as kurtosis. A limited side information is also transmitted along with the watermarked image. This side information consists of high entropy block positions and Gaussian distribution parameters. To extract both watermarks from the received watermarked image, the high entropy block positions sent in the side information help in applying DWT to calculate the approximation and vertical frequency coefficients. Gaussian (or Normal) distribution is similarly used for modeling and calculating the distribution parameters. This helps the Maximum Likelihood (ML) decoder to recover the watermarks successfully using a statistical approach. Two important contributions are presented in this paper. Firstly, adjustable kurtosis values are used which improves the capacity and robustness of the proposed technique. Secondly, the proposed work is implemented on medical applications and gives better performance as compared to the existing methods. Further, the efficiency of the proposed work is evaluated by better simulation results using PSNR, NCC, SSIM and GMSD under different attacks. The technique is highly robust as watermarks survive under different attacks. This increases security and ensures copyright protection.
... For most application, security is considered as a vital aspect of digital watermarking techniques. Therefore, several studies suggest repeating the embedding for the same watermark, and this id known as a multiple watermarking [4,7]. ...
... Digital watermarking techniques can be categorized into two domains: the spatial domain and the transform domain [1,4,5,6]. The spatial domain watermarking enjoys the lower computational complexity [7,8,9], and is advantageous with respect to capacity and imperceptibility [10]. On the other hand, the transform domain is more superior in terms of robustness. ...
This paper proposes a copyright protection system for digital certificate image using blind watermarking technique by applying discrete wavelet transform algorithm (DWT). The proposed technique utilizes three interrelated watermarks namely, Red watermark (RW), Green-watermark (GW) and Blue-watermark (BW). Firstly, RGB cover and RGB watermark image are divided for three color space R,G,B. Then the R component is chosen for embedding (RW), the B component is selected for embedding the (BW) and the G component is selected for embedding the (GW), R,G and B of the cover image are converted into the transform domain using DWT, and is subsequently decomposed into three levels viz. LH1, LL2 and LL3 sub-bands. RW, GW and BW are then embedded onto LL3. Experimental results show that the performance of the proposed technique is very encouraging with average PSNR of 44 db, and NCC value of more than 0.99 for extracted watermarks after performing several types of attacks.
... Filter convolution is used to implement wavelet transform, and it is computationally efficient. Embedding should be done in the lower frequency region, and decomposition level is smaller for higher frequency bands [3]. Patterns and edges are located in the sub-bands have high resolution. ...
... [ U S V] = SVD(A) (3) h. Matrix S is modified, and on the adjusted singular values SVD operation is again applied. ...
A watermarking technique is proposed using Discrete Wavelet Transform (DWT), Discrete Cosine Transform (DCT), and Singular Value Decomposition (SVD) techniques to implement information hiding. Embedding can be done by dividing the host image into four rectangular segments which are non-overlapping called sub-images using hybrid scheme. Redundancy reduces cropping attack. The main aim is to reduce the effect of geometric bouts, such as rotation, translation, and affine translation using synchronization technique. Watermarks can be a binary random sequence of different lengths. Data replication and hamming code are two error modification methods utilized in the proposed scheme. Achieved results show comparable robustness against geometric attacks and signal processing. Contourlet transform can be used to improve the visual feature of the image. After embedding the image or data, contourlet transform is applied in the frequency domain to improve robustness. The optimal mapping function is obtained using contourlet transform which increases Peak Signal to Noise Ratio (PSNR) and hiding capacity with low distortion.
... Digital watermark (W) is a signal embedded into data to identify some attributions of the data (i.e., ownership). According to the domain embedded, digital watermark embedding algorithms are divided into timespatial embedding, which is fast and relatively easy to operate but is easy to be erased by geometrical attack, and transform domain embedding [16][17][18][19], which is good at resisting geometrical attack but is fragile facing filtering. Moreover, according to the preknowledge related to data before embedding, we classify the embedding method into preknowledge dependent embedding and preknowledge independent embedding. ...
... Break; (8) end (9) else (10) if is in embedding positions then (11) if == 1 then (12) 2(( −1) + ) = 1(( −1) + ) (13) end (14) else (15) 2(( −1) + ) = 0(( −1) + ) (16) end (17) end (18) else (19) 2(( −1) erasing in the future which will release the storage burden of TTP. ...
With the growth of cloud computing technology, more and more Cloud Service Providers (CSPs) begin to provide cloud computing service to users and ask for users’ permission of using their data to improve the quality of service (QoS). Since these data are stored in the form of plain text, they bring about users’ worry for the risk of privacy leakage. However, the existing watermark embedding and encryption technology is not suitable for protecting the Right to Be Forgotten. Hence, we propose a new Cloud-User protocol as a solution for plain text outsourcing problem. We only allow users and CSPs to embed the ciphertext watermark, which is generated and embedded by Trusted Third Party (TTP), into the ciphertext data for transferring. Then, the receiver decrypts it and obtains the watermarked data in plain text. In the arbitration stage, feature extraction and the identity of user will be used to identify the data. The fixed Hamming distance code can help raise the system’s capability for watermarks as much as possible. Extracted watermark can locate the unauthorized distributor and protect the right of honest CSP. The results of experiments demonstrate the security and validity of our protocol.
... Watermarking embeds data directly into multimedia content and this process generally involves a key that determines the location of the watermark. There are several schemes and methods of watermarking explored by researchers in order to deal with this issue (Tao & Eskicioğlu, 2015). These involve the following main characteristics: Perceptual transparency; Durability; High capacity; and Robustness. ...
... Perceptual transparency can be defined as the perceptual similarity between original data and marked data. When a mark or logo is added so as to meet this requirement, the quality of the original data will not be influenced (Tao & Eskicioğlu, 2015). Durability is the term used to indicate the level to which the authenticity of a mark can be determined after the marked data have passed through certain mark processing applications. ...
The transition from analog technologies to digital technologies has increased the ever-growing concern for protection and authentication of digital content and data. Owners of digital content of any type are seeking and exploring new technologies for the protection of copyrighted multimedia content. Multimedia protection has become an issue in recent years, and to deal with this issue, researchers are continuously searching for and exploring new effective and efficient technologies. This thesis study has been prepared in order to increase the invisibility and durability of invisible watermarking by using the multilayer Discrete Wavelet Transform (DWT) in the frequency plane and embedding two marks into an image for the purpose of authentication and copyright when digital content travels through an unsecured channel. A novel watermarking algorithm has been proposed based on five active positions and on using two marks. In addition to the extraction process, watermarking images will be subjected to a set of attack tests. The evaluation criteria have been the bases of assessing the value of SNR, PNSR, MAE and RMSE for both the watermarking images and the watermarking images after attacks, followed by the invisibility of the watermarking being measured before and after the attacks. Our lab results show high robustness and high quality images obtaining value for both SNR and PNSR. © 2017 Institute of Advanced Engineering and Science. All rights reserved.
... Currently, digital watermarking schemes concerning the data taken into account through getting rid of might be categorized as blind and non-blind approaches. In non-blind watermarking approaches, both data for actual host image and understanding statistics about watermarked image are known inside the amount of watermark recognition and extraction (Tao and Eskicioglu, 2004). In contrast, in blind approach finding the watermark and not mention for the original image is preferred (Al-Otum and Samara, 2010). ...
... Therefore, a completely new technique referred to as semi-blind watermarking was introduced. Within this kind of watermarking approach, only the original watermark or perhaps the watermarked multimedia statistics are known (Tao and Eskicioglu, 2004;Shieh and Athaudage, 2006). ...
This study presents a method of scheming colour image by using fuzzy watermarking through Discrete Wavelet Transform (DWT) and histogram stretching methods. This study aims further at achieving and developing robustness, imperceptibility and available capacity of cover image for the watermarked image, which can withstand against various attacks. Digital watermarking techniques are used to protect the copyrights of multimedia data by embedding secret information in the host media, for example, embedding in images, audios, or videos. Many watermarking techniques have been proposed in the literature to solve the copyright violation problems, but most of these techniques failed to satisfy both imperceptibility and robustness requirements. In this research, adaptive RGB colour image fuzzy watermarking technique is proposed. The host image is converted from RGB to YCbCr colour space to preserve imperceptibility and robustness, then, Cb component is extracted and partitioned into four quadrants. While the Histogram Stretching will be used to convert the Watermark image to 4-bits plan to preserve the capacity for watermarking.
... In false positive problem, it was possible to extract a watermark which was not actually the embedded. The problem of rightful ownership has been addressed by few authors through hybrid DWT-SVD based algorithms [3,4,7,10,12,16,17,19,24]. Jain et al. in 2008 informed, reliable SVD-based image watermarking algorithm which was capable of dealing the false positive problem. ...
... This particular watermarking technique has shown the significant improvement over the parallel watermarking approaches in terms of imperceptibility and robustness under an assortment of attacks, but at the same time it suffers from the problem of false positive. The SVD based watermarking and its variations which have been reported through literature [3,4,7,10,12,16,17,19,24] mainly deal with robustness and impeccability issues while overlooking the problem of false positive associated copyright ownership. However Run et al. [3] proposed a watermarking scheme that solves the ambiguities and false positive problem, but at the same time it suffers from the robustness and imperceptibility of watermarked image. ...
... Digital Watermarking. Early studies [2,20,36,46] proposed to embed the watermarks within frequency domains. Figure 4. Visual examples of CopyRNeRF [24], WateRF [13], WateRF + 3DGS, and our GuardSplat. ...
3D Gaussian Splatting (3DGS) has recently created impressive assets for various applications. However, the copyright of these assets is not well protected as existing watermarking methods are not suited for 3DGS considering security, capacity, and invisibility. Besides, these methods often require hours or even days for optimization, limiting the application scenarios. In this paper, we propose GuardSplat, an innovative and efficient framework that effectively protects the copyright of 3DGS assets. Specifically, 1) We first propose a CLIP-guided Message Decoupling Optimization module for training the message decoder, leveraging CLIP's aligning capability and rich representations to achieve a high extraction accuracy with minimal optimization costs, presenting exceptional capability and efficiency. 2) Then, we propose a Spherical-harmonic-aware (SH-aware) Message Embedding module tailored for 3DGS, which employs a set of SH offsets to seamlessly embed the message into the SH features of each 3D Gaussian while maintaining the original 3D structure. It enables the 3DGS assets to be watermarked with minimal fidelity trade-offs and prevents malicious users from removing the messages from the model files, meeting the demands for invisibility and security. 3) We further propose an Anti-distortion Message Extraction module to improve robustness against various visual distortions. Extensive experiments demonstrate that GuardSplat outperforms the state-of-the-art methods and achieves fast optimization speed.
... The study of embedding robust, imperceptible, and large-capacity watermarks in digital content has paralleled the evolution of digital media. The conventional 2D watermarking [5,20,38,44], before the deep learning based methodology, mostly utilized domain transformation, where the watermark is embedded into selected transform coefficients. Common image transform techniques include frequency transforms, such as Discrete Fourier Transform (DFT) [49], Discrete Cosine Transform(DCT) [2,42], and Discrete Wavelet Transform (DWT) [41]. ...
Recently, 3D Gaussian splatting has been getting a lot of attention as an innovative method for representing 3D space due to rapid rendering and image quality. However, copyright protection for the 3D Gaussian splatting has not yet been introduced. In this paper, we present a novel watermarking method for 3D Gaussian splatting. The proposed method embeds a binary message into 3D Gaussians by fine-tuning the pre-trained 3D Gaussian splatting model. To achieve this, we present Frequency-Guided Densification (FGD) that utilizes Discrete Fourier Transform to find patches with high-frequencies and split 3D Gaussians based on 3D Gaussian Contribution Vector. It is each 3D Gaussian contribution to rendered pixel colors, improving both rendering quality and bit accuracy. Furthermore, we modify an adaptive gradient mask to enhance rendering quality. Our experiments show that our method can embed a watermark in 3D Gaussians imperceptibly with increased capacity and robustness against attacks. Our method reduces optimization cost and achieves state-of-the-art performance compared to other methods.
... First, spatial domain technique and second frequency domain technique was used. Tao et al. [18] proposed a technique for securing multiple watermark images in DWT up to two level by inserting four same watermarks at 1st and 2nd level of DWT in all sub bands and analyzing the performance of all watermark. ...
... Embedding of watermark in wavelet transform is relatively of better quality and robustness. Discrete wavelet transform coefficients are obtained by standard procedure in which a dyadic grid is used for scale and translation parameter [7]. Signal sequence is decomposed in to sub bands of frequencies at different levels for eg. ...
... Penyisipan watermark dalam domain transformasi dapat dilakukan dengan dengan mengubah nilai koefisien-koefisien hasil transformasi dari citra digital. Transformasi yang banyak digunakan adalah DCT (Discrete Cosine Transform) [5] [6], DWT (Discrete Wavelet Transform) [7][8], dan FHT (Fast Hadamard Transform) [9] [10]. Penysisipan watermark dalam domain transformasi dapat memberikan tingkat imperceptibility dan robustness yang lebih baik daripada penyisipan watermark dalam domain spasial [11] [12]. ...
Informasi dalam bentuk multimedia digital mudah dilakukan duplikasi dan modifikasi oleh pihak-pihak yang mungkin saja tidak memiliki izin dari pemilik yang sah. Hal ini dapat menimbulkan persoalan pelanggaran hak cipta atas informasi multimedia tersebut. Salah satu cara untuk mengatasi persoalan tersebut adalah dengan digital watermarking. Dalam artikel ini dibahas mengenai teknik watermarking pada citra digital menggunakan contourlet transform (CT) yang digabung dengan discrete cosine transform (DCT) dan perhitungan noise visibility function (NVF). Watermark disisipkan pada koefisien DCT dari subband hasil transformasi contourlet level 2. Penyisipan watermark dilakukan dengan memperhitungkan nilai NVF koefisien CT dari subband yang digunakan. Untuk daerah yang bertekstur, watermark akan disisipkan lebih kuat daripada daerah yang datar. Dari hasil uji coba diperoleh bahwa citra yang telah disisipi watermark mempunyai kualitas yang baik dengan rata-rata nilai peak signal to noise ratio (PSNR) lebih besar dari 35 dB, dan watermark dapat diekstraksi kembali dengan baik dengan rata-rata nilai bit correct ratio (BCR) lebih besar dari 98%. Watermark masih tahan terhadap kompresi JPEG dengan faktor kualitas Q 9, penambahan noise Gaussian sampai 10%, cropping sampai 25%, dan scaling 75% dan 125%, tetapi tidak tahan terhadap rotasi. Information in the form of digital multimedia can easily be duplicated and modified by parties who may not have the permission of the legal owner. This can lead to issues of copyright infringement of the multimedia information. One solution to overcome this problem is digital watermarking. This article discusses watermarking technique in digital images using contourlet transform (CT) combined with discrete cosine transform (DCT) and noise visibility function (NVF) calculation. Watermark is inserted in the DCT coefficients of level 2 contourlet transform subband. Watermark insertion is done by calculating the NVF value of the CT coefficients of the subband used. For textured areas, the watermark will be inserted stronger than flat areas. From the test results, it is found that the watermarked image has good quality with an average peak signal to noise ratio (PSNR) value greater than 35 dB, and the watermark can be extracted back well with an average bit correct ratio (BCR) value greater than 98%. Watermark is still resistant to JPEG compression with a quality factor Q greater than 9, Gaussian noise addition up to 10%, cropping up to 25%, scaling 75% and 125%, but not resistant to rotation.
... Wavelet transform provides both frequency and spatial description of an image. Unlike conventional Fourier transform, temporal information is retained in this transformation process [9,10]. Wavelets are created by translations and dilations of a fixed function called mother wavelet. ...
Information security and copyright protection are the highest attention in digital communication community. digital image watermarking provides one of the ways to claim copyright for the information owner. the main emphasis is on fidelity , capacity and robustness while devising digital watermarking techniques. In this paper , a digital image watermarking for gray scale image using 1 level wavelet is proposed. The watermark image is converted to 8 bit planes(layers or arrays) from least significant bits to most significant bits , and the bits of watermark planes are embedded in the subbands(LH,HL and HH) of the decomposed cover image. The proposed technique extracts the watermark with high PSNR values. The proposed algorithm gives a high quality and imperceptible watermarked images , and it has acceptable robustness against salt and pepper noise and image cropping attacks.
... The embedding domain of the watermark. Common choices are the spatial and Fourier domains, however there are many possible choices [6][12] [25]. The choice of embedding domain will effect the perceptibility and SNR of the watermark extraction. ...
In this paper we introduce a scheme for detecting manipulated audio and video. The scheme is a synthesis of blockchains, encrypted spread spectrum watermarks, perceptual hashing and digital signatures, which we call an Embedded Blockchain. Within this scheme, we use the blockchain for its data structure of a cryptographically linked list, cryptographic hashing for absolute comparisons, perceptual hashing for flexible comparisons, digital signatures for proof of ownership, and encrypted spread spectrum watermarking to embed the blockchain into the background noise of the media. So each media recording has its own unique blockchain, with each block holding information describing the media segment. The problem of verifying the integrity of the media is recast to traversing the blockchain, block-by-block, and segment-by-segment of the media. If any chain is broken, the difference in the computed and extracted perceptual hash is used to estimate the level of manipulation.
... To overcome this drawback, transform domain based watermarking schemes have been actively studied [5]. With regards to transform domain based watermarking schemes, two typical transforms that have been widely used are discrete cosine transform (DCT) and discrete wavelet transform (DWT) (see, for example, [3,6,7,8,9], and references therein). In general, the desired properties of watermarking schemes are the robustness, the invisibility and the capacity [10]. ...
... contrast adjustments, sharping and so on. Besides, many measures that were employed to test Tao and Eskicioglu (2004) generalize an idea that system performance. embeds a binary image in all four bands of 1st and 2nd ...
Scheme of "robust image watermarking" for the protection of copyright is proposed based on "3-level 2-Dimensional Discrete Wavelet levels decompositions (2DDWT)". In the proposed system, two binary watermark images are embedded into the sub-bands of a cover image by using direct arithmetic addition depending on the alpha blending with variable scaling factor scheme with the host image wavelet coefficients. A comparison has been made among 1-3 level through the use of statistical parameters like "Peak-Signal-to-Noise-Ratio (PSNR)" and Similarity Ratio (SR). Then five groups of malicious attacks are applied to watermarked images like filters, noises, geometric, JPEG compression and restoration and enhancement attacks on the watermarked image which is the main contribution to this field. The experimental results show that the watermark images generated with the proposed algorithm based on 3-levels outperform the other levels in terms of robustness. However, they show comparable results in terms of transparency. As a result, the 3rd level is recommended for watermarking schemes.
... • Discrete Wavelet Transform Based Watermarking Technique: It generates multi-resolution image view that helps in understanding the formation of an image. Also, the observation of signals can be performed at multiple resolutions (Tao &Eskicioglu, 2004). The decomposition of image is performed in low frequency and high frequency components. ...
The data transmission on network channel is of tremendous increases from the past few decades. Watermarking is a process to add watermark as a digital signal, label or tag into a cover media. The primary requirements of multimedia watermarking are robustness and embedding capability. The robustness is defined as the strength of an algorithm to repel the noise. However, it is challenging to achieve both at the same time. The numerous characteristics of watermarking are very imperative in the multimedia watermarking system. The researchers are using watermarking schemes in various applications such as military, digital forensics, medical and so on. Attacks of these watermarking harm or uncover the secret information carried in the watermark. Potential researchers have been presented various techniques for balancing or improving these concerns. In this chapter, the recent multimedia watermarking techniques are reviewed on the basis of robustness and embedding capability. Further, this article introduces the characteristics, applications and attacks on multimedia watermarking techniques.
... Through reenactments, it was checked that the proposed strategy had a strong force to JPEG strain, enhancing, shading tone transformation and mode disfigurement. Tao and Eskicioglu (2004) conducted a comparative learning to discover the effects of embedding watermarks in the first and second degree decomposition. The authors advised that embedding in the first degree was fantastic considering that it offered extra coefficients for amendment. ...
Multimedia technology usages is increasing day by day and to provide authorized data and protecting the secret information from unauthorized use is highly difficult and involves a complex process. By using the watermarking technique, only authorized user can use the data. Digital watermarking is a widely used technology for the protection of digital data. Digital watermarking deals with the embedding of secret data into actual information. Digital watermarking techniques are classified into three major categories, and they were based on domain, type of document (text, image, music or video) and human perception. Performance of the watermarked images is analysed using Peak signal to noise ratio, mean square error and bit error rate. Watermarking of images has been researched profoundly for its specialized and modern achievability in all media applications such as copyrights protection, medical reports (MRI scan and X-ray), annotation and privacy control. This paper reviews the watermarking technique and its merits and demerits.
... The digital image watermarking techniques in the literature are typically grouped in two classes [10]: Spatial domain techniques [11]: which embed the watermark by modifying the pixel values of the original image and the transform domain techniques which embed the watermark in the domain of an invertible transform. The discrete cosines transform (DCT) and the discrete wavelet transform (DWT) are commonly used for watermarking purposes [12]. ...
Digital media content creation/capturing, processing and distribution have witnessed a phenomenal growth over the past decade. This media content is often distributed in compressed and encrypted format and watermarking of these media for copyright violation detection, proof of ownership or distributorship, media authentication, sometimes need to be carried out in compressed-encrypted domain. It is sometimes necessary to watermark these compressed encrypted media items in the compressed-encrypted domain itself for tamper detection or ownership declaration or copyright management purposes. It is a challenge to watermark these compressed encrypted streams as the compression process would have packed the information of raw media into a low number of bits and encryption would have randomized the compressed bit stream. Attempting to watermark such a randomized bit stream can cause a dramatic degradation of the media quality. Thus it is necessary to choose an encryption scheme that is both secure and will allow watermarking in a predictable manner in the compressed encrypted domain. This paper will survey on the compression and watermarking techniques in image encryption.
... Step 3: Embedding binary sequence B. Inspiring by literature [7], we embed the the binary sequence B into the approximation coefficients of DWT in the regions with larger motion activity. The embedding rule can be written as ...
... Novel digital image watermarking scheme using biorthogonal wavelets are proposed by Yamuna and Sivakumar [10]. Peining Tao et al [11] generalized an idea in a recent paper that embeds a binary pattern in the form of a binary image in the LL and HH bands at the second level of Discrete Wavelet Transform (DWT) decomposition and a comparison of embedding a watermark at first and second level decompositions. Embedding the watermark in lower frequencies is robust to a group of attacks like JPEG compression, blurring, adding Gaussian noise, rescaling, rotation, cropping, pixelation, and sharpening. ...
This paper presents visible and invisible watermarking scheme for color images using Discrete Wavelet Transform. In the embedding process for the visible watermarking the original image is first decomposed into two levels DWT and the watermark is embedded into the second level. For the invisible watermarking scheme the original image is decomposed into four levels and then the watermark is embedded. At the extraction process the watermarked images are again decomposed into the same levels and then the original image is subtracted. The experimental results show that the proposed algorithm gives watermarked images with good visual quality.
... With the transition from analog to digital technologies, multimedia contents were inadequate without copyright protection against unpermitted distribution. Because of this evaluation, multimedia content protection became a prerequisite in content-based studies [1]. ...
... Tao and Eskicioglu [36] presents an optimal wavelet-based watermarking technique. They embed binary logo watermark in all the four bands. ...
Facial and Finger authentication plays a pivotal role for proving personal verification in any organization, industry, enterprise, etc. In the previous works, authentication systems are developed by using the password, pin number, digital signature, etc., as a single source of identification. But all these systems can be subjected to spoofing attack. In this paper, a novel authentication system is proposed with image-in-image Fast Hadmard Transform (FHT) watermarking and authentication with Singular Value Decomposition (SVD). The proposed system is strong enough from attacks as the authentication is being done using face and finger traits. The proposed work is useful for reducing the size of the database, identification and authentication for bank systems, crime investigations, organizational attendance systems, and for knowing student attendance system, unauthorized copying, etc.
... The main advantages of using the frequency domain methods are that they can easily be adapted to lossy compression systems, which have the ability to embed data in the compressed representations, and have ability to reveal the watermark even from the modified watermarked image [9,20]. The transform domain based watermarking schemes can be implemented through various transformation tools such as discrete cosine transform (DCT) [22], discrete wavelet transform (DWT) [23], Discrete Fourier transform(DFT) [12], Integer wavelet transform(IWT) [4], Singular Value Decomposition(SVD) [11] etc. ...
In this paper, the authors have proposed a binary watermark embedding approach for protecting the copyright ownership of the gray-scale images. The proposed watermark embedding process is realized in integer wavelet transform (IWT) domain to defend the robustness property. Instead of inserting the watermark bits directly in the coefficients of cover media, an indirect embedding mechanism is proposed with the reference to a logistic map based secret key matrix which enhance the secrecy of the proposed embedding approach. Initially, the approximate sub band of the IWT transformed cover image is selected with the intention to embed the watermark. Later, a secret key matrix of size corresponding to the approximate sub band of the cover image is formed using the logistic map with secret parameters. During the watermark embedding process, the approximate sub band is modified indirectly with reference to the secret key matrix and a proposed division table. The scheme is tested on a set of standard images and satisfactory results are achieved. In addition, the proposed schemes is also able to extract the watermark information in blind manner. Also, the scheme is comparable with some other related schemes. Finally, the proposed watermarking scheme is able to survive the watermark even after performing certain types of image manipulation attacks.
... The multiresolution representation renders a framework to understand image information. DWT[23]provides an efficient way to observe signals at multiple resolution. DWT decomposes image in high frequency and low frequency components. ...
Nowadays, Multimedia security [1] is a major issue. Images, video, audio, text files are losing their credibility day by day as they can be distorted or manipulated by using several tools. Ensuring the authenticity [2] and integrity of digital media is a major issue. The manipulation made by forgery tools are so smoothly done that we don’t even suspect that forgery may be involved in digital content. Multimedia data is facing several issues related to illegal distribution, duplication and manipulation of information conveyed by them. The digital watermarking [3] technique plays an important role in protecting digital content. In this paper, On the basis of their operating principles different watermarking techniques are categorized [4]. Attacks, applications and requirements [5] related to watermarking techniques are also discussed. Different watermarking techniques proposed by researchers for protecting copyrights of digital media are presented which are based on spatial and frequency domain. Frequency domain are getting much more attention due to use of wavelets which have high degree of resemblance to human visual system. In digital watermarking, secret information is embedded with original data for maintaining ownership rights of the digital content. Spatial domain watermarking techniques work over pixel characteristics and frequency domain watermarks concerned about different transformations that can be used with digital content. Imperceptibility, robustness, security, complexity and capacity are some requirements of the digital watermarking which completely depends on the algorithm used for watermarking.
... Most of the multimedia applications require imperceptible, secure and robust watermarking schemes to protect the ownership of digital media [7]. In the last decade, a lot of digital image watermarking schemes have been proposed for providing content authentication, rightful ownership, copyright protection etc. [8][9][10][11][12][13][14][15][16][17][18]. Contemporarily, the attempts have been also made by the researchers to analyze and assess the security of individual watermarking schemes. ...
A new digital image watermarking scheme based on chaotic map was proposed to hide the sensitive information known as watermark. The authors claimed that the scheme is efficient, secure, and highly robust against various attacks. In this paper, the inherent security loopholes of the watermarking embedding and extraction processes are unveiled. The cryptanalysis of watermarking scheme is presented to demonstrate that the scheme is not robust and secure against the proposed attack. Specifically, with chosen host image and chosen watermarks, the successful recovery of securely embedded watermark from received watermarked image is possible without any knowledge of secret key. The simulation analysis of proposed cryptanalysis is provided to exemplify the proposed attack and lack of security of anticipated watermarking scheme.
... The Laplacian pyramid was first introduced as a model for binocular fusion in human stereo vision [3], where the implementation used a Laplacian pyramid and a maximum selection rule at each point of the pyramid transform. ...
... This method is more robust, also achieves better PSNR and correlation. In [50] a hybrid method combined of DWT, DCT and SVD is Proposed and compared with [51] that used only DWT and [52] that used DCT and SVD. The comparison proved that the hybrid method [50] is better in PSNR and correlation. ...
Transmitting confidential images between two channels suffer from hacking. Therefore, protecting confidentiality has become a very essential issue. Recently, several methods are developed to protect important information. The main idea is based on embedding important information in multimedia carrier such as: text, image, audio, and video. The developed methods may be classified as steganography and watermarking. Steganography aims to embed huge amount of secret data in multimedia carrier while watermarking aims to hid small amount of secret data in multimedia carrier. This paper first presents a literature survey of information hiding, then classifies the proposed methods, and finally introduces a comparative study between the different methods.
... Taking strength factor of watermark as 0.10. Tao et al. [10] Securing multiple watermark image in DWT up to two level by inserting four same watermarks at 1st and 2nd level of DWT in all sub-bands and analyzing the performance of all watermarks. Ganic et. ...
Today detectability of Intellectual Property in the digital world is a major issue. And a watermarking is one of them process to secure intellectual rights of digital assets. In our paper we propose a method to insert multiple watermark in spatial and frequency domain to make our assets secure and undetectable by dividing our host image into two regions, called region-A and region-B. In a region-A, an owner information is inserted with the help of LSB technique and in another, region-B, a circular watermarks are inserted with additive watermarking technique in DWT-DFT domain.
... And in blind watermark extraction technique only key requires. [9] Each watermark should follow its properties like robustness, imperceptibility, capacity and security. Requirement Triangle of Watermarking shown in Figure 1. ...
... Images are usually non-stationary two-dimensional signals and wavelet transform is effective in such case. When discrete wavelet transformation (DWT) applied on image, it decompose image into four frequency sub-bands (LL, HL, LH, HH) where LL refers to low pass band and other three sub-bands corresponds to horizontal (HL), vertical (LH) and diagonal (HH) high pass bands [6]. general, the watermark can be inserted into low frequency sub-bands (LL) because it increases the robustness of watermark but at the same time it may degrade the image significantly. ...
This paper proposes a new watermarking scheme that is screen-shooting resilient. We try to design a watermarking scheme that can resist the distortion generated during the screen-shooting process while has a good invisibility. While embedding, we utilize the stability of the singular value matrix in terms of sign invariance to improve the robustness of our watermarking scheme. We use scale-invariant feature transform (SIFT) algorithm to help with locating different embedding regions to embed repeatedly to further improve robustness. While extracting, we located more regions compared with embedding process to enhance the error-tolerant rate. Compared with the previous method, our watermarking scheme has a larger embedding capacity while performing better in terms of robustness and invisibility.
English: Contributions to digital watermaring of still images in the wavelet transform
Corina Naforniţă
Scientific advisors: Prof.Dr.Eng. Monica Borda (UTC-N),
Prof.Dr.Eng. Alexandru Isar (UPT)
The thesis make an analysis of copyright protection schemes design for still images using watermarking in the wavelet domain, having 226 pages, 6 chapters, bibliography and a list of my own publications. The first three chapters define the watermarking techniques, review the main results already reported in literature. The chapters 4 and 5 present my original contributions being proposed several architectures of watermarking systems. All the results have already been published in the Proceedings of prestigious national or international conferences. Some af them have been cited by others authors working in the same field. The chapter 6 contains the conclusions and personal contributions. These are refering to: the classification and critical appreciation of the watermarking methods and attacks, the conclusion being that the digital watermaring in the wavelet transform domain is the most promising; where should the watermark be inserted (in the spatial or transform domain) and to to obtain a robust watermark in what resolution levels of DWT (all, low or high resolution) and in what subbands; what detector architecture ensure the best estimete of watermark; how to make perceptual watermarks; how to evaluate robustness of perceptual watermarks. These contributions are:
1. The informed watermarking [NI03] in the diagonal detail subband of the first resolution level selecting the coefficients to be watermarked using experimental tresholds. 2. The informed watermarking [NBK04] in the all resolution levels, using the same method to select the wavelet coefficients. Detection is made from all resolution levels, or from the last resolution level, less affected by common signal processing. 3. A comparison of our method [NBK04] with a quantization based watermarking method – Kundur and Hatzinakos – in the wavelet domain, or the method in the DCT domain – Cox et al. [CKLS97]. In the next proposed method, [NB05], the images watermarked have a lower watermark strength, hence the quality of the images are comparable, our method being superior to the method proposed by Cox et al. 4. For detecting the watermark, we analyze three types of detectors; the third detector, max-correlation, extracts every estimate of the watermark, [Naf05b], and the watermark with highest correlation with the original one is the response of the detector. 5. The third watermarking method with non-blind detector, selects the wavelet coefficients on the basis of a statistical analysis, [NIB05]. As such, fewer coefficients are affected and the watermark is more robust. 6. A new type of perceptual mask is proposed [NIB06a], using a perceptual mask: data can be embedded in all detail wavelet coefficients, with variable watermark energy. The method is more robust while the quality of the watermarked image is superior. 7. An extension of this method is proposed, [NIB06b], which hides the watermark in lower frequency subbands. This makes the watermark more attack resilient. 8. The evaluation of robustness for perceptual watermarks only when invisibility criteria are satisfied, [Naf07a]. 9. The most important contribution is the method [Naf07b], the watermark is inserted in all resolution levels; the robustness of this method is superior to the one presented by Barni et al. and the attack is resilient to the possible erasure of the first level detail subbands. The third method uses three types of detection i) from all resolution levels, ii) separately from each level, max-level, considering the maximum detector response from each level and iii) separately from each subband, max-subband, considering the maximum detector response from each subband. The method is the most attack resilient comparing with [BBP01], given the fact that the insertion is made on all subbands and on all resolution levels and we use the diversity of the wavelet transform in the detection process. The three detectors can be combined to optimize the watermark extracting, being the final result of the thesis.
Romanian: Contribuţii la marcarea transparentă a imaginilor în domeniul transformatei wavelet
Corina Naforniţă
Conducători şt.: Prof.Dr.Ing. Monica Borda (UTC-N), Prof.Dr.Ing. Alexandru Isar (UPT)
Lucrarea analizează construcţia sistemelor de protecţie a drepturilor de autor, la imagini, prin marcare transparentă (watermarking) în domeniul transformatei wavelet, are 226 de pagini, 6 capitole, lista bibliografică, lista publicaţiilor personale. În primele capitole e analizată literatura şi se definesc tehnicile de marcare. Capitolele 4 şi 5 prezintă contribuţiile originale, fiind propuse mai multe arhitecturi de sisteme de marcare transparentă, rezultatele fiind publicate în volumele unor conferinţe internationale prestigioase, din ţară sau străinătate. Unele dintre aceste articole au fost citate de alţi cercetători din domeniu. În capitolul 6 sunt prezentate concluziile şi contribuţiile personale. Ele se referă la: clasificarea şi aprecierea critică a metodelor de marcare transparentă şi a atacurilor, subliniind că marcarea în domeniul transformatei wavelet, mai ales cea adaptivă, este promiţătoare; la modul de plasare al marcajului pentru creşterea robusteţii lui: în domeniul spaţial sau al unei transformate, în care nivel de descompunere al DWT (toate, cele de rezoluţie inferioară sau superioară), în care din subbenzile DWT; la arhitectura de detector ce asigură extragerea optimă a marcajului; la cum să se facă marcarea perceptuală; la cum se evaluează robusteţea marcajelor perceptuale. Contribuţiile originale (cap. 4 şi 5) sunt:
1. Marcare informată [NI03] în subbanda de detalii diagonale, primul nivel de rezoluţie, sau în toate subbenzile primului nivel, folosind praguri experimentale pentru selectarea coeficienţilor care se marchează. 2. Marcare informată în cele trei nivele de rezoluţie, cu aceeaşi selecţie a coeficienţilor wavelet. Detecţia se face din toate nivelele, sau din ultimul nivel de rezoluţie, mai puţin afectat de prelucrări de semnal. 3. Comparaţie a metodei propuse [NBK04], cu cea prezentată de Kundur şi Hatzinakos de tip cuantizare în domeniul wavelet, respectiv faţă de cea din domeniul DCT de tip spread-spectrum prezentată de Cox et al. Apoi [NB05], intensitatea de marcare este redusă faţă de [CKLS97], imaginile nu sunt vizibil afectate de procesul de marcare, calitatea imaginilor este comparabilă, metoda fiind superioară. 4. Pentru detecţia marcajului la a doua metodă am analizat trei tipuri de detectoare; al treilea detector, max-correlation, estimând marcajul cu corelaţie maximă cu cel original [Naf05b]. 5. Am propus [NIB05] o abordare statistică pentru a selecta mai puţini coeficienţi wavelet în care se înserează marcajul, dar răspunsul detectorului este mai bun, coeficienţii mari fiind mai robuşti. Selecţia pragurilor e bazată pe proprietăţile statistice ale coeficienţilor wavelet. 6. Am propus un nou tip de mascare perceptuală [NIB06a] ce ascunde datele în toţi coeficienţii wavelet de detaliu, cu intensitate de marcare variabilă, cu o mască perceptuală; metoda este mai robustă iar calitatea imaginilor marcate este superioară faţă de [BBP01].7. O extensie a metodei [NIB06b] ascunde imperceptibil marcajul şi în subbenzile de joasă frecvenţă, ce creşte robusteţea. 8. Evaluarea robusteţii marcajelor perceptuale doar când criteriile de invizibilitate sunt satisfăcute [Naf07a]. 9. Cea mai importantă contribuţie este metoda [Naf07b], cu marcaj în toate nivelele, util în cazul ştergerii subbenzilor de frecvenţă înaltă care conţin marcajul la [BBP01]. Am propus şi evaluat trei detectoare: i) din toate nivelele de rezoluţie, ii) separat din fiecare nivel, max-level, şi iii) separat din fiecare subbandă, max-subband. Metoda este mai bună la diverse atacuri decât cea din [BBP01], fapt explicat prin estimatul mai bun al măştii perceptuale şi diversitatea transformării wavelet. Rezultatele celor trei detectoare pot fi fuzionate, ameliorându-se în continuare extragerea marcajului, fiind rezultatul final al tezei de doctorat.
In the recent past, a new statistically efficient digital image watermarking scheme based on chaotic map was proposed. The authors of this watermarking scheme claimed under study that their scheme is efficient, secure, and highly robust against various attacks. However, the security analysis of the scheme unveils that it has serious inherent flaws. In this article, the shortcomings of the proposed watermarking scheme and cryptanalysis are presented to demonstrate that the scheme is not secure against the proposed attacks. Specifically, with the chosen host image and chosen watermarks, we can successfully recover the watermark from received watermarked image without having any knowledge of the secret key. The simulation analysis of the proposed cryptanalysis is provided to exemplify the proposed attack and lack of security of the anticipated watermarking scheme. In addition, an improved version is proposed to enhance the security performance of the watermarking scheme against possible attacks. The improved scheme tends to hold against attacks and statistical efficiency.
The digital image watermarking technology is widely used to protect intellectual property and to authenticate digital contents in the network environment. The aim of the paper is to invoke the improved Laplacian Pyramid transform to develop a new image watermarking scheme. Specifically, the host image is decomposed and reconstructed by using the improved Laplacian Pyramid transform. Then, the mid frequency subband data with the appropriate level and strength factor are chosen to embed the watermark. Finally, we conduct experiments to investigate the invisibility and robustness of the proposed algorithm. To measure the invisibility and the robustness of the algorithms, we use the peak signal-to-noise ratio (PSNR) and normalized correlation (NC) as performance metrics. Experimental results demonstrate that invisibility and robustness are guaranteed. The proposed algorithm outperforms one based on curvelets for the lossy JPEG compression attack in terms of invisibility and robustness.
This paper presents a robust watermarking approach for hiding gray watermark into digital images. Conventional transform-based watermarking schemes provide only one transform plane for watermark embedding, which makes easy to remove embedded watermark information. Cellular automata transform (CAT) based watermarking scheme can address this problem with CA properties. In this paper, the watermark is first recorded in the form of an elemental image array (EIA) with the computational integral imaging (CII) system, and then the recorded EIA is embedded into the CAT coefficient. The watermark embedding coefficient will be determined by an alpha map which generated by saliency map. This proposed method can provide a more robust watermarking system because EIA is composed of many elemental images and each image has its own property of the watermark. Even though most data of elemental images are lost, the watermark can be reconstructed successfully by using the remaining elemental images. Furthermore, the alpha map which is generated by saliency map can make watermark more invisible for the human visual system. Some experimental results show competence of our system.
DWT-SVD is a frequency domain based eigenanalysis watermarking technique. In this work, we improve this method by exploring the relationship between the cover image's DWT singular values and those of the watermark. We show that, via the usage of curve fitting and robust regression, it is possible to achieve accurate results. We also demonstrate that the improved scheme is suitable for the watermarking of astronomy images. In addition to encoding and decoding examples, statistical results on stealth and robustness are deduced from the experiments so that the clear advance can be observed. Quality of the watermark is measured by testing against various attack types. © 2016, Kauno Technologijos Universitetas. All rights reserved.
A new approach to transparent embedding of data into digital images is proposed. It provides a high rate of the embedded data and is robust to common and some intentional distortions. The developed technique employs properties of the singular value decomposition (SVD) of a digital image. According to these properties each singular value (SV) specifies the luminance of the SVD image layer, whereas the respective pair of singular vectors specifies image geometry. Therefore slight variations of SVs cannot affect the visual perception of the cover image. The proposed approach is based on embedding a bit of data through slight modifications of SVs of a small block of the segmented covers. The approach is robust because it supposes to embed extra data into low bands of covers in a distributed way. The size of small blocks is used as an attribute to achieve a tradeoff between the embedded data rate and robustness. An advantage of the approach is that it is blind. Simulation has proved its robustness to JPEG up to 40%. The approach can be used both for hidden communication and watermarking.
Data hiding, a form of steganography, embeds data into digital media for the purpose of identification, annotation, and copyright. Several constraints affect this process: the quantity of data to be hidden, the need for invariance of these data under conditions where a "host" signal is subject to distortions, e.g., lossy compression, and the degree to which the data must be immune to interception, modification, or removal by a third party. We explore both traditional and novel techniques for addressing the data-hiding process and evaluate these techniques in light of three applications: copyright protection, tamper-proofing, and augmentation data embedding.
So far digital watermarking has been indicated as the most feasible answer for multimedia copyright protection issues, though many problems, especially regarding aspects of robustness against geometrical attacks, have not been completely and adequately solved yet. Robustness against geometric manipulations has been dealt with by inserting, together with the watermark, a synchronization template to be used later in the detection phase, to determine if a geometric distortion occurred and invert it before looking for the mark. A novel technique is presented, which, by exploiting the theory of geometric invariants, inserts a watermark intrinsically resistant to this sort of manipulations, thus avoiding the need of a synchronization pattern. Preliminary experimental results proving the goodness of the methodology are discussed along with some implementation problems due to the computational complexity.
A wavelet-based image watermarking scheme is proposed, based on
the insertion of pseudo-random codes in the frequency domain. The
original image is required for the watermark detection. The
“strength” of the signature to be embedded depends on the
image to be marked, thus fitting signal capacity. The experimental
results prove that the method is more tamper resistant and less
perceptible for any type of images than other well-known private methods
in the frequency domains
We present a novel technique for the digital watermarking of still
images based on the concept of multiresolution wavelet fusion. The
algorithm is robust to a variety of signal distortions. The original
unmarked image is not required for watermark extraction. We provide
analysis to describe the behaviour of the method for varying system
parameter values. We compare our approach with another transform domain
watermarking method. Simulation results show the superior performance of
the technique and demonstrate its potential for the robust watermarking
of photographic imagery
Three novel blind watermarking techniques are proposed to embed watermarks into digital images for different purposes. The watermarks are designed to be decoded or detected without the original images. The first one, called single watermark embedding (SWE), is used to embed a watermark bit sequence into digital images using two secret keys. The second technique, called multiple watermark embedding (MWE), extends SWE to embed multiple watermarks simultaneously in the same watermark space while minimizing the watermark (distortion) energy. The third technique, called iterative watermark embedding (IWE), embeds watermarks into JPEG-compressed images. The iterative approach of IWE can prevent the potential removal of a watermark in the JPEG recompression process. Experimental results show that embedded watermarks using the proposed techniques can give good image quality and are robust in varying degree to JPEG compression, low-pass filtering, noise contamination, and print-and-scan.
A digital image watermarking system that takes advantage of the Discrete Fourier Transform properties to embed a spread spectrum watermark in an image is presented in this paper. Watermark robustness to translation, rotation and scaling attacks is achieved with the proposed system. A description of the method is included and results are presented. 1.
We propose a watermarking scheme to hide copyright information in an image. The scheme employs visual masking to guarantee that the embedded watermark is invisible and to maximize the robustness of the hidden data. The watermark is constructed for arbitrary image blocks by filtering a pseudo-noise sequence (author id) with a filter that approximates the frequency masking characteristics of the visual system. The noise-like watermark is statistically invisible to deter unauthorized removal. Experimental results show that the watermark is robust to several distortions including white and colored noises, JPEG coding at di#erent qualities, and cropping. 1.
This paper proposes a unified approach to digital watermarking of images and video based on the two- and three-dimensional discrete wavelet transforms. The hierarchical nature of the wavelet representation allows multiresolutional detection of the digital watermark, which is a Gaussian distributed random vector added to all the high-pass bands in the wavelet domain. We show that when subjected to distortion from compression or image halftoning, the corresponding watermark can still be correctly identified at each resolution (excluding the lowest one) in the wavelet domain. Computational savings from such a multiresolution watermarking framework is obvious, especially for the video case
With the advent of digital technologies, many new market opportunities have emerged for content owners, content distributors, and consumer electronics/information technology industries. An essential requirement for developing a thriving marketplace is the protection of copyrighted content in digital form. There are four major stages in the delivery of content to the consumer: (1) capturing on digital media, (2) packaging, (3) distribution to home networks, and (4) transfer to the final audio/visual device within the home network. Entertainment content is of particular importance as it will be in high demand for many years to come. If an end-to-end security cannot be provided in a digital market, there would be no incentive for content creation. Lack of new supplies would result in detrimental effects for all the industries involved in the delivery chain. In this paper, we present the primary means of securing the entertainment content from creation to consumption in an attempt to understand the overall complexity of the problem.
The rapid evolution of digital image manipulation and transmission techniques has created a pressing need for the protection of the intellectual property rights on images. A copyright protection method that is based on hiding an ‘invisible’ signal, known as digital watermark, in the image is presented in this paper. Watermark casting is performed in the spatial domain by slightly modifying the intensity of randomly selected image pixels. Watermark detection does not require the existence of the original image and is carried out by comparing the mean intensity value of the marked pixels against that of the pixels not marked. Statistical hypothesis testing is used for this purpose. Pixel modifications can be done in such a way that the watermark is resistant to JPEG compression and lowpass filtering. This is achieved by minimizing the energy content of the watermark signal at higher frequencies while taking into account properties of the human visual system. A variation that generates image dependent watermarks as well as a method to handle geometrical distortions are presented. An extension to color images is also pursued. Experiments on real images verify the effectiveness of the proposed 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 associate to a digital document a code allowing the identification of the data creator, owner, authorized consumer, and so on. In this paper a new watermarking algorithm for digital images is presented: the method, which operates in the frequency domain, embeds a pseudo-random sequence of real numbers 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, low pass and median filtering, histogram equalization and stretching, dithering, addition of Gaussian noise, resizing, and multiple watermarking.
Access to multimedia data has become much easier due to the rapid growth of the Internet. While this is usually considered an improvement of everyday life, it also makes unauthorized copying and distributing of multimedia data much easier, therefore presenting a challenge in the field of copyright protection. Digital watermarking, which is inserting copyright information into the data, has been proposed to solve the problem. In this paper, we first discuss the features that a practical digital watermarking system for ownership verification requires. Besides perceptual invisibility and robustness, we claim that the private control of the watermark is also very important. Second, we present a novel wavelet-based watermarking algorithm. Experimental results and analysis are then given to demonstrate that the proposed algorithm is effective and can be used in a practical system.
Many electronic watermarks for still images and video content are sensitive to geometric distortions. For example, simple rotation, scaling, and/or translation (RST) of an image can prevent blind detection of a public watermark. In this paper, we propose a watermarking algorithm that is robust to RST distortions. The watermark is embedded into a one-dimensional (1-D) signal obtained by taking the Fourier transform of the image, resampling the Fourier magnitudes into log-polar coordinates, and then summing a function of those magnitudes along the log-radius axis. Rotation of the image results in a cyclical shift of the extracted signal. Scaling of the image results in amplification of the extracted signal, and translation of the image has no effect on the extracted signal. We can therefore compensate for rotation with a simple search, and compensate for scaling by using the correlation coefficient as the detection measure. False positive results on a database of 10,000 images are reported. Robustness results on a database of 2000 images are described. It is shown that the watermark is robust to rotation, scale, and translation. In addition, we describe tests examining the watermarks resistance to cropping and JPEG compression.
Digital watermarks have been proposed as a method for discouraging illicit copying and distribution of copyrighted material. This paper describes a method for the secure and robust copyright protection of digital images. We present an approach for embedding a digital watermark into an image using the Fourier transform. To this watermark is added a template in the Fourier transform domain to render the method robust against general linear transformations. We detail a new algorithm based on polar maps for the accurate and efficient recovery of the template in an image which has undergone a general affine transformation. We also present results which demonstrate the robustness of the method against some common image processing operations such as compression, rotation, scaling, and aspect ratio changes.
This paper presents a secure (tamper-resistant) algorithm for watermarking images, and a methodology for digital watermarking that may be generalized to audio, video, and multimedia data. We advocate that a watermark should be constructed as an independent and identically distributed (i.i.d.) Gaussian random vector that is imperceptibly inserted in a spread-spectrum-like fashion into the perceptually most significant spectral components of the data. We argue that insertion of a watermark under this regime makes the watermark robust to signal processing operations (such as lossy compression, filtering, digital-analog and analog-digital conversion, requantization, etc.), and common geometric transformations (such as cropping, scaling, translation, and rotation) provided that the original image is available and that it can be successfully registered against the transformed watermarked image. In these cases, the watermark detector unambiguously identifies the owner. Further, the use of Gaussian noise, ensures strong resilience to multiple-document, or collusional, attacks. Experimental results are provided to support these claims, along with an exposition of pending open problems.
In this paper, we present a technique for watermarking of digital images based on the singular value decomposition. Simulation results are provided which demonstrate the robustness of the proposed technique to a variety of common image degradations. The results of our approach are also compared to other transform domain watermarking methods.
This paper presents an algorithm for rotation and scale invariant
watermarking of digital images. An invisible mark is embedded in
magnitude of the DFT domain. It is robust to compression, filtering,
cropping, translation and rotation. The watermark introduces image
changes that are invisible to the human eye. The detection algorithm
does not require the original image
We introduce a new multiresolution watermarking method for digital images. The method is based on the discrete wavelet transform (DWT). Pseudo-random codes are added to the large coefficients at the high and middle frequency bands of the DWT of an image. It is shown that this method is more robust to often proposed methods to some common image distortions, such as the wavelet transform based image compression, and image halftoning. Moreover, the method is hierarchical. The computation load needed to detect the watermark depends on the noise level in an image
Signature (watermark) casting on digital images is an important
problem, since it affects many aspects of the information market. We
propose a method for casting digital watermarks on images and we analyze
its effectiveness. The satisfaction of some basic demands in this area
is examined and a method for producing digital watermarks is proposed.
Moreover, immunity to subsampling is examined and simulation results are
provided for the verification of the above mentioned topics
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
A watermark is an invisible mark placed on an image that is
designed to identify both the source of an image as well as its intended
recipient. The authors present an overview of watermarking techniques
and demonstrate a solution to one of the key problems in image
watermarking, namely how to hide robust invisible labels inside grey
scale or colour digital images
This paper proposes the differential energy watermarking (DEW)
algorithm for JPEG/MPEG streams. The DEW algorithm embeds label bits by
selectively discarding high frequency discrete cosine transform (DCT)
coefficients in certain image regions. The performance of the proposed
watermarking algorithm is evaluated by the robustness of the watermark,
the size of the watermark, and the visual degradation the watermark
introduces. These performance factors are controlled by three
parameters, namely the maximal coarseness of the quantizer used in
pre-encoding, the number of DCT blocks used to embed a single watermark
bit, and the lowest DCT coefficient that we permit to be discarded. We
follow a rigorous approach to optimizing the performance and choosing
the correct parameter settings by developing a statistical model for the
watermarking algorithm. Using this model, we can derive the probability
that a label bit cannot be embedded. The resulting model can be used,
for instance, for maximizing the robustness against re-encoding and for
selecting adequate error correcting codes for the label bit string
An approach to embedding gray scale images using a discrete wavelet transform is proposed. The proposed scheme enables using signature images that could be as much as 25% of the host image data and hence could be used both in digital watermarking as well as image/data hiding. In digital watermarking the primary concern is the recovery or checking for signature even when the embedded image has been changed by image processing operations. Thus the embedding scheme should be robust to typical operations such as low-pass filtering and lossy compression. In contrast, for data hiding applications it is important that there should not be any visible changes to the host data that is used to transmit a hidden image. In addition, in both data hiding and watermarking, it is desirable that it is difficult or impossible for unauthorized persons to recover the embedded signatures. The proposed scheme provides a simple control parameter that can be tailored to either hiding or watermarking purposes, and is robust to operations such as JPEG compression. Experimental results demonstrate that high quality recovery of the signature data is possible.
A new method for digital image watermarking which does not require the original image for watermark detection is presented. Assuming that we are using a transform domain spread spectrum watermarking scheme, it is important to add the watermark in select coe#cients with signi#cant image energy in the transform domain in order to ensure non-erasability of the watermark. Previous methods, which did not use the original in the detection process, could not selectively add the watermark to the signi#cant coe #cients, since the locations of such selected coe#- cients can change due to image manipulations. Since watermark veri#cation typically consists of a process of correlation which is extremely sensitive to the relative order in which the watermark coe#cients are placed within the image, suchchanges in the location of the watermarked coe#cients was unacceptable. We presentascheme whichovercomes this problem of #order sensitivity". Advantages of the proposed method include #i# improved resi...
The growth of networked multimedia systems has magnified the need for image copyright protection. One approach used to address this problem is to add an invisible structure to an image that can be used to seal or mark it. These structures are known as digital watermarks. In this paper we describe two techniques for the invisible marking of images. We analyze the robustness of the watermarks with respect to linear and nonlinear filtering, and JPEG compression. The results show that our watermarks detect all but the most minute changes to the image.
SVD-based Approach to Transparent Embedding Data into Digital Images International Workshop on Mathematical Methods, Models and Architectures for Computer Network Security (MMM-ACNS 2001), St. Petersburg, RussiaDigital Image Watermarking Using Singular Value Decomposition
- V I Gorodetski
- L J Popyack
- V Samoilov
- V A Skormin
V. I. Gorodetski, L. J. Popyack, V. Samoilov and V. A. Skormin, "SVD-based Approach to Transparent Embedding Data into Digital Images," International Workshop on Mathematical Methods, Models and Architectures for Computer Network Security (MMM-ACNS 2001), St. Petersburg, Russia, May 21-23, 2001. [21 D. V. S. Chandra, "Digital Image Watermarking Using Singular Value Decomposition," Proceedings of 45th IEEE Midwest Symposium on Circuits and Systems, Tulsa, OK, August 2002, pp. 264-267.
A SVD-Based Watermarking Scheme for Protecting Rightful Ownership
- R Liu
- T Tan
R. Liu and T. Tan, " A SVD-Based Watermarking Scheme for Protecting Rightful Ownership, " IEEE
Transactions on Multimedia, 4(1), March 2002, pp.121-128.