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.
In this paper, we propose a binary value based progressive image watermarking approach for digital right protection. The proposed method embed most watermark information into region of interest(ROI) of an image. Therefore, a client on Internet can decode the watermark while receiving the image, moreover, most watermark information would be decoded while the ROI of the image is received. In order to...
In this paper, we propose a digital watermarking method for stereoscopic video frames. A stereoscopic video frame is stored as two images and combined by software while displayed. These two stored images are with high similarity. In the circumstances, it should be taken into consideration to resist coalition attacks while developing a watermarking scheme for stereoscopic videos. As shown in experimental...
In this paper, we propose a binary value based progressive image watermarking approach for digital right protection. First, a new binary valued watermarking method for wavelet domain images are introduced, and then a progressive watermark detecting scheme for Internet environment is introduced. Its performance was evaluated with two types of experiments (1) robustness against image attacks and (2)...
Digital watermarking has been a practical and interesting research topic in the last decade. Recently, a newly developed branch called reversible data hiding has emerged. It has attracted more and more attention in both researches and applications. With the definition of reversible data hiding, secret message can be hidden by schemes offered by algorithm designers. On the other hand, at the data extraction...
Embedding watermarks into images can be referred to as a constrained optimization problem. Keeping image quality acceptable and maximizing watermark strength is more meaningful and applicable to a user than fixing strength parameter and minimizing distortion. In this paper, we propose an approach that hides watermarks in relationships between wavelet coefficients. This approach would maximize the...
Valuable images are usually acquired with higher resolution and deeper color depth. Hence, in this paper, we proposed a scheme based on cropping and downsampling to prevent the embedded fingerprints from average attack. We first generate an resized original image for each user with cropping and downsampling. This resized original image belonging to a particular user is then embedded with the fingerprint...
Digital watermarking, in conjunction with cryptography, is one of the two major categories for information security. Unlike cryptography that the encrypted information represents like noisy patterns, by using watermarking, the watermarked contents look almost identical to its original counterpart, while it still retains the capability to counteract intentional signal processing by others and keeps...
Digital watermarking has been a popular topic in both researches and applications in the last decade. Based on previous experiences in literature, designing one good watermarking algorithm is desired, and how to assess how good the algorithm is should be based on the preset requirements. Here we use one optimization technique named bacterial foraging and we employ the concept in fuzzy theory to design...
Wavelet packet transform can be viewed as a generalization of the discrete wavelet transform and a best wavelet basis in the sense of some cost metric can be found within a large library of permissible bases. In this paper, we proposed a genetic watermarking scheme based on the wavelet packet transform. Genetic algorithm is used to select an appropriate basis from permissible bases of wavelet packet...
A robust face watermarking scheme is proposed to provide a solution to copyright protection of semantic content. To address the issue of less robustness to geometric attacks in watermarking scheme, Zernike moments based invariant features are extracted and some selected Zernike moments are proposed to carry a multi-bit watermark. Watermark signal is embedded into face region in the intensity spatial...
Watermarking is a potential method for copyright protection and multimedia data authentication in the internet. The watermarking process can be considered as a communication task. In this paper, a novel watermarking scheme using code division multiple access (CDMA) modulation is proposed to achieve a superior performance in terms of robustness and imperceptibility. In the proposed scheme, every three...
This paper proposes an improved lossless compression algorithm based on the spatial-spectral hybrid prediction. We choose the prediction modes between the spatial and the spectral domains by computing the local correlation coefficient. If such coefficient is larger than the pre-designed threshold, the spectral linear predictor is adopted, which is able to capture more spectral correlation by re-estimating...
In this paper, we propose an application of robust watermarking with the aid of EXIF metadata in digital images. Application for robust watermarking is one of the major branches in digital rights management (DRM) systems. Furthermore, implementation schemes for robust watermarking generally alter selected pixels in the spatial domain, or corresponding coefficients in the transform domain, to accomplish...
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.