Showing papers on "Watermark published in 2006"

Digital camera identification from sensor pattern noise

Abstract: In this paper, we propose a new method for the problem of digital camera identification from its images based on the sensor's pattern noise. For each camera under investigation, we first determine its reference pattern noise, which serves as a unique identification fingerprint. This is achieved by averaging the noise obtained from multiple images using a denoising filter. To identify the camera from a given image, we consider the reference pattern noise as a spread-spectrum watermark, whose presence in the image is established by using a correlation detector. Experiments on approximately 320 images taken with nine consumer digital cameras are used to estimate false alarm rates and false rejection rates. Additionally, we study how the error rates change with common image processing, such as JPEG compression or gamma correction.

Optimization methods for the insertion, protection, and detection of digital watermarks in digitized data

Abstract: Disclosed herein are methods and systems for encoding digital watermarks into content signals. Also disclosed are systems and methods for detecting and/or verifying digital watermarks in content signals. According to one embodiment, a system for encoding of digital watermark information includes: a window identifier for identifying a sample window in the signal; an interval calculator for determining a quantization interval of the sample window; and a sampler for normalizing the sample window to provide normalized samples. According to another embodiment, a system for pre-analyzing a digital signal for encoding at least one digital watermark using a digital filter is disclosed. According to another embodiment, a method for pre-analyzing a digital signal for encoding digital watermarks comprises: (1) providing a digital signal; (2) providing a digital filter to be applied to the digital signal; and (3) identifying an area of the digital signal that will be affected by the digital filter based on at least one measurable difference between the digital signal and a counterpart of the digital signal selected from the group consisting of the digital signal as transmitted, the digital signal as stored in a medium, and the digital signal as played backed. According to another embodiment, a method for encoding a watermark in a content signal includes the steps of (1) splitting a watermark bit stream; and (2) encoding at least half of the watermark bit stream in the content signal using inverted instances of the watermark bit stream. Other methods and systems for encoding/decoding digital watermarks are also disclosed.

A Novel Synchronization Invariant Audio Watermarking Scheme Based on DWT and DCT

Abstract: Synchronization attack is one of the key issues of digital audio watermarking. In this correspondence, a blind digital audio watermarking scheme against synchronization attack using adaptive quantization is proposed. The features of the proposed scheme are as follows: 1) a kind of more steady synchronization code and a new embedded strategy are adopted to resist the synchronization attack more effectively; 2) he multiresolution characteristics of discrete wavelet transform (DWT) and the energy-compression characteristics of discrete cosine transform (DCT) are combined to improve the transparency of digital watermark; 3) the watermark is embedded into the low frequency components by adaptive quantization according to human auditory masking; and 4) the scheme can extract the watermark without the help of the original digital audio signal. Experiment results shows that the proposed watermarking scheme is inaudible and robust against various signal processing such as noise adding, resampling, requantization, random cropping, and MPEG-1 Layer III (MP3) compression

Security enhancements of digital watermarks for multi-media content

Abstract: Methods and apparatus for embedding digital watermarks into a digital host content are provided. A digital host content is received, e.g., at a receiver or other device incorporating a receiver. One or more watermark embedding technologies is selected. Multiple embedding opportunities are identified within the host content. A subset of the identified embedding opportunities is selected. A multiplicity of digital watermarks are then embedded into the host content in accordance with the selected subset of embedding opportunities utilizing the one or more selected watermark embedding technologies. The selecting of the subset of embedding opportunities may be adapted to provide a desired tradeoff between levels of robustness, security, and transparency of the watermark. A plurality of watermarking embedding technologies may be selected and used in the embedding step.

Robust and high-quality time-domain audio watermarking based on low-frequency amplitude modification

Abstract: This work proposes a method of embedding digital watermarks into audio signals in the time domain. The proposed algorithm exploits differential average-of-absolute-amplitude relations within each group of audio samples to represent one-bit information. The principle of low-frequency amplitude modification is employed to scale amplitudes in a group manner (unlike the sample-by-sample manner as used in pseudonoise or spread-spectrum techniques) in selected sections of samples so that the time-domain waveform envelope can be almost preserved. Besides, when the frequency-domain characteristics of the watermark signal are controlled by applying absolute hearing thresholds in the psychoacoustic model, the distortion associated with watermarking is hardly perceivable by human ears. The watermark can be blindly extracted without knowledge of the original signal. Subjective and objective tests reveal that the proposed watermarking scheme maintains high audio quality and is simultaneously highly robust to pirate attacks, including MP3 compression, low-pass filtering, amplitude scaling, time scaling, digital-to-analog/analog-to-digital reacquisition, cropping, sampling rate change, and bit resolution transformation. Security of embedded watermarks is enhanced by adopting unequal section lengths determined by a secret key.

