Results 1  10
of
19
Video fingerprinting and encryption principles for digital rights management
 Proceedings of the IEEE
, 2004
"... This paper provides a tutorial and survey of digital fingerprinting and video scrambling algorithms based on partial encryption. Necessary design tradeoffs for algorithm development are highlighted for multicast communication environments. We also propose a novel architecture for joint fingerprintin ..."
Abstract

Cited by 35 (0 self)
 Add to MetaCart
(Show Context)
This paper provides a tutorial and survey of digital fingerprinting and video scrambling algorithms based on partial encryption. Necessary design tradeoffs for algorithm development are highlighted for multicast communication environments. We also propose a novel architecture for joint fingerprinting and decryption that holds promise for a better compromise between practicality and security for emerging digital rights management applications. Keywords—Digital fingerprinting tutorial, digital video encryption survey, joint fingerprinting and decryption (JFD), video scrambling. I.
Hardware Implementation Perspectives of Digital Video Watermarking Algorithms
, 2003
"... We consider hardware implementation aspects of the digital watermarking problem through the implementation of a wellknown video watermarking algorithm called Just Another Watermarking System (JAWS); we discuss the time and area constraints that must be satisfied by a successful hardware implementat ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
We consider hardware implementation aspects of the digital watermarking problem through the implementation of a wellknown video watermarking algorithm called Just Another Watermarking System (JAWS); we discuss the time and area constraints that must be satisfied by a successful hardware implementation. A hardware architecture that implements the algorithm under the constraints is then proposed. The architecture is analyzed to gain an understanding of the relationships between algorithmic features and implementation cost. Some general findings of this work that can be applied toward making algorithmic developments more amenable to hardware implementation are finally presented.
Subdivision surface watermarking
, 2006
"... This paper presents a robust nonblind watermarking scheme for subdivision surfaces. The algorithm works in the frequency domain, by modulating spectral coefficients of the subdivision control mesh. The compactness of the watermarking support (a coarse control mesh) has led us to optimize the trade ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
This paper presents a robust nonblind watermarking scheme for subdivision surfaces. The algorithm works in the frequency domain, by modulating spectral coefficients of the subdivision control mesh. The compactness of the watermarking support (a coarse control mesh) has led us to optimize the tradeoff between watermarking redundancy (which insures robustness) and imperceptibility by introducing two contributions: (1) Spectral coefficients are perturbed according to a new modulation scheme analysing the spectrum shape and (2) the redundancy is optimized by using error correcting codes coming from telecommunication theory. Since the watermarked surface can be attacked in a subdivided version, we have introduced an algorithm to retrieve the control polyhedron, starting from a subdivided, attacked version. Experiments have shown the high robustness of our scheme against geometry attacks such as noise addition, quantization or nonuniform scaling and also connectivity alterations such as remeshing or simplification.
Noise Benefits in QuantizerArray Correlation Detection and Watermark Decoding
"... Abstract—Quantizer noise can improve statistical signal detection in arraybased nonlinear correlators in NeymanPearson and maximumlikelihood (ML) detection. This holds even for infinitevariance symmetric alphastable channel noise and for generalizedGaussian channel noise. Noiseenhanced correla ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
Abstract—Quantizer noise can improve statistical signal detection in arraybased nonlinear correlators in NeymanPearson and maximumlikelihood (ML) detection. This holds even for infinitevariance symmetric alphastable channel noise and for generalizedGaussian channel noise. Noiseenhanced correlation detection leads to noiseenhanced watermark extraction based on such nonlinear detection at the pixel or bit level. This yields a noisebased algorithm for digital watermark decoding using two new noisebenefit theorems. The first theorem gives a necessary and sufficient condition for quantizer noise to increase the detection probability of a constant signal for a fixed falsealarm probability if the channel noise is symmetric and if the sample size is large. The second theorem shows that the array must contain more than one quantizer for such a stochasticresonance noise benefit if the symmetric channel noise is unimodal. It also shows that the noisebenefit
Improving the Payload of Watermarking Channels via LDPC Coding
, 2004
"... The payload increase of watermarking channels via the use of lowdensity parity check (LDPC) codes is considered. The bit error rate and payload size problem is addressed in the light of the performance of typical transformdomain spreadspectrum watermarking techniques. Simulation results indicate ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The payload increase of watermarking channels via the use of lowdensity parity check (LDPC) codes is considered. The bit error rate and payload size problem is addressed in the light of the performance of typical transformdomain spreadspectrum watermarking techniques. Simulation results indicate that the information payload can be doubled via judicious use of LDPC codes visvis the performance of the Bose ChaudhuriHochquenghem and repetition codes.
The application of saturating detectors to a DCTdomain watermarking scheme
 Fluctuation and Noise Lett
