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.
This paper proposes a novel digital watermarking technique based on BP neural networks in wavelet domain. Firstly, the original image is decomposed by DTCWT, and then the watermark bits are added to the selected coefficients blocks. Because of the learning and adaptive capabilities of neural networks, the trained neural networks can recover the watermark from the watermarked images. Experimental results...
The Spread Transform (ST) robustness facing a Temporal Frame Averaging (TFA) is studied in this paper. Our analysis provides new insights on the effect of the TFA attack in the context of video watermarking when the ST is used. To remove the interferences and the attenuation of the watermark caused by the TFA attack, an adaptation of the Spread Transform is proposed. Our solution is based on the embedding...
In this paper, a new blind scaling based watermarking approach is presented. The host signal is assumed to be stationary Gaussian with first-order autoregressive model. Partitioning the host signal into two separate parts, the data is embedded in one part and the other is kept unchanged for blind parameter estimation. Driving the distribution of the decision variable we have suggested a maximum likelihood...
In this paper we present a blind low frequency watermarking scheme on gray level images, which is based on DCT transform and spread spectrum communications technique. We compute the DCT of non overlapping 8times8 blocks of the hostimage, then using the DC coefficients of each block we construct a low-resolution approximation image. We apply block based DCT on this approximation image, then a pseudo...
Watermarking techniques are proposed as a solution to copyright protection of digital media files. Watermarking algorithms are mainly concentrated on spatial or spectral domains. In this work, a robust and high capacity watermarking method that is based on spatio-frequency (SF) representations is presented. We use the discrete evolutionary transform (DET) to represent an image in the SF domain. A...
In this paper, we proposed the digital watermarking algorithm in the transform domain. The main point of our algorithm is that the embedding system uses the relation of thresholds for watermark insertion. In the first, discrete wavelet transform is involved to calculate energy strength, and then we determined the range for watermark insertion by the priority of interrelation between threshold value...
Watermarking techniques are used as a solution to copyright protection of digital media files. In this work, a new and robust watermarking method that is based on spatio-frequency (SF) representations is presented. We use the discrete evolutionary transform calculated by the Gabor expansion to represent an image in the SF domain. A watermark is embedded onto selected cells in the joint SF domain....
In this paper, a new multiplicative image watermarking system is presented. As human visual system is less sensitive to the image edges, watermarking is applied in the contourlet domain, which represents image edges sparsely. In the presented scheme, watermark data is embedded in the most energetic directional subband. By modeling general gaussian distribution (GGD) for the contourlet coefficients,...
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.