A Review of Image Watermarking Applications in Healthcare

Abstract: In this article, we focus on the complementary role of watermarking with respect to medical information security (integrity, authenticity ) and management We review sample cases where watermarking has been deployed, we conclude that watermarking has found a niche role in healthcare systems, as an instrument for protection of medical information, for secure sharing and handling of medical images The concern of medical experts on the preservation of documents diagnostic integrity remains paramount

Digital image watermarking using balanced multiwavelets

Abstract: In this paper, a robust watermarking algorithm using balanced multiwavelet transform is proposed. The latter transform achieves simultaneous orthogonality and symmetry without requiring any input prefiltering. Therefore, considerable reduction in computational complexity is possible, making this transform a good candidate for real-time watermarking implementations such as audio broadcast monitoring and DVD video watermarking. The embedding scheme is image adaptive using a modified version of a well-established perceptual model. Therefore, the strength of the embedded watermark is controlled according to the local properties of the host image. This has been achieved by the proposed perceptual model, which is only dependent on the image activity and is not dependent on the multifilter sets used, unlike those developed for scalar wavelets. This adaptivity is a key factor for achieving the imperceptibility requirement often encountered in watermarking applications. In addition, the watermark embedding scheme is based on the principles of spread-spectrum communications to achieve higher watermark robustness. The optimal bounds for the embedding capacity are derived using a statistical model for balanced multiwavelet coefficients of the host image. The statistical model is based on a generalized Gaussian distribution. Limits of data hiding capacity clearly show that balanced multiwavelets provide higher watermarking rates. This increase could also be exploited as a side channel for embedding watermark synchronization recovery data. Finally, the analytical expressions are contrasted with experimental results where the robustness of the proposed watermarking system is evaluated against standard watermarking attacks.

Halftone watermarking and related applications

Abstract: Digital watermark embedding is incorporated into processes for generating halftone images. In a halftone process using a halftone screen, the halftone screen is used to determine the geometric distortion of an image. After determining the geometric distortion, a watermark decoder compensates for this distortion and retrieves an embedded digital watermark.

Image watermarking based on invariant regions of scale-space representation

Abstract: This paper proposes a novel content-based image watermarking method based on invariant regions of an image. The invariant regions are self-adaptive image patches that deform with geometric transformations. Three different invariant-region detection methods based on the scale-space representation of an image were considered for watermarking. At each invariant region, the watermark is embedded after geometric normalization according to the shape of the region. By binding watermarking with invariant regions, resilience against geometric transformations can be readily obtained. Experimental results show that the proposed method is robust against various image processing steps, including geometric transformations, cropping, filtering, and JPEG compression.

Localized audio watermarking technique robust against time-scale modification

Abstract: Synchronization attacks like random cropping and time-scale modification are very challenging problems to audio watermarking techniques. To combat these attacks, a novel content-dependent localized robust audio watermarking scheme is proposed. The basic idea is to first select steady high-energy local regions that represent music edges like note attacks, transitions or drum sounds by using different methods, then embed the watermark in these regions. Such regions are of great importance to the understanding of music and will not be changed much for maintaining high auditory quality. In this way, the embedded watermark has the potential to escape all kinds of distortions. Experimental results show strong robustness against common audio signal processing, time-domain synchronization attacks, and most distortions introduced in Stirmark for Audio.

On the secrecy of timing-based active watermarking trace-back techniques

Abstract: Timing-based active watermarking schemes are developed to trace back attackers through stepping stone connections or anonymizing networks. By slightly changing packet timing, these schemes achieve robust correlation for encrypted network connections under timing perturbation. However, the manipulation on packet timing makes the schemes themselves a potential target of intelligent attackers. In this paper, we analyze the secrecy of the timing-based active watermarking techniques for tracing through stepping stones, and propose an attack scheme based on analyzing the packet delays between adjacent stepping stones. We develop attack techniques to infer important watermark parameters, and to recover and duplicate embedded watermarks. The resulting techniques enable an attacker to defeat the tracing systems in certain cases by removing watermarks from the stepping stone connections, or replicating watermarks in non-stepping stone connections. We also develop techniques to determine in real-time whether a stepping stone connection is being watermarked for trace-back purposes. We have performed substantial experiments using real-world data to evaluate these techniques. The experimental results demonstrate that for the watermark scheme being attacked (1) embedded watermarks can be successfully recovered and duplicated when the watermark parameters are not chosen carefully, and (2) the existence of watermarks in a network flow can always be quickly detected.

