#### DMCA

## Optimal Data-Hiding Strategies for Games with

### Citations

490 | Quantization index modulation: A class of provably good methods for digital watermarking and information embedding
- Chen, Wornell
- 2001
(Show Context)
Citation Context ...ch representing a different codeword b. So, given a host vector x and an information codeword b, the embedder constructs the watermarked vector y by simply quantizing x with Q b (·), i.e. y = Q b (x) =-=[10]-=-. We will only consider here one of the simplest implementations of quantization-based schemes, carried out by means of uniform dithered quantizers, which has been named Distortion-Compensated Dither ... |

261 | Information-Theoretic Analysis of Information Hiding
- Moulin, O'Sullivan
- 2003
(Show Context)
Citation Context ...e researchers have dealt with game-theoretic aspects of data hiding capacities [1], [2]. However payoffs other than channel capacity are also possible in the data hiding game, as already suggested in =-=[3]-=- and developed in [4]. Here, we build on this idea to determine optimal playing strategies by considering that the bit error rate (BER) for the hidden information defines the payoff in the game. The m... |

133 | The Gaussian watermarking game
- Cohen, Lapidoth
- 2002
(Show Context)
Citation Context ...nalyses are also shown, with examples of watermarking in the spatial domain as well as the DCT domain. 1 Introduction Some researchers have dealt with game-theoretic aspects of data hiding capacities =-=[1]-=-, [2]. However payoffs other than channel capacity are also possible in the data hiding game, as already suggested in [3] and developed in [4]. Here, we build on this idea to determine optimal playing... |

132 | DCT-Domain Watermarking Techniques for Still Images: Detector Performance Analysis and a New Structure”in
- Hernández, Amado, et al.
- 2000
(Show Context)
Citation Context ... computed using the method detailed in [7], except for the DC-DM scheme where, for illustrative purposes, we have chosen to work in the DCT domain, with a perceptual mask that has been obtained as in =-=[13]-=-.sOptimal Data-Hiding Strategies for Games with BER Payoffs. 13 First, in Figure 2 the Pe’s resulting when different strategies are considered for spread-spectrum (Section 3) are shown. Watermarking h... |

66 | Statistical analysis of watermarking schemes for copyright protection of images
- Hernandez, Gonzalez
- 1999
(Show Context)
Citation Context ... consider here only additive data hiding, that is, given the host image x and the watermark w, the resulting watermarked image can be written as y = x + w (1) We will also follow the customary scheme =-=[5]-=-, [6] for embedding a particular information bit bi by using a tile Si � {k1, · · · , k |Si|} of pseudorandomly chosen indices, selecting Li = |Si| samples from x depending on a cryptographic key K, s... |

63 | Performance analysis of existing and new methods for data hiding with known-host information in additive channels
- Pérez-González, Balado, et al.
- 2003
(Show Context)
Citation Context ...ider here only additive data hiding, that is, given the host image x and the watermark w, the resulting watermarked image can be written as y = x + w (1) We will also follow the customary scheme [5], =-=[6]-=- for embedding a particular information bit bi by using a tile Si � {k1, · · · , k |Si|} of pseudorandomly chosen indices, selecting Li = |Si| samples from x depending on a cryptographic key K, so tha... |

53 |
Informed Watermarking
- Eggers, Girod
- 2002
(Show Context)
Citation Context ...es are also shown, with examples of watermarking in the spatial domain as well as the DCT domain. 1 Introduction Some researchers have dealt with game-theoretic aspects of data hiding capacities [1], =-=[2]-=-. However payoffs other than channel capacity are also possible in the data hiding game, as already suggested in [3] and developed in [4]. Here, we build on this idea to determine optimal playing stra... |

53 | Performance Analysis of a 2-D Multipulse Amplitude Modulation Scheme for Data Hiding and Watermarking of Still Images
- Hernandez, Perez-Gonzalez, et al.
- 1998
(Show Context)
Citation Context ...mulations, while lines show theoretical results. Empirical data come from the gray-scale Lena image (256 × 256), for which the spatial perceptual mask α has been computed using the method detailed in =-=[7]-=-, except for the DC-DM scheme where, for illustrative purposes, we have chosen to work in the DCT domain, with a perceptual mask that has been obtained as in [13].sOptimal Data-Hiding Strategies for G... |

28 |
A.: The zero-rate spread-spectrum watermarking game
- Moulin, Ivanovic
- 2003
(Show Context)
Citation Context ...alt with game-theoretic aspects of data hiding capacities [1], [2]. However payoffs other than channel capacity are also possible in the data hiding game, as already suggested in [3] and developed in =-=[4]-=-. Here, we build on this idea to determine optimal playing strategies by considering that the bit error rate (BER) for the hidden information defines the payoff in the game. The main purpose of this p... |

25 |
Feasible direction interior-point technique for nonlinear optimization
- Herskovits
- 1998
(Show Context)
Citation Context ...M,M) which is reasonable in many practical situations: as an example we have closely studied Wiener filtering and made the whole numerical optimization taking into account all the values of hk,l [8], =-=[9]-=-. The results are virtually the same as those we obtained with the proposed simplification. The explanation is based on the fact that the central element of the filter is much larger than the others, ... |

6 | Nothing but a kiss: A novel and accurate approach to assessing the performance of multidimensional distortion-compensated dither modulation
- Pérez-González, Balado
- 2002
(Show Context)
Citation Context ... i = 1, · · · , N (29) � where Bj � diag βj1/∆2 j1 , · · · , βjLj/∆2 � being the βi some weights the dejLj coder will use to improve decoding. Following the discussion on the decision regions made in =-=[11]-=-, we can assume without loss of generality that a symbol bi = −1 is sent, and that xi is such that Q−1(xi) = 0. Let Pe(i) denote the bit error probability conditioned to the transmission of the i-th b... |

4 | Dither-modulation data hiding with distortion-compensation: Exact performance analysis and an improved detector for JPEG attacks
- Pérez-Gonzàlez, Comesaña, et al.
- 2003
(Show Context)
Citation Context ... pdf’s results in a very slow convergence. In any case, it may be reasonable to use (35) as the functional to be maximized (minimized) by the attacker (decoder). The exact value of Pe can be obtained =-=[12]-=-, but it leads to a cumbersome expression that hinders the solution. Optimal Decoding Weights for a Known Attack Distribution Recalling that the Q(·) function is monotonically decreasing, it follows t... |

1 |
Análisis y control óptimo de problemas relacionados con la dispersión de contaminantes
- Vázquez-Méndez
(Show Context)
Citation Context ...· , hM,M) which is reasonable in many practical situations: as an example we have closely studied Wiener filtering and made the whole numerical optimization taking into account all the values of hk,l =-=[8]-=-, [9]. The results are virtually the same as those we obtained with the proposed simplification. The explanation is based on the fact that the central element of the filter is much larger than the oth... |