The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
With the advent of various image processing tools, images can be easily counterfeited or corrupted. Digital image watermarking has emerged as an important tool for protection and authentication of digital multimedia content. This paper presents a robust DCT-based blind digital watermarking scheme for still color images. RGB color space has been used to decompose the color cover image into three channels...
Lossy compression is inherently contradictory with watermarking and makes the watermark retrieval unreliable. In this paper, we propose a watermarking technique capable to correctly retrieve watermark in both image and video, where watermarking is combined with JPEG/MPEG compression standards to adaptively obtain a proper trade-off among imperceptibility, achievable embedding capacity and robustness...
In the digital watermarking with DCT method, the watermark is located within a range of DCT coefficients of the cover image. In this paper a new method is proposed by using a combination of the DCT and PCA transform in order to use the low-frequency band for the color image. First, the digital color image is transformed into YCbCr from RGB color space and the luminance (Y) component is divided into...
A chaotic map-based hybrid watermarking scheme incorporating the concepts of the Discrete Cosine Transform (DCT) and exploiting the stability of the singular values has been proposed here. Homogeneity Analysis of the cover image has been done to chalk out appropriates sites for embedding and thereafter, a reference image has been obtained from it. The singular values of the reference image has been...
In this paper a new robust, spread-spectrum image watermarking approach is proposed. A two level wavelet transform is applied to the host image. Then three high frequency sub-bands in level 2 are selected and the watermark is embedded by an spread-spectrum technique. Selected sub-bands are divided into square blocks. Each block carries Nb bits of watermark information. Watermark data is added as uncorrelated...
We propose a new recoverable visible digital image watermarking method based on the dyadic lifting scheme. This method generates a visible watermarked image by embedding a binary logo into an image using the dyadic wavelet transform (DYWT) and interval arithmetic (IA).The dyadic lifting scheme contains free parameters that enable us to construct filters having features of the original image. Our method...
For any digital watermarking system many requirements should be available. The most important requirements are imperceptibility (quality), and robustness. Many studies have tried to enhance these requirements by using different techniques and methods. In this study, a trade-off between the two requirements to find the optimal value based on the existing Dual Intermediate Significant Bit (DISB) and...
This paper proposes a design for data hiding in digital image that robust with both geometric and common signal attacks. In our method, the watermark is embedded into normalized-based moments robust against affine transforms. In our new approach Contourlet will be used to perform embedding and extracting algorithm.
In recent years, many studies have been carried out about information security and watermarking. The main idea of this proposed method is to implement a invisible binary watermarking application based on Discrete Cosine Transform (DCT) and skewness thresholding. Thanks to the use of skewness values, distribution properties of DCT coefficients in blocks can be identified for robust watermarking process...
Digital watermarking has been widely used for copyright protection for multimedia data. This paper proposes a new watermarking method of image for copyright protection based on Hadamard transform. This method can embed or hide an entire image or pattern as a watermark such as a company's logo or trademark directly into original image for copyright protection. This watermarking method deals with the...
In this paper we make contributions to a non-blind multiple watermarking scheme that proceeds by embedding a binary image in the discrete wavelet transform bands of a gray scale image. Unlike the common wavelet based watermarking techniques, the proposed scheme lies essentially on marking the approximation and diagonal bands of the discrete wavelet transform (DWT) of the cover image achieving a better...
This paper demonstrates how channel coding can improve the robustness of spatial image watermarks against JPEG DCT-based compression. Two error-correction coding (ECC) schemes are used here. One scheme, referred to as the vertical ECC (VECC), is to encode information bits in pixel levels by error-correction coding where the Gray code is used to improve the performance. The other scheme, referred to...
This paper presents an improved wavelet-tree watermarking scheme for copyright protection. We decompose an image into four-level subbands and group the subband coefficients into many wavelet-trees. The N-bit watermark is embedded into the first N shuffled trees. An improved scheme based on changing only one coefficient of each tree is proposed to embed a watermark bit. Compared with the previous wavelet-tree...
Nowadays, the copyright laws protecting the digital content are getting quite common. Protecting the original or compressed images against illegal usage can be realized by means of watermarking methods. Nevertheless, various types of attacks are still a problem for many watermarking algorithms. In this paper, we proposed watermarking algorithms for grayscale and color images resisting to many common...
In this paper we present a robust watermarking method, in which the watermark is embedded into the magnitude of the middle frequencies of the Discrete Fourier Transform (DFT). To allow the correct watermark detection, even if the image has been distorted, the Speeded Up Robust Feature (SURF) is used. During the embedding process the SURF points are estimated and stored in advance to be used during...
This paper shows probability of watermarking using Contourlet transform domain under trade-off increasing payload. We continue to develop our previous methods to achieve better results. Experiment results prove our technique is robust from desynchronization attacks as well as other common attacks with a high payload especially for medical images. Our approach improves the performance of the watermarking...
Currently, robust, invisible double digital watermarking technology becomes the most popular and challenging direction, it has aroused great concern in the international community in recent years. The single watermark algorithms always merely have single function. In order to overcome the drawbacks, a multi-purpose dual watermark algorithm based on wavelet transform and image partition is presented...
Digital watermarking techniques have been used as one of the means for copyright protection and authentication of multimedia data. Conventional Singular Value Decomposition (SVD)-based and Chinese Remainder Theorem (CRT)-based spatial domain watermark techniques do not perform well under JPEG compression. However, it is seen that the CRT-based watermarking technique in Discrete Cosine Transform (DCT)...
Generally CAT is used in image compression and encryption. In this paper a novel watermarking algorithm based on cellular automata transform (CAT) is proposed. A binary watermark is embedded in a certain sub-band, which is further subdivided into non-overlapped blocks, after the original image is disassembled with two-dimensional CAT. Then choose one coefficient of each block, and embed a bit of watermark...
This paper proposes a novel informed embedding method based on a modified trellis structure for a digital watermarking system. This algorithm are capable of embedding adaptive robust watermarking bits according to various length of linear block codes in a host image of size 512×512 pixels. Instead of using randomly generated reference vectors as arc labels, this algorithm employs the codewords of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.