Results 1 - 10
of
96
The Gaussian Watermarking Game
, 2000
"... Watermarking models a copyright protection mechanism where an original source sequence or "covertext" is modified before distribution to the public in order to embed some extra information. The embedding should be transparent (i.e., the modified data sequence or "stegotext" shoul ..."
Abstract
-
Cited by 139 (9 self)
- Add to MetaCart
Watermarking models a copyright protection mechanism where an original source sequence or "covertext" is modified before distribution to the public in order to embed some extra information. The embedding should be transparent (i.e., the modified data sequence or "stegotext" should be similar to the covertext) and robust (i.e., the extra information should be recoverable even if the stegotext is modified further, possibly by a malicious "attacker"). We compute the coding capacity of the watermarking game for a Gaussian covertext and squared-error distortions. Both the public version of the game (covertext known to neither attacker nor decoder) and the private version of the game (covertext unknown to attacker but known to decoder) are treated. While the capacity of the former cannot, of course, exceed the capacity of the latter, we show that the two are, in fact, identical. These capacities depend critically on whether the distortion constraints are required to be met in expectation or with probability one. In the former case the coding capacity is zero, whereas in the latter it coincides with the value of related zero-sum dynamic mutual informations games of complete and perfect information. # Parts of this work were presented at the 2000 Conference on Information Sciences and Systems (CISS '00), Princeton University, Princeton, NJ, March 15--17, 2000, and at the 2000 IEEE International Symposium on Information Theory (ISIT '00), Sorrento, Italy, June 25--30, 2000.
Wavelet tree quantization for copyright protection watermarking
- IEEE Transactions on Image Processing
, 2004
"... Abstract—This paper proposes a wavelet-tree-based blind wa-termarking scheme for copyright protection. The wavelet coeffi-cients of the host image are grouped into so-called super trees. The watermark is embedded by quantizing super trees. The trees are so quantized that they exhibit a large enough ..."
Abstract
-
Cited by 54 (0 self)
- Add to MetaCart
(Show Context)
Abstract—This paper proposes a wavelet-tree-based blind wa-termarking scheme for copyright protection. The wavelet coeffi-cients of the host image are grouped into so-called super trees. The watermark is embedded by quantizing super trees. The trees are so quantized that they exhibit a large enough statistical dif-ference, which will later be used for watermark extraction. Each watermark bit is embedded in perceptually important frequency bands, which renders the mark more resistant to frequency based attacks. Also, the watermark is spread throughout large spatial re-gions. This yields more robustness against time domain geometric attacks. Examples of various attacks will be given to demonstrate the robustness of the proposed technique. Index Terms—Blind watermarking, copyright protection, quan-tization, wavelet.
Advances in Digital Video Content Protection
, 2005
"... The use of digital video offers immense opportunities for creators; however, the ability for anyone to make perfect copies and the ease by which those copies can be distributed also facilitate misuse, illegal copying and distribution (“piracy”), plagiarism, and misappropriation. Popular Internet sof ..."
Abstract
-
Cited by 37 (8 self)
- Add to MetaCart
The use of digital video offers immense opportunities for creators; however, the ability for anyone to make perfect copies and the ease by which those copies can be distributed also facilitate misuse, illegal copying and distribution (“piracy”), plagiarism, and misappropriation. Popular Internet software based on a peer-to-peer architecture has been used to share copyrighted movies, music, software, and other materials. Concerned about the consequences of illegal copying and distribution on a massive scale, content owners are interested in digital rights management (DRM) systems which can protect their rights and preserve the economic value of digital video. A DRM system protects and enforces the rights associated with the use of digital content. Unfortunately, the technical challenges for securing digital content are formidable and previous approaches have not succeeded. We overview the concepts and approaches for video DRM and describe methods for providing security, including the roles of encryption and video watermarking. Current efforts and issues are described in encryption, watermarking, and key management. Lastly, we identify challenges and directions for further investigation in video DRM.
Forensic Analysis of Nonlinear Collusion Attacks for Multimedia Fingerprinting
- IEEE Transactions on Image Processing
, 2005
"... Abstract—Digital fingerprinting is a technology for tracing the distribution of multimedia content and protecting them from unauthorized redistribution. Unique identification information is embedded into each distributed copy of multimedia signal and serves as a digital fingerprint. Collusion attack ..."
Abstract
-
Cited by 36 (14 self)
- Add to MetaCart
(Show Context)
Abstract—Digital fingerprinting is a technology for tracing the distribution of multimedia content and protecting them from unauthorized redistribution. Unique identification information is embedded into each distributed copy of multimedia signal and serves as a digital fingerprint. Collusion attack is a cost-effective attack against digital fingerprinting, where colluders combine several copies with the same content but different fingerprints to remove or attenuate the original fingerprints. In this paper, we investigate the average collusion attack and several basic nonlinear collusions on independent Gaussian fingerprints, and study their effectiveness and the impact on the perceptual quality. With unbounded Gaussian fingerprints, perceivable distortion may exist in the fingerprinted copies as well as the copies after the collusion attacks. In order to remove this perceptual distortion, we introduce bounded Gaussian-like fingerprints and study their performance under collusion attacks. We also study several commonly used detection statistics and analyze their performance under collusion attacks. We further propose a preprocessing technique of the extracted fingerprints specifically for collusion scenarios to improve the detection performance. Index Terms—Digital forensics, multimedia fingerprinting, nonlinear collusion attacks, spread spectrum embedding, traitor tracing. I.
Digital watermarking of low bit-rate advanced simple profile MPEG-4 compressed video
- IEEE Trans. Circuits Syst. Video Technol
, 2003
"... ..."
Temporal synchronization in video watermarking
- IEEE TRANSACTIONS ON SIGNAL PROCESSING
, 2004
"... One of the challenges for blind watermark detection is synchronization. Synchronization is the process of identifying the coordinates of an embedded watermark and is crucial in successful watermark detection. If the detector’s input is watermarked but synchronization fails, then the embedded waterma ..."
Abstract
-
Cited by 15 (6 self)
- Add to MetaCart
One of the challenges for blind watermark detection is synchronization. Synchronization is the process of identifying the coordinates of an embedded watermark and is crucial in successful watermark detection. If the detector’s input is watermarked but synchronization fails, then the embedded watermark will not be detected. In this paper, temporal synchronization for blind video watermark detection is examined by developing new models for watermark embedding and detection. The structure of the watermark, and specifically its key schedule, dramatically affects the ease of synchronization. The new embedder models the construction of the watermark by using a state machine key generator. The key generator can produce time-invariant, time-independent, and time-periodic key schedules as special cases. The watermark detector uses a queue and a state predictor to perform a search to establish and maintain temporal synchronization. These models are general and can be applied to many symmetric blind video watermarking techniques. It is shown that a watermark without temporal redundancy in its key schedule is vulnerable to attacks such as frame dropping and transposition. Using the models, a watermark more resilient against temporal synchronization attacks is designed by adding temporal redundancy in the watermark construction. Experimental results from an implementation of the models are presented.
Geometric hashing techniques for watermarking
- in ICIP 2001, 2001, p. Watermarking i
, 2001
"... In this paper we introduce the idea of using Computer Vision techniques for improving and enhancing watermarking capabilities. Specifically, we incorporate Geometric Hashing techniques into the watermarking methodology. Geometric Hashing was developed to detect objects in a visual scene under a clas ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
(Show Context)
In this paper we introduce the idea of using Computer Vision techniques for improving and enhancing watermarking capabilities. Specifically, we incorporate Geometric Hashing techniques into the watermarking methodology. Geometric Hashing was developed to detect objects in a visual scene under a class of geometric transformations. The technique is incorporated into watermarking to detect watermarks encoded under transformations. This allows randomization of the watermark code without the need of maintaining the Random Generator seed. In turn, this randomization increases robustness under attacks such as collusion (determining the watermark from multiple watermarked examples). Depending on the embedding domain, robustness of the watermark under geometric attacks can be achieved. 1.
Robust and Blind Watermarking of Relational Database Systems
, 2008
"... ... However, the increasing use of relational database systems in many real-life applications created an ever increasing need for watermarking database systems. As a result, watermarking relational database systems is now merging as a research area that deals with the legal issue of copyright protec ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
(Show Context)
... However, the increasing use of relational database systems in many real-life applications created an ever increasing need for watermarking database systems. As a result, watermarking relational database systems is now merging as a research area that deals with the legal issue of copyright protection of database systems. Approach: In this study, we proposed an efficient database watermarking algorithm based on inserting binary image watermarks in non-numeric mutli-word attributes of selected database tuples. Results: The algorithm is robust as it resists attempts to remove or degrade the embedded watermark and it is blind as it does not require the original database in order to extract the embedded watermark. Conclusion: Experimental results demonstrated blindness and the robustness of the algorithm against common database attacks.
Review of Robust Video Watermarking Techniques
, 2011
"... There has been a remarkable increase in the data exchange over web and the widespread use of digital media. The mounting interest with reference to digital watermarking throughout the last decade is certainly due to the increase in the need of copyright protection. Applications of video watermarking ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
(Show Context)
There has been a remarkable increase in the data exchange over web and the widespread use of digital media. The mounting interest with reference to digital watermarking throughout the last decade is certainly due to the increase in the need of copyright protection. Applications of video watermarking in copy control, broadcast monitoring, finger printing, video authentication, copyright protection etc is immensely rising. The main aspects of information hiding are capacity, security and robustness. The skill of anyone detecting the information is security and robustness refers to the resistance to modification of the cover content before concealed information is destroyed. Video watermarking algorithms normally prefers robustness. In robust algorithm it is not possible to eliminate the watermark without rigorous degradation of the cover content. In this paper, we introduce the notion of Video Watermarking and features required to design a robust watermarked video for valuable application and focus on various domains of video watermarking techniques.