, 2008
"... The present paper proposes a discrete cosine transform (DCT) domain watermarking scheme by exploiting nonlinear dynamical saturating detectors in the design of a watermark detection process. A binary copyright character, i.e. watermark to be hidden into an image, is firstly reordered into a binary ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
The present paper proposes a discrete cosine transform (DCT) domain watermarking scheme by exploiting nonlinear dynamical saturating detectors in the design of a watermark detection process. A binary copyright character, i.e. watermark to be hidden into an image, is firstly reordered into a binary zigzag sequence, and then mapped onto the pulse amplitude modulated signal. A certain desynchronization time delay can be deliberately placed into one code of the modulated signal, and is tolerated due to the superior robustness of nonlinear detectors over matched filters. A selected set of DCT coefficients of a host image in a mid frequency range is shuffled by the Arnold transform, which makes it look more like background noise with respect to the watermark signal. Then, the watermark signal is embedded in the set of shuffled DCT coefficients. The copyright character can be extracted by a nonlinear saturating detector without prior knowledge of the original image and watermark, i.e. blind watermark detection. Interestingly, a higher match between the original watermark character and the extracted one can be further achieved by a parallel array of nonlinear detectors via the mechanism of array stochastic resonance. Robustness of the proposed watermarking scheme is shown in the presence of noise, filtering, cropping, and compression.
A watermarking framework for subdivision surfaces
 in Proc. of LNCS, vol. 4195, Multimedia Content Representation, Classification and Security
"... Abstract. This paper presents a robust watermarking scheme for 3D subdivision surfaces. Our proposal is based on a frequency domain decomposition of the subdivision control mesh and on spectral coefficients modulation. The compactness of the cover object (the coarse control mesh) has led us to optim ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. This paper presents a robust watermarking scheme for 3D subdivision surfaces. Our proposal is based on a frequency domain decomposition of the subdivision control mesh and on spectral coefficients modulation. The compactness of the cover object (the coarse control mesh) has led us to optimize the tradeoff between watermarking redundancy (which insures robustness) and imperceptibility by introducing two contributions: (1) Spectral coefficients are perturbed according to a new modulation scheme analyzing the spectrum shape and (2) the redundancy is optimized by using error correcting codes. Since the watermarked surface can be attacked in a subdivided version, we have introduced a socalled synchronization algorithm to retrieve the control polyhedron, starting from a subdivided, attacked version. Through the experiments, we have demonstrated the high robustness of our scheme against both geometry and connectivity alterations. 1
DIGITAL ARCHIVE AND MULTIMEDIA LIBRARY FOR BULGARIAN TRADITIONAL CULTURE AND FOLKLORE
, 2011
"... ..."
Limits of Error Correction Coding in Video Watermarking
"... The paper discusses the limits of error correction coding for spread spectrumbased video watermarking. The error correction code has as input the watermark data bits and as output the values which will be scaled and used to modify the video pixels (transform coefficients). The data rate of the wate ..."
Abstract
 Add to MetaCart
(Show Context)
The paper discusses the limits of error correction coding for spread spectrumbased video watermarking. The error correction code has as input the watermark data bits and as output the values which will be scaled and used to modify the video pixels (transform coefficients). The data rate of the watermark can increase only at the expense of increasing code rate. Theoretically, the scheme is seen as a communication channel with Gaussian additive noise interference. Shannon’s (ideal) spherical codes are used as the error correcting code to calculate the minimum signal to noise ratio (SNR) necessary for a coding scheme with a given block length to achieve a given error probability. This limit is different from Shannon’s asymptotic limit, which is valid for infinite block lengths and zero error probability. In practice, in order to verify the Gaussian channel assumption, the error correction code is a concatenation of codes, of which the innermost is a repetition code. Several practical codes of different length and rates, such as turbo codes and BCH codes are investigated and their performance compared to that of the ideal code of the same size. The compromise block length/code rate is investigated for several marking schemes and attacks.