A reversible watermarking based on histogram shifting

Abstract: In this paper, we propose a reversible watermarking algorithm where an original image can be recovered from watermarked image data. Most watermarking algorithms cause degradation of image quality in original digital content in the process of embedding watermark. In the proposed algorithm, the original image can be obtained when the degradation is removed from the watermarked image after extracting watermark information. In the proposed algorithm, we utilize a peak point of image histogram and the location map and modify pixel values slightly to embed data. Because the peak point of image histogram and location map are employed in this algorithm, there is no need of extra information transmitted to receiving side. Also, because a slight modification on pixel values is conducted, highly imperceptibly images can be achieved. As locations of watermark embedding are identified using location map, amount of watermark data can dramatically increases through recursive embedding. Experimental results show that it can embed 5K to 130K bits of additional data.

Robust image watermarking using local invariant features

Abstract: This paper addresses a novel robust watermarking method for digital images using local invariant features. Most previous water- marking algorithms are unable to resist geometric distortions that desyn- chronize the location where copyright information is inserted. We pro- pose a watermarking method that is robust to geometric distortions. In order to resist geometric distortions, we use a local invariant feature of the image called the scale-invariant feature transform SIFT, which is invariant to translation and scaling distortions. The watermark is inserted into the circular patches generated by the SIFT. Rotation invariance is achieved using the translation property of the polar-mapped circular patches. Our method belongs to the blind watermark, because we do not need the original image during detection. We have performed an inten- sive simulation to show the robustness of the proposed method. The simulation results support the contention that our method is robust against geometric distortion attacks as well as signal-processing attacks. We have compared our results with those of other methods, and our method outperforms them. © 2006 Society of Photo-Optical Instrumentation

A reversible watermarking based on histogram shifting

Abstract: In this paper, we propose a reversible watermarking algorithm where an original image can be recovered from watermarked image data. Most watermarking algorithms cause degradation of image quality in original digital content in the process of embedding watermark. In the proposed algorithm, the original image can be obtained when the degradation is removed from the watermarked image after extracting watermark information. In the proposed algorithm, we utilize a peak point of image histogram and the location map and modify pixel values slightly to embed data. Because the peak point of image histogram and location map are employed in this algorithm, there is no need of extra information transmitted to receiving side. Also, because a slight modification on pixel values is conducted, highly imperceptibly images can be achieved. As locations of watermark embedding are identified using location map, amount of watermark data can dramatically increases through recursive embedding. Experimental results show that it can embed 5K to 130K bits of additional data.

Analysis and design of secure watermark-based authentication systems

Abstract: This paper focuses on a coding approach for effective analysis and design of secure watermark-based multimedia authentication systems. We provide a design framework for semi-fragile watermark-based authentication such that both objectives of robustness and fragility are effectively controlled and achieved. Robustness and fragility are characterized as two types of authentication errors. The authentication embedding and verification structures of the semi-fragile schemes are derived and implemented using lattice codes to minimize these errors. Based on the specific security requirements of authentication, cryptographic techniques are incorporated to design a secure authentication code structure. Using nested lattice codes, a new approach, called MSB-LSB decomposition, is proposed which we show to be more secure than previous methods. Tradeoffs between authentication distortion and implementation efficiency of the secure authentication code are also investigated. Simulations of semi-fragile authentication methods on real images demonstrate the effectiveness of the MSB-LSB approach in simultaneously achieving security, robustness, and fragility objectives.

Reversible Visible Watermarking and Lossless Recovery of Original Images

Abstract: In this paper, we propose a reversible visible watermarking algorithm to satisfy a new application scenario where the visible watermark serves as a tag or ownership identifier, but can be completely removed to resume the original image data. It includes two procedures: data hiding and visible watermark embedding. In order to losslessly recover both the watermark-covered and nonwatermark-covered image contents at the receiver end, the payload consists of two reconstruction data packets, one for recovering the watermark-covered region, and the other for the nonwatermark-covered region. The data hiding technique reversibly hides the payload in the image region not covered by the visible watermark. To satisfy the requirements of large capacity and high image quality, our hiding technique is based on data compression and uses a payload-adaptive scheme. It further adopts error diffusion for improving subjective image quality and arithmetic compression using a character-based model for increasing computational efficiency. The visible watermark is securely embedded based on a user-key-controlled embedding mechanism. The data hiding and the visible watermark embedding procedures are integrated into a secure watermarking system by a specially designed user key

