Results 1 
6 of
6
Performance Analysis of Existing and New Methods for Data Hiding with KnownHost Information in Additive Channels
 PROCESSING, SPECIAL ISSUE ON SIGNAL PROCESSING FOR DATA HIDING IN DIGITAL MEDIA AND SECURE CONTENT DELIVERY
, 2002
"... A considerable amount of attention has been lately payed to a number of data hiding methods based in quantization, seeking to achieve in practice the results predicted by Costa for a channel with side information at the encoder. With the objective of filling a gap in the literature, this paper suppl ..."
Abstract

Cited by 63 (15 self)
 Add to MetaCart
A considerable amount of attention has been lately payed to a number of data hiding methods based in quantization, seeking to achieve in practice the results predicted by Costa for a channel with side information at the encoder. With the objective of filling a gap in the literature, this paper supplies a fair comparison between significant representatives of both this family of methods and the former spreadspectrum approaches that make use of nearoptimal ML decoding; the comparison is based on measuring their probabilities of decoding error in the presence of channel distortions. Accurate analytical expressions and tight bounds for the probability of decoding error are given and validated by means of Monte Carlo simulations. For Dithered Modulation (DM) a novel technique that allows to obtain tighter bounds to the probability of error is presented. Within the new framework, the strong points and weaknesses of both methods are distinctly displayed. This comparative study allows us to propose a new technique named "Quantized Projection" (QP), which by adequately combining elements of those previous approaches, produces gains in performance.
DitherModulation Data Hiding with DistortionCompensation: Exact Performance Analysis and an Improved Detector for JPEG Attacks
 in Proc. of the IEEE International Conference on Image Processing (ICIP
, 2003
"... The binary Distortion Compensated DitherModulation (DCDM) , which can be regarded to as a baseline for quantizationbased datahiding methods, is rigorously analyzed. A novel and accurate procedure for computing the exact probability of bit error is given, as well as an approximation amenable to d ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The binary Distortion Compensated DitherModulation (DCDM) , which can be regarded to as a baseline for quantizationbased datahiding methods, is rigorously analyzed. A novel and accurate procedure for computing the exact probability of bit error is given, as well as an approximation amenable to differentiation which allows to obtain the optimal weights in a newly proposed decoding structure, for significant improvements on performance. The results are particularized for a JPEG compression scenario which allows to show their usefulness. Experimental results validating the proposed theory are presented.
Contributors
, 2005
"... PP Restricted to other programme participants (including the Commission services) RE Restricted to a group specified by the consortium (including the Commission services) CO Confidential, only for members of the consortium (including the Commission services) ..."
Abstract
 Add to MetaCart
(Show Context)
PP Restricted to other programme participants (including the Commission services) RE Restricted to a group specified by the consortium (including the Commission services) CO Confidential, only for members of the consortium (including the Commission services)
Index Terms
, 2008
"... The problem of optimum watermark embedding and detection was addressed in a recent paper by Merhav and Sabbag, where the optimality criterion was the maximum false–negative error exponent subject to a guaranteed false– positive error exponent. In particular, Merhav and Sabbag derived universal asymp ..."
Abstract
 Add to MetaCart
The problem of optimum watermark embedding and detection was addressed in a recent paper by Merhav and Sabbag, where the optimality criterion was the maximum false–negative error exponent subject to a guaranteed false– positive error exponent. In particular, Merhav and Sabbag derived universal asymptotically optimum embedding and detection rules under the assumption that the detector relies solely on second order joint empirical statistics of the received signal and the watermark. In the case of a Gaussian host signal and a Gaussian attack, however, closed–form expressions for the optimum embedding strategy and the false–negative error exponent were not obtained in that work. In this paper, we derive such expressions, again, under the universality assumption that neither the host variance nor the attack power are known to either the embedder or the detector. The optimum embedding rule turns out to be very simple and with an intuitively–appealing geometrical interpretation. The improvement with respect to existing sub–optimum schemes is demonstrated by displaying the optimum false–negative error exponent as a function of the guaranteed false–positive error exponent.
IMPROVED BINARY DITHERMODULATION WITH PERCEPTUAL CONSTRAINTS
"... The binary Distortion Compensated DitherModulation (DCDM), which can be regarded to as a baseline for quantizationbased datahiding methods, is rigorously analyzed. An accurate procedure for computing the exact probability of bit error is given, as well as the optimal weights in a newly proposed d ..."
Abstract
 Add to MetaCart
(Show Context)
The binary Distortion Compensated DitherModulation (DCDM), which can be regarded to as a baseline for quantizationbased datahiding methods, is rigorously analyzed. An accurate procedure for computing the exact probability of bit error is given, as well as the optimal weights in a newly proposed decoding structure, for significant improvements on performance. The results are particularized for a JPEG compression scenario which allows to show their usefulness. Also a comparison between squared error and perceptual distorsion measurements is done. Experimental results validating the proposed theory are presented. 1. INTRODUCTION. Although quantizationbased methods have been presented since the beginnings of watermarking, it was not until very
Optimal DataHiding Strategies for Games with
"... Abstract. We analyze three different data hiding methods from a gametheoretic point of view, using the probability of bit error as the payoff. Those data hiding schemes can be regarded to as representatives of three families of methods: spreadspectrum, informedembedding and hybrid. In all cases, w ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We analyze three different data hiding methods from a gametheoretic point of view, using the probability of bit error as the payoff. Those data hiding schemes can be regarded to as representatives of three families of methods: spreadspectrum, informedembedding and hybrid. In all cases, we have obtained theoretical expressions for the BER which are then optimized to derive the strategies for both the attacker and the decoder, assuming that the embedder simply follows pointbypoint constraints given by the perceptual mask. Experimental results supporting our analyses are also shown, with examples of watermarking in the spatial domain as well as the DCT domain. 1