Software watermarking via opaque predicates: Implementation, analysis, and attacks

Abstract: Within the software industry software piracy is a great concern. In this article we address this issue through a prevention technique called software watermarking. Depending on how a software watermark is applied it can be used to discourage piracy; as proof of authorship or purchase; or to track the source of the illegal redistribution. In particular we analyze an algorithm originally proposed by Genevieve Arboit in A Method for Watermarking Java Programs via Opaque Predicates. This watermarking technique embeds the watermark by adding opaque predicates to the application. We have found that the Arboit technique does withstand some forms of attack and has a respectable data-rate. However, it is susceptible to a variety of distortive attacks. One unanswered question in the area of software watermarking is whether dynamic algorithms are inherently more resilient to attacks than static algorithms. We have implemented and empirically evaluated both static and dynamic versions within the SandMark framework.

An algorithm for removable visible watermarking

Abstract: A visible watermark may convey ownership information that identifies the originator of image and video. A potential application scenario for visible watermarks was proposed by IBM where an image is originally embedded with a visible watermark before posting on the web for free observation and download. The watermarked image which serves as a "teaser." The watermark can be removed to recreate the unmarked image by request of interested buyers. Before we can design an algorithm for satisfying this application, three basic problems should be solved. First, we need to find a strategy suitable for producing large amount of visually same but numerically different watermarked versions of the image for different users. Second, the algorithm should let the embedding parameters reachable for any legal user to make the embedding process invertible. Third, an unauthorized user should be prevented from removing the embedded watermark pattern. In this letter, we propose a user-key-dependent removable visible watermarking system (RVWS). The user key structure decides both the embedded subset of watermark and the host information adopted for adaptive embedding. The neighbor-dependent embedder adjusts the marking strength to host features and makes unauthorized removal very difficult. With correct user keys, watermark removal can be accomplished in "informed detection" and the high quality unmarked image can be restored. In contrast, unauthorized operation either overly or insufficiently removes the watermark due to wrong estimation of embedding parameters, and thus, the resulting image has apparent defect.

Efficient spatial image watermarking via new perceptual masking and blind detection schemes

Abstract: The aim of this paper is to improve the performance of spatial domain watermarking. To this end, a new perceptual mask and a new detection scheme are proposed. The proposed spatial perceptual mask is based on the cover image prediction error sequence and matches very well with the properties of the human visual system. It exhibits superior performance compared to existing spatial masking schemes. Moreover, it allows for a significantly increased strength of the watermark while, at the same time, the watermark visibility is decreased. The new blind detection scheme comprises an efficient prewhitening process and a correlation-based detector. The prewhitening process is based on the least-squares prediction error filter and substantially improves the detector's performance. The correlation-based detector that was selected is shown to be the most suitable for the problem at hand. The improved performance of the proposed detection scheme has been justified theoretically for the case of linear filtering plus noise attack and through extensive simulations. The theoretical analysis is independent of the proposed mask and the derived expressions can be used for any watermarking technique based on spatial masking. It is shown though that in most cases the detector performs better if the proposed mask is employed.

Digital watermark padding method, digital watermark padding device, digital watermark detecting method, digital watermark detecting device, and program

Abstract: A digital watermark embedding method of the present invention includes: a step of sequentially obtaining each frame image of the moving image data and frame display time; a step of generating a watermark pattern using watermark information, the frame display time and watermark pattern switching information; a step of superimposing the watermark pattern onto the frame image, and combining watermark embedded frame images obtained by sequentially repeating the processes to generate watermark embedded moving image data A digital watermark detection method includes a step of sequentially obtaining a frame image; a step of generating a difference image between the currently obtained frame image and a previously obtained frame image; and a step of performing digital watermark detection from the difference image to output digital watermark detection status, and when digital watermark detection process is continued, obtaining a new frame again to repeat the above processes

Blind MPEG-2 video watermarking robust against geometric attacks: a set of approaches in DCT domain

Abstract: A set of robust MPEG-2 video watermarking techniques is proposed, focusing on commonly used typical geometric processing for bit-rate reduction, cropping, removal of any rows, arbitrary-ratio downscaling, and frame dropping. Both the embedding and the extraction of watermarks are done in the compressed domain, so the computational cost is low. Moreover, the watermark extraction is blind, i.e., no original unwatermarked MPEG-2 video is needed for watermark extraction. The presented technique is applicable not only to MPEG-2 video, but also to other DCT-based coding videos. Selected experimental results validate our techniques.

Watermark-based personal audio appliance

Abstract: A portable device uses a microphone to listen to ambient audio, decodes a watermark signal therein, and uses the decoded data to request delivery of the audio or related information to the user's home or other location The device is desirably pocket-sized, or suitable for carrying on a key-ring The device may also detect a second watermark signal that is present in the user's environment (eg, played through a public address speaker system) to aid the user in recalling the context from which the audio was requested

Secure watermark embedding through partial encryption

Abstract: Secure watermark embedding allows to securely embed a watermark into a piece of content at an untrusted user device without compromising the security of the watermark key, the watermark or the original. In this paper, we show how secure embedding can be achieved by using traditional watermarking schemes in conjunction with partial encryption techniques, which were primarily developed to facilitate fast encryption of media content. Based on this concept, we develop two new efficient secure embedding mechanisms, one for the MASK watermarking scheme operating on baseband audio and one for a spread spectrum watermarking scheme operating on MPEG-2 encoded video streams.

Lossless Visible Watermarking

Abstract: The embedding distortion of visible watermarking is usually larger than that of invisible watermarking. In order to maintain the signal fidelity after the watermark extraction, "lossless" property is highlighted in the visible watermarking. In this paper, we propose two lossless visible watermarking algorithms, Pixel Value Matching Algorithm (PVMA) and Pixel Position Shift Algorithm (PPSA). PVMA uses the bijective intensity mapping function to watermark a visible logo whereas PPSA uses circular pixel shift to improve the visibility of the watermark in the high variance region. For the application of medical and military, as they are sensitive to distortion, PVMA and PPSA can be used to insert a visible logo to prevent unauthorized use.

Secure buyer-seller watermarking protocol

Abstract: In the existing watermarking protocols, a trusted third party (TTP) is introduced to guarantee that a protocol is fair to both the seller and buyer in a digital content transaction. However, the TTP decreases the security and affects the protocol implementa- tion. To address this issue, in this article a secure buyer-seller watermarking protocol without the assistance of a TTP is proposed in which there are only two participants, a seller and a buyer. Based on the idea of sharing a secret, a watermark embedded in digital content to trace piracy is composed of two pieces of secret information, one produced by the seller and one by the buyer. Since neither knows the exact watermark, the buyer cannot remove the watermark from watermarked digital content, and at the same time the seller cannot fabricate piracy to frame an innocent buyer. In other words, the proposed protocol can trace piracy and protect the customer's rights. In addition, because no third party is introduced into the proposed protocol, the problem of a seller (or a buyer) colluding with a third party to cheat the buyer (or the seller), namely, the conspiracy problem, can be avoided.

A contrast-sensitive visible watermarking scheme

Abstract: The authors use a visible watermarking algorithm for digital rights management that computes composite coefficients using global and local characteristics of the host and watermark images. They also use a contrast-sensitive function and block classification in the discrete wavelet transform domain for a better visual effect. The original and watermark images are divided into different blocks and classified based on visual masking. Experiments indicate that this approach provides a better visual effect than other schemes.

Pseudo no reference image quality metric using perceptual data hiding

Abstract: Regarding the important constraints due to subjective quality assessment, objective image quality assessment has recently been extensively studied. Such metrics are usually of three kinds, they might be Full Reference (FR), Reduced Reference (RR) or No Reference (NR) metrics. We focus here on a new technique, which recently appeared in quality assessment context: data-hiding-based image quality metric. Regarding the amount of data to be transmitted for quality assessment purpose, watermarking based techniques are considered as pseudo noreference metric: A little overhead due to the embedded watermark is added to the image. Unlike most existing techniques, the proposed embedding method exploits an advanced perceptual model in order to optimize both the data embedding and extraction. A perceptually weighted watermark is embedded into the host image, and an evaluation of this watermark allows to assess the host image's quality. In such context, the watermark robustness is crucial; it must be suffciently robust to be detected after very strong distortions, but it must also be suffciently fragile to be degraded along with the host image. In other words, the watermark distortion must be proportional to the image's distortion. Our work is compared to existing standard RR and NR metrics in terms of both the correlation with subjective assessment and of data overhead induced by the mark.